TraceCompiler recovers producer-consumer dependencies from noisy agent traces by admitting only uniquely-justified data flow and abstaining on ambiguity, achieving 0.928 precision on T1 versus 0.711 F1 for adjacency.
AgentTrails: Towards Trust and Reuse for Agentic Tasks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
LLM-powered agents increasingly tackle complex tasks by invoking tools, querying databases, executing code, and manipulating intermediate artifacts. These agents follow trajectories that are typically stored as chronological logs, obscuring the underlying dataflow -- the dependencies between their actions and the artifacts they create and manipulate. This limits developers' ability to understand the agents' trails, compare executions, debug failures, and re-use the computations. We present AgentTrails, a prototype system for agent provenance and sensemaking. AgentTrails converts raw trajectories into structured provenance graphs, where tool calls are modeled as computational actions and inputs and outputs as data artifacts. The system supports the comparison of executions by placing multiple provenance graphs on a shared canvas and constructing a joined quotient graph that aligns recurring tools, artifacts, and dependency structures across trajectories. On top of this representation, AgentTrails supports pattern extraction, downstream analysis, and skill abstraction. We demonstrate AgentTrails on real-world agent trajectories, showing that it reveals hidden dependencies, aligns divergent executions, and surfaces recurring tool-use patterns beyond chronological logs.
citation-role summary
citation-polarity summary
fields
cs.SE 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
TraceCompiler: Skill-Guided Mining and Compilation of LLM Agent Traces into Mostly Deterministic Workflows
TraceCompiler recovers producer-consumer dependencies from noisy agent traces by admitting only uniquely-justified data flow and abstaining on ambiguity, achieving 0.928 precision on T1 versus 0.711 F1 for adjacency.