Code-on-Graph lets LLMs turn retrieved KG facts into Python class instances and generate executable code for reasoning, outperforming prior LLM-KG methods by up to 10.5% on WebQSP, CWQ, and GrailQA.
InProceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
9 Pith papers cite this work, alongside 449 external citations. Polarity classification is still indexing.
9
Pith papers citing it
449
external citations · OpenAlex
years
2026 9representative citing papers
KG-Guard augments knowledge graphs with a virtual question node and uses a graph encoder plus MLP to classify LLM-proposed answers as hallucinations or not, reporting superior F1 scores and downstream improvements on three benchmarks.
KoRe compresses one-hop knowledge-graph subgraphs into 20 discrete tokens that, injected into Qwen3-8B, match or beat text-based knowledge injection on three QA benchmarks while using up to 10x fewer tokens.
ARLtR is a framework for jointly constructing knowledge graphs, embeddings, and grounded QA pairs from text, released as a Roman Empire dataset with over 19,000 entities and 8,400 QA pairs.
OCC-RAG develops task-specialized SLMs (0.6B and 1.7B) via a new synthetic data pipeline for multi-hop reasoning and context faithfulness, claiming to match or exceed 2-6x larger general models on HotpotQA, MuSiQue, TAT-QA, ConFiQA, and MuSiQue-Un.
SPADER is an RL method for multi-answer QA that claims better recall and F1 via peer-aligned step-level advantages and diversity rewards on four benchmarks.
Full-horizon planning with on-demand replanning achieves accuracy parity with single-step planning in tool-calling agents for knowledge base and multi-hop question answering while consuming 2-3 times fewer tokens.
STAR is a semantic-tuned and tail-adaptive retriever for GraphRAG that uses cross-attention interaction learning and path-weighted contrastive learning to mitigate Semantic Shortcut Bias and Long-Tail Path Bias, reporting 1.8% retrieval and 2.2% QA gains.
citing papers explorer
-
Code-on-Graph: Iterative Programmatic Reasoning via Large Language Models on Knowledge Graphs
Code-on-Graph lets LLMs turn retrieved KG facts into Python class instances and generate executable code for reasoning, outperforming prior LLM-KG methods by up to 10.5% on WebQSP, CWQ, and GrailQA.
-
KG-Guard: Graph-Based Hallucination Detection for Knowledge Base Question Answering
KG-Guard augments knowledge graphs with a virtual question node and uses a graph encoder plus MLP to classify LLM-proposed answers as hallucinations or not, reporting superior F1 scores and downstream improvements on three benchmarks.
-
KoRe: Compact Knowledge Representations for Large Language Models
KoRe compresses one-hop knowledge-graph subgraphs into 20 discrete tokens that, injected into Qwen3-8B, match or beat text-based knowledge injection on three QA benchmarks while using up to 10x fewer tokens.
-
All Relations Lead to Rome: Automated Knowledge Graph Creation and Question Generation
ARLtR is a framework for jointly constructing knowledge graphs, embeddings, and grounded QA pairs from text, released as a Roman Empire dataset with over 19,000 entities and 8,400 QA pairs.
-
OCC-RAG: Optimal Cognitive Core for Faithful Question Answering
OCC-RAG develops task-specialized SLMs (0.6B and 1.7B) via a new synthetic data pipeline for multi-hop reasoning and context faithfulness, claiming to match or exceed 2-6x larger general models on HotpotQA, MuSiQue, TAT-QA, ConFiQA, and MuSiQue-Un.
-
SPADER: Step-wise Peer Advantage with Diversity-Aware Exploration Rewards for Multi-Answer Question Answering
SPADER is an RL method for multi-answer QA that claims better recall and F1 via peer-aligned step-level advantages and diversity rewards on four benchmarks.
-
Do Agents Need to Plan Step-by-Step? Rethinking Planning Horizon in Data-Centric Tool Calling
Full-horizon planning with on-demand replanning achieves accuracy parity with single-step planning in tool-calling agents for knowledge base and multi-hop question answering while consuming 2-3 times fewer tokens.
-
STAR: Semantic-Tuned and Tail-Adaptive Retriever for Graph-Augmented Generation
STAR is a semantic-tuned and tail-adaptive retriever for GraphRAG that uses cross-attention interaction learning and path-weighted contrastive learning to mitigate Semantic Shortcut Bias and Long-Tail Path Bias, reporting 1.8% retrieval and 2.2% QA gains.
- GraphWalker: Agentic Knowledge Graph Question Answering via Synthetic Trajectory Curriculum