Chain-of-thought prompting enables reasoning in large language models but produces explanations that are difficult to verify, expensive to generate, and not always faithful. We introduce a Structural Chain-of-Thought framework where models generate executable computational graphs instead of free-form reasoning. The final answer is obtained by deterministically executing the graph. The model is trained using graph-based reinforcement learning that rewards structural validity, answer correctness, and node overlap with reference graphs. Experiments across five benchmarks and four model families show that our method consistently improves accuracy over supervised graph training and can reduce generation length by up to 5-6x compared with standard GRPO and chain-of-thought supervised training. Our faithfulness experiments reveal that models trained with our approach tend to rely on deriving their answers from the generated graphs rather than producing post-hoc rationalizations as usually in chain-of-thought reasoning.
Figures & tables
Figure 1: Comparison between free-form reasoning and computational graph representations for solving a natural-language arithmetic problem.
Dataset
Train
Test
# Inputs
# Ops
GSM8k+
5,634
1,409
2–4
3–7
iGSM
2,634
658
9–23
5–18
MATH
7,959
1,992
3–5
3–8
Entailment
1,313
340
3–25
1–17
ProofWriter
5,000
2,000
1–5
0–7
Table 1: Datasets used in our experiments. We report train/test sizes and the ranges of input nodes (representing quantities mentioned in the problem, not all of which necessarily appear in the resulting computational graph) and operations (represented by operational nodes in the corresponding computational graphs).
Dataset
Method
Gemma2-2B
LLama3.2-3B
Falcon3-3B
Qwen3-4B
Average
GSM8k+
ICL with FS
0.12 ± 0.0
0.11 ± 0.0
0.29 ± 0.0
0.18 ± 0.0
0.17 ± 0.07
Tree-of-Thoughts
0.00 ± 0.00
0.01 ± 0.00
0.02 ± 0.00
0.12 ± 0.00
0.04 ± 0.05
Answer-only SFT
0.00 ± 0.00
0.00 ± 0.00
0.00 ± 0.00
0.00 ± 0.00
0.00 ± 0.00
CoT + Answer SFT
0.08 ± 0.00
0.24 ± 0.00
0.26 ± 0.00
0.37 ± 0.01
0.24 ± 0.10
Graph SFT
0.24 ± 0.01
0.31 ± 0.00
0.33 ± 0.00
0.43 ± 0.00
0.33 ± 0.07
Default GRPO
0.00 ± 0.00
0.03 ± 0.00
0.04 ± 0.00
0.24 ± 0.01
0.08 ± 0.09
Table 2: Performance with standard deviations across datasets and training methods. Best results are shown in bold and second-best in italic.
Dataset
Qwen3-4B
Pythia-1.4B
Llama-3.2-3B-Instruct
Gemma-2-2B
Falcon3-3B-Instruct
MATH
45.9
14.9
51.2
26.3
70.8
GSM8K
28.2
1.3
34.9
21.2
78.1
GSM8K+
0.0
0.0
0.0
0.0
0.0
iGSM
0.0
0.0
0.0
0.0
1.3
Entailment
9.6
0.0
0.0
0.0
0.3
ProofWriter
0.3
0.0
0.0
0.0
31.1
Table 3: CoDeC contamination scores (%) computed for each benchmark dataset. The score is the fraction of samples with a negative in-context delta Δ(x)<0 ; lower values indicate less contamination.
Figure 2: Accuracy/Overall AllCorrect (top) and generation length (bottom, log scale), averaged over the four models; error bars give the spread across models. Graph-Based GRPO leads on four of five datasets at among the lowest token cost; MATH is the exception. Tree-of-Thoughts and Answer-only SFT are omitted for scale and because the latter emits no reasoning. Full results: Tables 2 and 8 .
Figure 3: Qwen3-4B accuracy (Overall AllCorrect on ProofWriter) stratified by normalized gold graph length. Graph GRPO stays above Graph SFT in all bins and remains more robust on longer graphs.
Setting
Mean
Max
Full model
43.88 ± 0.99
45.07
– Style reward
42.54 ± 0.89
43.79
– Correctness reward
42.75 ± 0.65
43.44
– Overlap reward
44.00 ± 1.12
45.49
– Default scheduler
44.00 ± 0.86
45.21
1 rollout
43.88
45.07
Table 4: Ablation study of reward components, scheduling, and the number of rollouts for Qwen3-4B on GSM8k+. Mean accuracy is reported over seeds, with the best result in bold.
Method
GSM8K+
iGSM
MATH
PW
Δ internal – external (pp, lower better)
ICL
12.1 3
21.1 18
25.2 30
14.3 5
Graph SFT
28.4 9
1.0 0
1.7 1
11.8 5
Graph GRPO
31.9 9
0.2 0
0.4 0
3.5 1
Fstrong (%, higher better)
ICL
0.0 0
2.1 1
1.7 1
28.8 25
Table 5: Faithfulness, averaged over the four models; subscripts give the spread across models, rounded to the nearest point. Δ is the absolute gap between internal (graph execution) and external (emitted answer) accuracy; Fstrong requires answer–graph consistency both before and after intervention. Bold = best per column. Entailment has no external answer; therefore, neither internal–external accuracy nor answer-based faithfulness metrics are applicable. Per-model values, and FID / FOOD , are in Table 10 .
Appendix figures & tables6 assets
Supplementary material from the paper’s appendix.
Appendix
Score (%)
Wilson 95% CI (%)
Mann–Whitney U
Fisher’s exact
Model
Model / Pythia
Model / Pythia
U
p
Cliff’s δ
OR
p
MATH
Qwen3-4B
45.9 /
14.9
43.7–48.1 /
13.4–16.6
1 403 460
<10−6
0.276
4.831
<10−6
Llama-3.2-3B-Instruct
51.2 /
14.8
50.1–52.3 /
14.1–15.6
15 448 768.5
<10−6
0.498
6.016
<10−6
Gemma-2-2B
26.3 /
14.8
25.3–27.3 /
14.1–15.6
17 161 310
<10−6
0.443
2.045
<10−6
Falcon3-3B-Instruct
70.8 /
14.8
69.8–71.8 /
14.1–15.6
10 488 688.5
<10−6
0.660
13.901
<10−6
Appendix
Table 6: Two-sample comparison of the per-sample CoDeC deltas between each target model and Pythia-1.4B (reference). Values are reported as target / reference. The Mann–Whitney U test is one-sided ( H1 : target deltas stochastically smaller) and Fisher’s exact test is one-sided ( H1 : higher odds of a negative delta in the target); Cliff’s δ is the effect size for the rank test.
Score (%)
Wilson 95% CI (%)
Mann–Whitney U
Fisher’s exact
Model
Dataset
Orig. / Redef.
Orig. / Redef.
U
p
Cliff’s δ
OR
p
Qwen3-4B
GSM8K
28.2 /
0.0
25.9–30.6 /
0.0–0.3
25 530.0
<10−6
0.974
∞
<10−6
Llama-3.2-3B-Instruct
GSM8K
34.9 /
0.0
32.5–37.4 /
0.0–0.3
0.0
<10−6
1.000
∞
<10−6
Gemma-2-2B
GSM8K
21.2 /
0.0
19.2–23.4 /
0.0–0.3
0.0
<10−6
1.000
∞
<10−6
Falcon3-3B-Instruct
GSM8K
78.1 /
0.0
75.9–80.2 /
0.0–0.3
0.0
<10−6
1.000
∞
<10−6
Appendix
Table 7: Two-sample comparison of the original GSM8K versus its redefined-operator version (GSM8K+) on the same model. Values are reported as original / redefined. The Mann–Whitney U test is one-sided ( H1 : original deltas stochastically smaller) and Fisher’s exact test is one-sided ( H1 : higher odds of a negative delta in the original); Cliff’s δ is the effect size for the rank test.
Dataset
Method
Gemma2-2B
LLama3.2-3B
Falcon3-3B
Qwen3-4B
GSM8k+
ICL with FS
105 ± 46
188 ± 173
86 ± 40
880 ± 312
Tree-of-Thoughts
2476 ± 396
4442 ± 594
4868 ± 775
6907 ± 1031
Answer-only SFT
8 ± 2
4 ± 10
12 ± 86
3 ± 1
CoT + Answer SFT
869 ± 213
112 ± 92
251 ± 149
216 ± 130
Graph SFT
348 ± 4
267 ± 2
401 ± 7
428 ± 27
Default GRPO
216 ± 4
364 ± 28
504 ± 35
669 ± 89
Appendix
Table 8: Token consumption comparison per generation across datasets and training methods. Standard deviations are shown in smaller font for readability.
Dataset
Model
Not valid graphs
Not initialized nodes
Unused nodes
Incorrect ops/formulas
GSM8k+
Falcon3-3B
2 ± 0
2 ± 0
18 ± 2
78 ± 2
Gemma2-2B
7 ± 1
2 ± 0
20 ± 2
72 ± 1
LLama3.2-3B
4 ± 1
1 ± 0
19 ± 3
75 ± 2
Qwen3-4B
2 ± 0
1 ± 0
9 ± 1
87 ± 1
iGSM
Falcon3-3B
1 ± 0
2 ± 1
13 ± 4
85 ± 3
Gemma2-2B
94 ± 3
2 ± 2
2 ± 1
2 ± 2
Appendix
Table 9: Distribution of error categories (%) for Graph-Based GRPO across datasets and models (mean and standard deviation over 3 seeds). Incorrectly initialized constant nodes are counted under Incorrect ops/formulas .
Figure 4: Pass@ k on iGSM across three random seeds. Shaded regions indicate 95% confidence intervals over seeds. Graph GRPO consistently outperforms SFT and exhibits more stable performance as the number of sampled graphs increases.
Figure 5: Example of prompt used for generating structured computational graphs with answer.
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.
Bérénice Jaulmes, Mehwish Alam
1T´el´ecom Paris, Institut Polytechnique de Paris, France · 2BNP Paribas, IT Group, France
Large language models (LLMs) have become increasingly used for various tasks, often coupled with Chain-of-Thought (CoT) prompting to boost accuracy. Recent work has shown that high label-prediction accuracy does not guarantee correct intermediate reasoning, and the causes of reasoning flaws vary from sample to sample, yet existing remedies either focus on a single domain or assume that one flaw type applies uniformly across samples. A simple mitigation method is to provide the model with the correct answer, but we show that this yields no consistent improvement in reasoning quality. This indicates that the problem cannot be fixed by LLMs' awareness of answers, and must instead be addressed through the structure of reasoning. Motivated by this, we propose CRAFT (Consensus Reasoning knowledge graph Aggregation for Flaw-aware Trace synthesis), which aggregates the consensus components shared across multiple candidate reasoning traces to synthesize improved ones. CRAFT consistently improves label-prediction accuracy on both logical and mathematical reasoning benchmarks, outperforming most baselines, while its post-processed traces achieve higher quality under fine-grained benchmark evaluation.
Zipeng Ling, Shuliang Liu, Seonil Son +4
The Hong Kong University of Science and Technology (Guangzhou) · University of Alberta · Alberta Machine Intelligence Institute +3
Graphs have been used to enhance large language models (LLMs) for structured reasoning, mostly as external knowledge sources are provided to models at test time. In this paper, we take a different view: the value of graphs for LLMs lie not only in supplying information, but also in organizing reasoning. Inspired by how humans use graph-structured mind maps to organize branching and converging thoughts, we ask whether graphs can serve as an internal form of reasoning assistance. We study this question on multi-hop question answering tasks, where teacher-provided reasoning traces are rewritten as graph mind maps and used to guide a student model. Our experiments reveal a clear modality gap. When graph structures are flattened into text, their benefits become limited once direct answer hints are removed. Under this abstract guidance setting, both reasoning efficiency and answer quality degrade substantially. In contrast, visual graph guidance remains effective without direct answer clues, and its advantage persists after supervised fine-tuning and KL-based distillation. The above findings support the claim that graphs should be studied not only as external knowledge structures for LLMs, but also as visual scaffolds for organizing reasoning.
Runlin Lei, Xiaokui Xiao, Zhewei Wei
Renmin University of China · National University of Singapore