This four-stage passage-retrieval pipeline exploits inter-document reference signals to recover multi-hop evidence chains without requiring the construction of graphs from expensive pretrained language model calls.
Abstract
Cross-document knowledge retrieval requires the retrieval and synthesis of evidence scattered across multiple passages linked by implicit or explicit inter-document references. Existing methods either treat the corpus as a flat collection of independent passages, thereby forfeiting the links that connect evidence fragments, or reconstruct those links by generating synthetic entity triples, an expensive process that introduces hallucinated graph edges. To address this, we propose BRIDGE (Bridging Retrieval with Inter-Document Graph Expansion). This four-stage passage-retrieval pipeline exploits inter-document reference signals to recover multi-hop evidence chains without requiring the construction of graphs from expensive pretrained language model calls. To bridge the gap between flat retrieval and complex query resolution, the pipeline begins by fusing lexical term frequency and the dense embedding signals via Reciprocal Rank Fusion using an INT8-quantised vector index that compresses the embedding store by $4\times $ . It then applies a cross-encoder model as an initial precision gate to discover supporting passages that share a minimal lexical overlap with the query. And subsequently, the system traverses an inter-document reference graph anchored on cross-reference structures using Personalised PageRank. Finally, a cross-encoder reranking is performed on the merged candidate pool to ensure consistent scoring across both retrieved and graph-expanded passages. We evaluate BRIDGE on three established multi-hop QA benchmarks: HotpotQA, MuSiQue, and 2WikiMultiHopQA. Without any dataset-specific tuning, our approach achieves Recall@2 of 79.8, 41.5, and 65.7, respectively, matching or exceeding baselines including HippoRAG (59.0, 41.0, 71.5) and ColBERTv2 (64.7, 37.9, 59.2) on two of three benchmarks. Our ablation analysis confirms that reference-graph expansion discovers an average of 7.0 additional relevant passages per query, while the final cross-encoder reranking prevents score displacement and maintains top-of-list precision.
Graph-based retrieval-augmented generation supports multi-hop retrieval by organizing corpus information into graphs. However, existing relation-free graph retrieval methods rely primarily on query-sentence similarity to search for evidence. This can exclude useful bridging evidence with low query similarity and activa...
Results show that observed evidence can guide graph retrieval toward the part of a supporting chain left underspecified by the original question, and introduce EviReform, which separates revising the retrieval request from aggregating evidence in the graph.
Results show that geometric structure can support efficient multi-hop evidence discovery without LLM-based graph construction, and introduce Geometric Gain Graph RAG, a document-only framework whose offline graph construction uses no LLM calls or generated tokens.
Ze-Liang Li, Xiao-Fen Xing, K. Guo et al.· 0 citations
This work proposes EnSI-RAG (Entity-Structure-Indexed Retrieval-Augmented Generation), a framework that constructs a query-independent, entity-centered index that separates evidence localization from answer synthesis while preserving traceable source evidence.
Xuan-Yu Meng, Jiashuo Sun, Jash Parekh et al.· 1 citation
Dual-Hypergraph Indexing (DHI), a hierarchical representation framework that elevates discrete facts into structured analytical insights, provides a robust architecture for next-generation multi-hop RAG.
Qi Sun, Cai-Bo Li, Yi-Jia Zhang et al.· 1 citation
This work presents an additive, engine-neutral second pass that discovers latent ties in knowledge graphs that are often leaving semantically related entities disconnected across documents without altering extracted facts.
B. Karamete, Hunter Casten· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.