KGFR introduces a Knowledge Graph Foundation Retriever that collaborates with large language models to enhance knowledge‑intensive question answering. By encoding relations with LLM‑generated descriptions and initializing entities from question roles, KGFR enables zero‑shot generalization to unseen knowledge graphs. Its Asymmetric Progressive Propagation technique efficiently handles large graphs, while a controllable reasoning loop allows the LLM to request candidate answers, supporting facts, and reasoning paths.
By Yuanning Cui, Zequn Sun, Wei Hu, Zhangjie Fu
arXiv:2604. 12503v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have shown remarkable capabilities across various tasks but remain prone to hallucinations in knowledge-intensive scenarios.
By Shuai Wang, Xixi Wang, Yinan Yu
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:2511.04473v3 Announce Type: replace
Abstract: Retrieval of information from graph-structured knowledge bases represents a promising direction for improving the factuality of LLMs. While various...
By Alberto Cattaneo, Carlo Luschi, Daniel Justus
The paper investigates how the textual serialization of knowledge graphs influences the performance of large language models (LLMs). It evaluates 15 different graph representation formats across nine advanced LLM configurations on tasks involving ontology-based knowledge extraction and structural graph reasoning. While knowledge extraction shows little sensitivity to serialization, structural reasoning accuracy varies significantly depending on the chosen format, model, query, and task, suggesting that graph serialization should be treated as a dynamic orchestration decision.
By Julien Yu, Mihaela Bornea, Avirup Sil, Katrin Kirchhoff
arXiv:2606. 03705v1 Announce Type: new Abstract: Knowledge Graphs (KGs) are widely used to mitigate the limitations of Large Language Models (LLMs), such as outdated knowledge and hallucinations.
By Weiwei Ding, Zixuan Li, Long Bai, Zhuo Chen, Kun Su, Fei Wang, Xiaolong Jin, Jin Zhang, Jiafeng Guo, Xueqi Cheng
arXiv:2610.08388v1 Announce Type: cross
Abstract: Large language models (LLMs) have demonstrated strong capabilities in question answering, yet they still frequently suffer from hallucinations on kno...
By Yang Hong, Yajun Yang, Xin Wang, Liping Jing, Qinghua Hu
arXiv:2607. 19398v1 Announce Type: new Abstract: Multi-entity compositional questions pose significant challenges to existing retrieval-augmented language models.
By Junyi Wang
The paper introduces the Structure-Internalized Rule Language Model (SIRLM) to improve Knowledge Graph Reasoning (KGR) by addressing the mismatch between KG structural context and Large Language Model (LLM) parametric knowledge. SIRLM centers on a Structure-Internalized Rule Generator (SIRG) that uses in-context learning, a structural relation memory, a KG tokenizer, and a neuro-symbolic reasoner to generate structural rules and provide faithful rule-execution feedback. Experiments on 36 datasets against 17 state‑of‑the‑art KGR methods show that SIRLM achieves significant performance gains.
By Xingrui Zhuo, Jiapu Wang, Manzong Huang, Gongqing Wu, Xindong Wu
arXiv:2607. 14114v1 Announce Type: cross Abstract: Graph learning under distribution shift presents a persistent challenge, where models adapt to new graphs with limited or even no supervision.
By Haohua Niu, Xingtong Yu, Yang Liu, Junfeng Fang, Xuanting Xie, Jie Tan, Zhongjian Zhang, Hong Cheng, Yuan Fang
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: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