arXiv:2609.37661v1 Announce Type: new
Abstract: Graph-based retrieval-augmented generation supports multi-hop retrieval by organizing corpus information into graphs. However, existing relation-free g...
By Baoxian Liu, Tong Wei
arXiv:2601. 18579v2 Announce Type: replace-cross Abstract: Graph RAG on corpus graphs enhances retrieval by leveraging intermediate node content as contextual clues to uncover unretrieved oracle nodes.
By Seonho An, Chaejeong Hyun, Min-Soo Kim
arXiv:2609.36359v1 Announce Type: new
Abstract: Graph-based approximate nearest neighbor search (ANNS) is widely used for large-scale semantic search. Its indices are constructed primarily based on g...
By Fangzhou Wu, Haike Xu, Sandeep Silwal
arXiv:2606. 00610v1 Announce Type: cross Abstract: Retrieval-Augmented Generation (RAG) has become an essential method for mitigating hallucinations in Large Language Models (LLMs) by leveraging external knowledge.
By Chuanjie Wu, Zhishang Xiang, Yunbo Tang, Zerui Chen, Qinggang Zhang, Jinsong Su
arXiv:2505.13994v3 Announce Type: replace
Abstract: Retrieval-Augmented Generation (RAG) systems empower large language models (LLMs) with external knowledge, yet struggle with efficiency-accuracy tr...
By Ruiyi Yang, Hao Xue, Imran Razzak, Shirui Pan, Hakim Hacid, Flora D. Salim
arXiv:2605. 30237v2 Announce Type: replace-cross Abstract: Semi-structured knowledge bases (SKBs) embed textual documents in a typed graph of entities and relations, and underpin applications such as product search, academic paper search, and precision-medicine inquiries.
By Yicheng Tao, Yiqun Wang, Xiangchen Song, Xin Luo, Kai Liu, Jie Liu
arXiv:2603. 29875v3 Announce Type: replace-cross Abstract: One of the key problems in Retrieval-augmented generation (RAG) systems is that chunk-based retrieval pipelines represent the source chunks as atomic objects, mixing the information contained within such a chunk into a single vector.
By Ryszard Tuora, Mateusz Gali\'nski, Micha{\l} Godziszewski, Micha{\l} Karpowicz, Mateusz Czy\.znikiewicz, Adam Kozakiewicz, Tomasz Zi\k{e}tkiewicz
arXiv:2606. 18075v1 Announce Type: new Abstract: Retrieval-Augmented Generation (RAG) has emerged as a paradigm for enhancing large language models (LLMs) with external knowledge, yet existing graph-based methods face a fundamental limitation: entity-centric and chunk-centric approaches operate on representations anchored to original text without true knowledge fusion.
By Haoyang Zhong, Yifei Sun, Antong Zhang, Chunping Wang, Lei Chen, Yang Yang
arXiv:2511. 05385v2 Announce Type: replace-cross Abstract: Retrieval-Augmented Generation (RAG) utilizes external knowledge to augment Large Language Models' (LLMs) reliability.
By Chao Zhang, Yuhao Wang, Derong Xu, Haoxin Zhang, Yuanjie Lyu, Yuhao Chen, Shuochen Liu, Tong Xu, Xiangyu Zhao, Yan Gao, Yao Hu, Enhong Chen
VikingRAG is a directory‑aware semantic data management system that reduces token usage in retrieval‑augmented generation by tightly integrating semantic and structural access. It employs multi‑round retrieval traces as reusable experience edges and an adaptive escalation strategy to avoid unnecessary multi‑round exploration. Experiments show that VikingRAG achieves comparable accuracy to state‑of‑the‑art methods while using only 11.6%–51.9% of their tokens, and further reductions to 5.1%–32.5% with trace reuse and escalation.
By Peiyuan Gao, Gaoyuan Zhang, Haojie Qin, Yahui Sun, Qianyi Zhang, Yunhao Zhang, Zeyu Wang, Wei Lu
arXiv:2608. 07994v1 Announce Type: new Abstract: Retrieval-Augmented Generation (RAG) is essential for enterprise knowledge question answering (QA), particularly in domains with complex product documentation like telecommunications.
By Wenqi Chen, Haofei Yang, Rui Yang, Fangming Li
Quanta is an open‑source Python library that unifies dense vector search over 4‑bit quantised embeddings, BM25 full‑text retrieval, and knowledge‑graph traversal behind a single retrieval API. It combines signals using weighted reciprocal rank fusion instead of normalising heterogeneous scores, arguing that such normalisations are query‑dependent. The library treats the graph as a candidate expander rather than a relevance scorer, widening the candidate pool and then re‑scoring documents with dense indexes under an identifier allowlist.
By Ioannis E. Livieris