Skip to content

TRACE: An Operational Reasoning Schema for Auditable Agentic Commitments

Jul 2026 · arXiv.org · Vol abs/2607.12480 · 1 citation · 135 references
Computer Science

TL;DR

This paper argues in three layers that reasoning is not in the language model: the autoregressive mechanism natively computes association; chain-of-thought and reinforcement learning inherit its limits; and the formal constructs of reasoning theory are absent as machinery.

Abstract

This paper defines TRACE (Typed Reasoning And Commitment Evidence): a typed, versioned schema for recording reasoning traces, a reference procedure for writing records against it, and one operating discipline, no durable state change without a record. The paper argues in three layers that reasoning is not in the language model: the autoregressive mechanism natively computes association; chain-of-thought and reinforcement learning inherit its limits; and the formal constructs of reasoning theory, from Socratic procedure to Pearl's ladder, are absent as machinery. The schema answers the absence with fields and tests: the TraceRecord and its causal specialization, an eight-stage reference writer, a gate-first measurement regime, the TRACE-Bench protocol, and the consumers, memory admission, plan gating, temporal regret, and verdict reuse, whose more auditable decisions are the measure of the record. A record-consumer contract states what a record guarantees and what a consumer must honor in return, making the schema an operational interface rather than a passive document. Two worked examples run in the main text: a music-lessons argument traced from sentence to typed verdict, separating association, intervention, and prescription; and a flood search-and-rescue vignette in which a predictive world model reports confident plan success that its own support and out-of-distribution scores contradict, so the record defers the commitment, requests a bounded observation, revises append-only, and clears a different branch. The vignette is illustrative, not empirical; closed-loop evaluation is left to future work, so the contribution is the schema and its contract, not a performance claim. Appendices carry the full schema, writer algorithms and cost model, clinical and policy illustrations, the benchmark protocol, convergence metrics, and usage scenarios.

View source

Similar papers

#artificial intelligence Preprint Jul 2026

When AI Agents Commit: Cognitive Serializability Across Data, Evidence, Policy, and Authority

TCT combines immutable versioned executable definitions, registry-derived authority plans, sealed envelopes, guard-first commit transactions, post-seal envelope- and witness-bound grants, co-committed receipts, idempotent grant finalization, and receipt-driven epistemic reconciliation.

Jun-Fei He, De-Ying Yu · 1 citation
Jul 2026

MemTX: Transactional Belief Commit for Stateful Agent Memory

This work argues that a memory write is not a belief commit, and presents MemTX, a transactional belief-commit protocol, a transactional belief-commit protocol that leads all eight baselines with paired-McNemar significance on four backbones and statistically ties the best baseline on the fifth and strongest, while rem...

Xiaoyang Li, Yi-Qi Wang, Haohui Lu et al. · 5 citations · ⚡1

Structural Trust: An Uncertainty-Typed Property Hypergraph for Agent Memory

This paper argues that it is too late, and that the argument is not a matter of engineering quality: information about whether a claim is true enters through the primary record, and every later stage is a rendering of that record, so no downstream scoring can add a bit that the record did not already carry.

R. Deiotte · 0 citations
Preprint Aug 2026

Trace Integrity for LLM Data Agents: A Vision for Auditable Structured Reasoning in Real-World Systems

This paper introduces Trace Integrity, a deployment reliability criterion for evaluating whether the computation recorded behind an answer is explicit, executable, schema-valid, operator-faithful, replayable, answer-consistent, answer-consistent, and auditable.

Srimonti Dutta, Akshata Kishore Moharir · 0 citations
Preprint Aug 2026

SafeCommit: Certifying When Memory-Grounded Agents May Safely Act

SafeCommit, a risk controlled layer between agent reasoning and external execution, is introduced, a calibrated set of plausible latent worlds from memory, observations, tool outputs, provenance, and policy constraints that permits a side effectful action only when a conformal action certificate shows that the action i...

M. Akewar, Ravi Ranjan · 2 citations

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