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

Bérénice Jaulmes, Mehwish Alam
8/31/2026
cs.CLcs.AI

No confident code implementation found for this paper. 2 possible matches can be shown below.

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 on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jaulmes2026lcotgv,
  title  = {LCoT-GV: Graph Attention Networks for Verifying Long Reasoning Chains in Large Language Models},
  author = {Bérénice Jaulmes and Mehwish Alam},
  year   = {2026},
  eprint = {2608.30679},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2608.30679v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2608.30679.svg)](https://codeofpaper.com/paper/2608.30679)

Discussion