Pith. sign in

REVIEW 14 cited by

Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.01061 v2 pith:D7LZOV2S submitted 2023-10-02 cs.CL cs.AI

Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning

classification cs.CL cs.AI
keywords reasoningfaithfulknowledgellmsgraphsinterpretableduringgenerates
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Large language models (LLMs) have demonstrated impressive reasoning abilities in complex tasks. However, they lack up-to-date knowledge and experience hallucinations during reasoning, which can lead to incorrect reasoning processes and diminish their performance and trustworthiness. Knowledge graphs (KGs), which capture vast amounts of facts in a structured format, offer a reliable source of knowledge for reasoning. Nevertheless, existing KG-based LLM reasoning methods only treat KGs as factual knowledge bases and overlook the importance of their structural information for reasoning. In this paper, we propose a novel method called reasoning on graphs (RoG) that synergizes LLMs with KGs to enable faithful and interpretable reasoning. Specifically, we present a planning-retrieval-reasoning framework, where RoG first generates relation paths grounded by KGs as faithful plans. These plans are then used to retrieve valid reasoning paths from the KGs for LLMs to conduct faithful reasoning. Furthermore, RoG not only distills knowledge from KGs to improve the reasoning ability of LLMs through training but also allows seamless integration with any arbitrary LLMs during inference. Extensive experiments on two benchmark KGQA datasets demonstrate that RoG achieves state-of-the-art performance on KG reasoning tasks and generates faithful and interpretable reasoning results.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 14 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. MKG-RAG-Bench: Benchmarking Retrieval in Multimodal Knowledge Graph-Augmented Generation

    cs.AI 2026-06 unverdicted novelty 7.0

    MKG-RAG-Bench is a cross-domain benchmark for retrieval in multimodal knowledge graph-augmented generation, constructed via LLM curation from two MKGs with aligned QA datasets.

  2. ArbGraph: Conflict-Aware Evidence Arbitration for Reliable Long-Form Retrieval-Augmented Generation

    cs.CL 2026-04 unverdicted novelty 7.0

    ArbGraph resolves conflicts in RAG evidence by constructing a conflict-aware graph of atomic claims and applying intensity-driven iterative arbitration to suppress unreliable claims prior to generation.

  3. PuzzleWorld: A Benchmark for Multimodal, Open-Ended Reasoning in Puzzlehunts

    cs.CL 2025-06 conditional novelty 7.0

    PuzzleWorld benchmark reveals state-of-the-art AI models solve only 18% of complex puzzlehunt problems with 40% stepwise accuracy, matching novices but trailing enthusiasts, while fine-tuning on traces yields modest gains.

  4. From Execution to Education: A Bloom-Aligned Framework for Measuring Educational Control in LLMs

    cs.CL 2026-07 conditional novelty 6.5

    On 2,520 programming tasks, matched Qwen general and coder models reliably raise Bloom cognitive demand but fail to lower it, so execution skill does not imply educational control.

  5. KAMR: Grounding Generation via Knowledge-Aligned Multi-hop Retrieval

    cs.IR 2026-07 conditional novelty 6.0

    Partial-alignment contrastive pretraining plus anchor-then-expand graph retrieval improves multi-hop KG evidence recovery and downstream QA over strong dense and graph RAG baselines.

  6. Small RL Controller, Large Language Model: RL-Guided Adaptive Sampling for Test-Time Scaling

    cs.CL 2026-06 unverdicted novelty 6.0

    RL-trained lightweight controller using answer statistics improves trade-offs among correctness, latency, and total samples in adaptive sampling for LLM test-time scaling.

  7. Efficient and Transferable Agentic Knowledge Graph RAG via Reinforcement Learning

    cs.CL 2025-09 unverdicted novelty 6.0

    KG-R1 trains a single RL agent to retrieve from and reason over knowledge graphs in one loop, achieving higher accuracy with fewer tokens than multi-module baselines and transferring to unseen graphs.

  8. Structured In-context Environment Scaling for Large Language Model Reasoning

    cs.CL 2025-09 conditional novelty 6.0

    SIE framework automatically constructs scalable, verifiable reasoning environments from structured data, improving in-domain performance and enabling generalization to out-of-domain math and logic tasks.

  9. In-depth Analysis of Graph-based RAG in a Unified Framework

    cs.IR 2025-03 unverdicted novelty 6.0

    A unified framework and large-scale comparison of graph-based RAG methods on QA tasks yields new high-performing variants obtained by recombining existing components.

  10. ArchRAG: Attributed Community-based Hierarchical Retrieval-Augmented Generation

    cs.IR 2025-02 unverdicted novelty 6.0

    ArchRAG proposes attributed-community hierarchical indexing and LLM clustering to improve accuracy and lower token usage in graph-based retrieval-augmented generation.

  11. AGE: Adaptive-masking for Graph Embedding in Graph Retrieval-Augmented Generation

    cs.IR 2026-06 unverdicted novelty 5.0

    AGE applies adaptive masking via a learnable sampler in Transformer-based SSL to align graph and text embeddings, yielding higher accuracy on four GraphQA benchmarks for non-parametric GraphRAG.

  12. Query-Aware Learnable Graph Pooling Tokens as Prompt for Large Language Models

    cs.CL 2025-01 unverdicted novelty 5.0

    LGPT and Early Query Fusion create flexible graph representations for LLMs, achieving 4.13% improvement on GraphQA without training the model.

  13. Retrieval-Augmented Generation with Graphs (GraphRAG)

    cs.IR 2024-12 unverdicted novelty 5.0

    A survey proposing a holistic GraphRAG framework with components including query processor, retriever, organizer, generator, and data source, plus domain-tailored reviews, challenges, and future directions.

  14. Retrieval-Augmented Generation for Large Language Models: A Survey

    cs.CL 2023-12 unverdicted novelty 3.0

    A survey of RAG paradigms, components, benchmarks, and challenges for improving LLMs on knowledge-intensive tasks.