Metraipolis › archive › dc_60aff7ca72b1
PAGE-RAG: Provenance-Aware Graph Evidence Promotion for Fixed-Budget Multi-hop Retrieval-Augmented Generation — arXiv:2608.29753
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29753
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T07:44:22.736Z
- SHA-256 of the archived text
816ca8feef0a15c098cdc06f8b5d7506620f38c1c863459cccf46777596fe924- Stable URL of this page
https://metraipolis.com/documento/dc_60aff7ca72b1
How to cite
PAGE-RAG: Provenance-Aware Graph Evidence Promotion for Fixed-Budget Multi-hop Retrieval-Augmented Generation — arXiv:2608.29753 — arXiv (en), https://arxiv.org/abs/2608.29753 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_60aff7ca72b1 (Metraipolis archive dc_60aff7ca72b1, sha256 816ca8feef0a15c098cdc06f8b5d7506620f38c1c863459cccf46777596fe924)
BibTeX
@misc{dc60aff7ca72b1,
title = {PAGE-RAG: Provenance-Aware Graph Evidence Promotion for Fixed-Budget Multi-hop Retrieval-Augmented Generation — arXiv:2608.29753},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29753},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_60aff7ca72b1; sha256 816ca8feef0a15c098cdc06f8b5d7506620f38c1c863459cccf46777596fe924},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29753. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multi-hop question answering in retrieval-augmented gener?ation (RAG) often benefits from retrieving beyond the few candidates that will finally be read: narrow retrieval can miss an indispensable hop, while expanded retrieval introduces topical distractors. This challenge is not tied to a particu?lar knowledge-base format. Candidate pools may come from standalone retrievers, standard RAG backends, or graph-based retrieval pipelines. What is needed is a query-aware selection layer that can use relational structure to filter candidates be?fore generation. PAGE-RAG addresses this setting by using a graph as a temporary selection structure, rather than assum?ing a graph-structured knowledge base. It builds a query-local graph over retrieved candidates, records why candidates are connected, and treats each connection as a support hypothe?sis rather than support itself. We identify the resulting failure mode as a connectivity-support gap: connected candidates do not necessarily support the answer. We propose PAGE-RAG, a Provenance-Aware Graph Evidence promotion method that scores candidate paths with relevance, source-tracing meta?data, specificity, hubness, noise, and coherence signals, and applies minimal sufficient selection to promote supporting facts into a compact reader context. PAGE-RAG can serve as a complete retrieval-to-reading pipeline, and the same promo?tion stage can be inserted after existing retrieval or RAG sys?tems without replacing their upstream retrieval logic. Across three multi-hop QA benchmarks under the same final bud?get, PAGE-RAG improves support F1 and answer F1 by 10.4 and 3.3 points on a weighted average over a strong retriever. As a plug-in, PAGE-RAG further improves all reported RAG backends, including reasoning-oriented, compression-based, graph-based, and document/chunk-level systems. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2608.29753 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T07:28:26.560Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).