Query-Aware Flow Diffusion for Graph-Based RAG with Retrieval Guarantees
The paper introduces Query-Aware Flow Diffusion for Graph-Based Retrieval-Augmented Generation (QAFD-RAG), a new framework designed to enhance graph traversal based on query semantics. This approach aims to improve the relevance of retrieved subgraphs while providing statistical guarantees for their quality. Experimental results indicate that QAFD-RAG consistently outperforms existing graph-based methods in tasks such as question answering and text-to-SQL.
- ▪QAFD-RAG dynamically adapts graph traversal to align with the holistic semantics of each query.
- ▪The framework provides statistical guarantees for the quality of retrieved subgraphs under mild conditions.
- ▪Experiments show that QAFD-RAG achieves significant improvements over state-of-the-art graph-based RAG methods.
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2605.18775 |
| Publication time | Wed, 20 May 2026 00:00:00 -0400 |
| Retrieval time | 2026-05-20T04:04:59.484Z |
| Last seen | 2026-05-20T04:04:59.484Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | EcQ0RUHSkfry |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Information Retrieval arXiv:2605.18775 (cs) [Submitted on 21 Apr 2026] Title:Query-Aware Flow Diffusion for Graph-Based RAG with Retrieval Guarantees Authors:Zhuoping Zhou, Davoud Ataee Tarzanagh, Sima Didari, Wenjun Hu, Baruch Gutow, Oxana Verkholyak, Masoud Faraki, Heng Hao, Hankyu Moon, Seungjai Min View a PDF of the paper titled Query-Aware Flow Diffusion for Graph-Based RAG with Retrieval Guarantees, by Zhuoping Zhou and 9 other authors View PDF HTML (experimental) Abstract:Graph-based Retrieval-Augmented Generation (RAG) systems leverage interconnected knowledge structures to capture complex relationships that flat retrieval struggles with, enabling multi-hop reasoning.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.
Discussion
0 commentsMore from arXiv cs.AI
