arXiv AI
Structural Chain-of-Thought: Reasoning with Executable Computational Graphs
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 17
CoEvoT: Co-Evolving Chain-of-Thought Prompting for Graph-LLM Reasoning
arXiv:2607. 14114v1 Announce Type: cross Abstract: Graph learning under distribution shift presents a persistent challenge, where models adapt to new graphs with limited or even no supervision.
arXiv AI
Sep 1
LCoT-GV: Graph Attention Networks for Verifying Long Reasoning Chains in Large Language Models
arXiv:2608.30679v1 Announce Type: cross Abstract: Large Reasoning Models produce Long Chains-of-Thought (LCoTs) which involve breaking down the problem into smaller reasoning steps before reaching th...
arXiv AI
Aug 6
Topology-Aware Reasoning over Incomplete Knowledge Graph with Graph-Based Soft Prompting
arXiv:2604. 12503v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have shown remarkable capabilities across various tasks but remain prone to hallucinations in knowledge-intensive scenarios.
arXiv AI
Oct 1
GraphCert: Bootstrap Agentic Graph Reasoning with Certified Evidence Rubrics
GraphCert introduces a method to bootstrap graph reasoning agents by generating graph‑grounded question‑answer pairs and certifying the supporting evidence. The approach uses a Bootstrapped Graph Quizzer to produce QA pairs, then executes and semantically curates the evidence into certified rubrics that guide reward‑based training of a Graph Solver. Experiments on five GRBENCH domains show GraphCert outperforms larger LLM agents and demonstrates robust policy transfer across heterogeneous graphs.
arXiv AI
Jun 9
Inference-Time Conformal Reasoning with Valid Factuality Control for Large Language Models
arXiv:2606. 08831v1 Announce Type: new Abstract: Large language models (LLMs) increasingly perform multi-step reasoning, where intermediate claims form implicit directed acyclic graphs whose node correctness is structurally conditioned on their ancestors.
arXiv AI
Sep 18
Compositional Reasoning in Language Models under Reinforcement Learning Post-Training
The paper introduces a dependency‑graph framework to formalize compositional reasoning in language models, defining three increasing levels of compositionality. Using data‑structure tasks with deterministic rewards, the authors observe a consistent asymmetry: training on decomposed skills does not reliably transfer to composed tasks, whereas training on composed tasks transfers more readily to decomposed ones. They provide a theoretical explanation for this asymmetry and evaluate its effects under length extrapolation, structural distribution shift, and transfer to unseen skills, concluding with a pilot study on real‑world tool‑calling benchmarks that suggests the phenomenon extends to practical settings.