Skip to content

LCoT-GV: Graph Attention Networks for Verifying Long Reasoning Chains in Large Language Models

Aug 2026 · 0 citations · 16 references
Computer Science

TL;DR

This work proposes Long Chain-of-Thought Graph Verifier (LCoT-GV), a graph-based framework that represents LCoTs as reasoning graphs, each node in the graph represents a reasoning step and the edges encode semantic and logical relations.

Abstract

Large Reasoning Models produce Long Chains-of-Thought (LCoTs) which involve breaking down the problem into smaller reasoning steps before reaching the conclusion. However, these steps often contain contradictions, unsupported inferences, or irrelevant steps, even when the final answer is correct. We propose Long Chain-of-Thought Graph Verifier (LCoT-GV), a graph-based framework that represents LCoTs as reasoning graphs. Each node in the graph represents a reasoning step and the edges encode semantic and logical relations. A Graph Attention Network is then trained to predict chain-of-thought correctness from the reasoning graph. We construct a new graph-oriented verification dataset from multiple reasoning benchmarks for question answering in various domains. The results show that our method is competitive with the most similar approaches.

View source

Similar papers

Preprint Aug 2026

SymbolLKG: Towards Verifiable Logical Reasoning via Logical Knowledge Graph and Symbolic Solvers

A Neuro-Symbolic architecture that integrates a Logical Knowledge Graph (LKG) with dynamic solver routing, and introduces an ontology-based LKG that treats logical rules and constraints as first-class topological nodes, enabling explicit modeling of dependencies extracted from text.

Hai-Zhao Fan, Yu-Chi Xiong, Jize Wang et al. · 0 citations
Book Open access Aug 2026

Learning Graph Rationales to Compress Long Chains of Thought in Multimodal Reasoning

GRACE is proposed, a Graph-based Rationalized CoT Compression framework that transforms long CoTs into reasoning graphs to enable efficient CoT compression, where reasoning steps are represented as nodes and semantic dependencies as edges.

Yizhi Wang, Li-Nan Yue, Deng-Bao Wang et al. · 0 citations
#machine learning Preprint Aug 2026

ClosureBench: A Constructive Benchmark for Compositional Graph Reasoning

ClosureBench is introduced, a constructive benchmark for compositional graph-relational reasoning with programmatically verified ground truth with programmatically verified ground truth: each task's reference answer is computed by executing a program in the Ein tensor-logic language, ensuring machine-verified correctne...

S. Goria · 0 citations
Book Open access Aug 2026

Investigating Reasoning in Large Language Models with Counterfactual Knowledge Graphs

This work delineates LLM reasoning boundaries and presents a new paradigm for fine-grained capability assessment, which suggests that genuine reasoning is demonstrated only when a model follows logical rules despite conflicting prior knowledge.

Fangfei Yan, Jianbo Yao, Michael K. Chen et al. · 1 citation

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.