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.
arXiv:2603. 24925v2 Announce Type: replace Abstract: Retrieval-augmented generation (RAG) systems that rely on semantic search often fail to retrieve the complete set of evidence for complex queries, particularly when information is distributed across multiple sources.
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...
arXiv:2606. 30133v1 Announce Type: cross Abstract: Retrieval-augmented generation built on knowledge graphs (Graph RAG) outperforms flat passage retrieval on multi-hop question answering by leveraging graph structure.
arXiv:2603.28773v2 Announce Type: replace-cross Abstract: Large language models (LLMs) frequently generate confident yet factually incorrect content when used for language generation (a phenomenon of...
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.
R$^{2}$Adapter is a lightweight plug‑in that dynamically routes user queries between vanilla and graph‑based Retrieval‑Augmented Generation (RAG) systems. By sending only those queries that truly benefit from graph reasoning, it cuts graph‑retrieval overhead by up to 59% while keeping answer accuracy comparable. The adapter also rewrites uncertain graph‑routed queries to better expose multi‑hop reasoning needs, improving retrieval quality without extra supervision.
The paper introduces EXYGEN, a framework that enables conversational access to large knowledge graphs by combining VoID descriptions, ShEx schemas, retrieved triples, and example question‑query pairs in a retrieval‑augmented generation pipeline. On the SciQA benchmark, this approach achieves an exact‑match score of 0.419 without fine‑tuning any large language model, and shows that larger general‑purpose LLMs can outperform smaller code‑specialized ones when provided sufficient context. To scale metadata generation for very large KGs, the authors propose a predicate‑coverage‑aware parallel graph sampling strategy that preserves structural diversity, reduces runtime by over 80× on OpenCitations Meta and GESIS, and is the only tractable method for obtaining complete metadata on ORKG.
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.
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...
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.
arXiv:2606. 17856v1 Announce Type: new Abstract: Graph-based retrieval-augmented generation (GraphRAG) is effective for knowledge-intensive and multi-hop query tasks; however, many existing methods primarily seed entity-based graphs and rely on implicit semantic relevance propagation.
The paper presents an end‑to‑end pipeline for automatically constructing a tree‑structured knowledge graph (KG) from Vietnamese high school history textbooks and evaluating retrieval strategies that exploit the KG’s hierarchical structure. The KG construction uses a three‑phase hybrid relation extraction process, including intra‑batch deduplication, approximate cross‑batch search, and LLM extraction with a centroid filter and dual‑LLM validator, resulting in 750 nodes and 4,341 semantic edges across 41 ontology types. Retrieval evaluation compares three graph traversal strategies—Top‑Down, Horizontal, and Bottom‑Up—on a benchmark of 1,210 Vietnamese queries, finding that the Top‑Down strategy with structural information outperforms a vector baseline by 4.7 percentage points in NDCG@10.