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.
By Harshdeep Singh, Yurui Zhu, Giovanni Colavizza, Matteo Romanello
arXiv:2508. 01815v2 Announce Type: replace-cross Abstract: Text-to-SPARQL maps natural-language questions to executable SPARQL queries over RDF knowledge graphs.
By Yang Zhao, Chengxiao Dai, Yue Xiu, Dusit Niyato
arXiv:2602. 11745v2 Announce Type: replace Abstract: Graph models are fundamental to data analysis in domains rich with complex relationships.
By Songlin Lyu, Lujie Ban, Zihang Wu, Tianqi Luo, Jirong Liu, Ayoub Moussaid, Oskar van Rest, Heng Lin, Chenhao Ma, Nan Tang, Shipeng Qi, Yongchao Liu, Zhan Qiu, Juelu Zhang, Jiajun Zheng
arXiv:2610.34866v1 Announce Type: new
Abstract: Large Language Models (LLMs) have shown remarkable capabilities across tasks, but they still struggle with complex reasoning that requires integrating...
By Zicheng Zhao, Linhao Luo, Zongji Yu, Junnan Dong, Yanchao Tan, Shirui Pan, Chen Gong
Enrich-on-Graph (EoG) is a flexible framework that uses large language models to enrich knowledge graphs, thereby bridging the semantic gap between structured graphs and unstructured queries in complex reasoning tasks. By leveraging LLMs’ prior knowledge, EoG enables efficient evidence extraction from knowledge graphs, achieving precise and robust reasoning while maintaining low computational costs and scalability. The authors also introduce three graph quality evaluation metrics for query‑graph alignment, theoretically validate their optimization objectives, and demonstrate state‑of‑the‑art performance on two KGQA benchmark datasets.
By Songze Li, Zhiqiang Liu, Zhengke Gui, Huajun Chen, Wen Zhang
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.
By Bihao Zhan, Zongsheng Cao, Jie Zhou, Bo Zhang, Liang He
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...
By Dobrik Georgiev, Kheeran K. Naidu, Alberto Cattaneo, Federico Monti, Carlo Luschi, Daniel Justus
ArcRAG is a retrieval-augmented generation system that operates over knowledge graphs without relying on construction‑specific schemas or relation names. It dynamically induces a query‑local graph interface at inference time, plans multi‑hop traversals, and executes them as Cypher queries. Experiments on MuSiQue, HotpotQA, and TriviaQA show that ArcRAG remains effective across both schema‑guided and open‑information‑extraction graph constructions, demonstrating that retrieval can be construction‑agnostic.
By Jyotin Goel, Abhinav Arun, Tejas Prakash Agarwal, Bhaskarjit Sarmah, Stefano Pasquali
arXiv:2607. 14494v1 Announce Type: new Abstract: Complex knowledge base question answering (KBQA) is commonly approached through either information retrieval over a question-specific subgraph or semantic parsing into an executable logical form.
By Yiming Zhang, Koji Tsuda
arXiv:2502. 11491v3 Announce Type: replace-cross Abstract: Large language models (LLMs) have shown remarkable capabilities in natural language processing.
By Runxuan Liu, Bei Luo, Jiaqi Li, Baoxin Wang, Ming Liu, Dayong Wu, Shijin Wang, Bing Qin
arXiv:2606. 08481v1 Announce Type: cross Abstract: Enterprise property graphs vary widely in schema structure, internal terminology, domain assumptions, governance constraints, and user interaction patterns.
By Suraj Ranganath, Anish Raghavendra
GraphRAGProv is an architecture that combines GraphRAG with how‑provenance by executing SPARQL queries over source‑grounded RDF graphs to compute answers and their provenance polynomials. The polynomials record which statement occurrences were used and how they were combined, linking each occurrence to its source text so users can verify the extraction and query process. An interactive demo evaluated 400 cases from two multi‑hop QA benchmarks, uncovering extraction and query errors even when the final answer was correct.
By Wadie El Amrani, Luis Gal\'arraga