TraceCoder: Explainable and Auditable Code Generation with Position-Key Snippet Versioning

• URL: http://arxiv.org/abs/2607.26307v1
• Date: Tue, 28 Jul 2026 22:03:52 GMT
• Title: TraceCoder: Explainable and Auditable Code Generation with Position-Key Snippet Versioning
• Abstract summary: We present a code generation concept that addresses shortcomings through three complementary mechanisms.<n>A relational snippet-history schema records, per repair event, the benchmark reference, round number, failure text, and explanation.<n>A browser-based visualisation tool renders this history as heat-mapped, hover-annotated source code.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Contemporary LLM-based coding agents produce code as black-box outputs: the rationale behind each line is hidden, the evolution of the code through benchmark-driven repair is ephemeral, and post-hoc auditing is impossible. We present a code generation concept that addresses these shortcomings through three complementary mechanisms: (i) a relational snippet-history schema that records, per repair event, the benchmark reference, round number, failure text, and LLM explanation, enabling full provenance queries; (ii) a browser-based visualisation tool that renders this history as heat-mapped, hover-annotated source code; and (iii) a competitive fractional position-key indexing scheme with tree-node delimiters that assigns stable, lexicographically-ordered identifiers to each code snippet, enabling fine-grained tracking without disrupting surrounding lines. We evaluate TraceCoder on 30 algorithmic programming tasks spanning string processing, mathematical computation, and data-structure manipulation, across two provider configurations. Of these, 10 exhaust the 6-iteration budget on tasks with subtle edge-case behaviour. Mean Chg% reaches 30%, three in ten code snippets carry a traceable repair-event row, compared to 21% when using Gemini 2.0 Flash as sole provider on a 20-task subset. Three detailed case studies demonstrate how the system explains which specific benchmark failures shaped each line of the final program. The proposed mechanism makes the internal "narrative" of automated code generation auditable and replayable, a property essential for trust and accountability in production deployments.

Related papers

• Glyph: A Multi-Strategy Agentic System for Column Description and Sensitivity-Ontology Tagging of Enterprise Data Catalogs [0.0]
  We present Glyph, a production system that frames two coupled problems, column description generation and column type annotation for data classification.<n>The Descriptor grounds generation in the pipeline source code that produces each column, retrieved on demand from an enterprise GitHub.<n>We report end-to-end multi-label tagging quality under a recall-weighted F2 objective across three evaluation groups.
  arXiv  Detail & Related papers  (2026-09-09T16:43:26Z)
• Codebook Agent: Amortized Topology Design for LLM Multi-Agent Systems [67.04448659688579]
  We develop a query-independent 16-entry codebook that ranks the top decoded candidates in a single batched forward pass.<n>With no iterative search and no message passing at test time, Codebook Agent is the most accurate method on all six benchmarks.
  arXiv  Detail & Related papers  (2026-09-02T08:10:22Z)
• The Illusion of Control: Why Bare Classifier Inversion Silently Fails in Concept-Bottleneck Text Generation [0.30693357740321775]
  Concept-bottleneck controllable generation routes multi-attribute control through a low-dimensional concept code.<n>We study this problem in concept-bottleneck text generation under multi-axis compositional generalisation.
  arXiv  Detail & Related papers  (2026-08-24T08:21:10Z)
• Fantastic Adaptive Taxonomies and How to Use Them [100.20614173157708]
  AdaMAST converts execution traces into a compact, evidence-grounded failure taxonomy.<n>No code is hand-authored, no trace human-annotated.<n>In agent-system search, taxonomy-coded diagnoses of failed candidates outperform free-form.
  arXiv  Detail & Related papers  (2026-07-17T17:41:16Z)
• AuditWeave: A Tamper-Evident, Auditor-Navigable Evidence Layer for AI-Assisted and Data-Transformation Workflows [0.0]
  AuditWeave is a lightweight Python library that records the steps of AI-assisted and data-transformation into a single hash-chained ledger.<n>We describe the design and evaluate recording overhead, scalability, and tamper-detection correctness on the reference implementation.
  arXiv  Detail & Related papers  (2026-06-14T21:46:04Z)
• What Really Improves Mathematical Reasoning: Structured Reasoning Signals Beyond Pure Code [72.9921566968371]
  We revisit the claim that code improves reasoning through controlled pretraining experiments on a 10T-token corpus with fine-grained domain separation.<n>Code substantially improves programming ability but does not act as a general reasoning enhancer.<n>Cross-domain structured reasoning traces, such as code-text and math-text mixtures, are better explained.
  arXiv  Detail & Related papers  (2026-05-19T12:37:01Z)
• Beyond Retrieval: A Multitask Benchmark and Model for Code Search [21.20978098597112]
  textscCoREB is built from counterfactually rewritten LiveCodeBench problems in five programming languages.<n>We benchmark eleven embedding models and five rerankers across three tasks: text-to-code, code-to-text, and code-to-code.<n>textscCoREB-Reranker is the first to achieve consistent gains across all three tasks.
  arXiv  Detail & Related papers  (2026-05-06T08:05:17Z)
• Co-Refine: AI-Powered Tool Supporting Qualitative Analysis [6.199710730080277]
  We present Co-Refine, an AI-augmented qualitative coding platform that delivers continuous, grounded feedback on coding consistency.<n>The system employs a three-stage audit pipeline: Stage 1 computes deterministic embedding-based metrics for mathematical consistency; Stage 2 grounds LLM verdicts within $pm0.15$ of the deterministic scores; Stage 3 produces code definitions from previous patterns to create a deepening feedback loop.
  arXiv  Detail & Related papers  (2026-04-21T10:16:13Z)
• AlgoVeri: An Aligned Benchmark for Verified Code Generation on Classical Algorithms [54.99368693313797]
  Existing benchmarks test only individual languages/tools, so the performance numbers are not directly comparable.<n>We address this gap with AlgoVeri, a benchmark that evaluates vericoding of $77$ classical algorithms in Dafny, Verus, and Lean.
  arXiv  Detail & Related papers  (2026-02-10T06:58:26Z)
• AlignCoder: Aligning Retrieval with Target Intent for Repository-Level Code Completion [55.21541958868449]
  We propose AlignCoder, a repository-level code completion framework.<n>Our framework generates an enhanced query that bridges the semantic gap between the initial query and the target code.<n>We employ reinforcement learning to train an AlignRetriever that learns to leverage inference information in the enhanced query for more accurate retrieval.
  arXiv  Detail & Related papers  (2026-01-27T15:23:14Z)
• Can LLMs Compress (and Decompress)? Evaluating Code Understanding and Execution via Invertibility [36.41073880422337]
  We present RoundTripCodeEval (RTCE), a comprehensive benchmark consisting of four distinct code execution reasoning tasks.<n>We systematically evaluate state-of-the-art Code-LLMs using zero-shot prompting, supervised fine-tuning on execution traces, and self-reflection mechanisms.<n>RTCE surfaces several new and previously unmeasured insights that are not captured by existing I/O-prediction, execution-reasoning, or round-trip natural-language benchmarks.
  arXiv  Detail & Related papers  (2026-01-19T21:09:48Z)
• Talk Less, Verify More: Improving LLM Assistants with Semantic Checks and Execution Feedback [14.593478824805542]
  This paper introduces two complementary verification techniques: Q*, which performs reverse translation and semantic matching between code and user intent, and Feedback+, which incorporates execution feedback to guide code refinement.<n> Evaluations on three benchmark datasets, Spider, Bird, and GSM8K, demonstrate that both Q* and Feedback+ reduce error rates and task completion time.
  arXiv  Detail & Related papers  (2026-01-01T06:10:06Z)
• Contextual Code Retrieval for Commit Message Generation: A Preliminary Study [18.46986692375691]
  A commit message describes the main code changes in a commit and plays a crucial role in software maintenance.<n>Existing commit message generation approaches typically frame it as a direct mapping which inputs a code diff and produces a brief descriptive sentence as output.<n>We argue that relying solely on the code diff is insufficient, as raw code diff fails to capture the full context needed for generating high-quality commit messages.
  arXiv  Detail & Related papers  (2025-07-23T16:54:57Z)
• Let the Code LLM Edit Itself When You Edit the Code [50.46536185784169]
  underlinetextbfPositional textbfIntegrity textbfEncoding (PIE)<n>PIE reduces computational overhead by over 85% compared to the standard full recomputation approach.<n>Results demonstrate that PIE reduces computational overhead by over 85% compared to the standard full recomputation approach.
  arXiv  Detail & Related papers  (2024-07-03T14:34:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.