Search arXivSearch

arXiv · 2607.02579

When Not to Write Memory: Governing False Promotion from Correlated Agent Traces

Abstract

Long-lived language agents increasingly write reusable memories from their own execution traces. The key safety question is not only what agents should remember, but when they should refuse to write memory at all. Repeated observations across agents are not necessarily independent evidence: the same claim may be copied from a shared source, induced by a shared prompt, stale under a new environment, or valid only in a narrower scope. We study this failure mode as a memory writepath governance problem. We introduce GovMem as a conservative diagnostic reference policy that estimates dependency-aware support, retrieves counterevidence, assigns scope, and outputs one of three decisions: promote, reject, or needs-review. In controlled synthetic stress tests, GovMem reduces false promotion from 0.597 to 0.040 in the default setting while preserving 0.960 recall, at an explicit review burden. In a project-internal 120candidate human-labeled real-trace subset spanning 79 recorded traces and project reports, dependency-aware promotion reduces false promotion from 0.371 for source+scope to 0.032 overall, but held-out false promotion remains 0.111 and the method is highly conservative, with 0.692 review burden and 0.448 direct recall. A final human adjudication of 133 high-impact external codingagent candidates is more severe: none are safe for automatic promotion, and all 11 verification-gate positives are rejected as boilerplate, shared-tool artifacts, file dumps, or non-reusable debugging traces. These results support GovMem primarily as a diagnostic governance design point, not as a generally validated or efficient automatic memory writer: agent memory write paths should be evaluated as risk-controlled evidence-governance systems, while broader external coverage and downstream harm evidence are still needed before stronger claims.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yijiashun Qi, Xiang Xu, Yuxuan Li. 2026-06-30. When Not to Write Memory: Governing False Promotion from Correlated Agent Traces. https://arxiv.org/abs/2607.02579

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

XScientist: A Git-Like Research Protocol for Long-Running Autonomous Scientific Discovery

Autonomous research systems can generate plausible papers while losing the decisions, failed branches, and evidence needed to inspect or continue the work. We present XScientist, a local-first, git-like protocol that treats research state, rather than a manuscript, as the unit of continuation. Hypotheses, experiment attempts, observations, claims, reviews, and handoffs are represented as typed, content-addressed objects in an exploration graph. Immutable checkpoints, explicit negative outcomes, claim-evidence closure, replay boundaries, and authority-aware gates make each transition inspectable without treating a passing integrity check as scientific truth. The protocol exports a portable Agent-Native Research Artifact (ARA) that another agent or human can inspect, fork, verify, and extend. A reference implementation integrates planning, execution, review, repair, and supervised long-running operation while preserving provenance across these stages. We evaluate the protocol with controlled artifact-integrity workloads and matched external task pilots, keeping native task performance separate from evidence and audit claims. The result is an interoperability and accountability layer for long-running autonomous science, with explicit boundaries where human judgment and independent evaluation remain necessary.

cs.SE

AutoSQL: Extracting SQL Templates from Imperative ORM Code in Large-Scale Repositories

Suboptimal SQL queries can significantly degrade the performance of cloud systems, motivating the extraction and auditing of SQL statements before deployment. However, Go ORM frameworks construct SQL imperatively through scattered method-call sequences, making it difficult to statically recover the resulting SQL templates. We present AutoSQL, a system that reconstructs SQL templates from Go ORM code. AutoSQL constructs a Code Index, a directed graph that captures structural dependencies between functions, types, and global variables as navigable edges. It then traces upstream call chains from ORM invocation sites to identify database-interacting functions as entry points. For each entry point, an LLM agent traverses the Code Index to collect code slices that influence SQL generation, switching to pattern-based search when the graph cannot resolve a retrieval goal. We call this strategy Hybrid Context Retrieval. Once sufficient context is collected, the agent synthesizes SQL templates. Evaluation on a benchmark of 579 test-covered entry points and 1,186 runtime-traced SQL statements from five large-scale Go repositories shows that AutoSQL achieves 68.04% to 72.18% recall, exceeding the static reachability baseline by 11.80% to 15.94% and outperforming existing methods by 8.52% to 21.50%.

cs.SE

The Vocabulary of Flaky Tests in Swift

Flaky tests produce non-deterministic outcomes without code change, eroding CI confidence and delaying deliveries. While vocabulary-based machine learning prediction has proven effective for Java and JavaScript, no study has evaluated it for Swift, a language whose testing style is dominated by UI and asynchronous code. We collect 91 flaky and 22,349 stable tests from 15 open-source Swift projects via re-execution and commit-history mining, then train five classifiers (Random Forest, Decision Tree, Naive Bayes, SVM, KNN) on TF-IDF unigram+bigram features under stratified 5-fold cross-validation. Random Forest achieves the best performance (Precision = 0.92, F1 = 0.86, AUC = 0.95) and substantially outperforms trivial baselines, among them a vocabulary-threshold rule applied to the most informative tokens, confirming a genuine discriminative signal (MCC = 0.75 vs. 0.08 for the best baseline). Information-gain analysis reveals two complementary signal types. Flakiness markers appear predominantly in unstable tests and comprise concurrency primitives (async, await), expectation-based synchronisation (expectation, fulfill), error propagation (throws), and explicit timing dependence (timeout, wait, now). Stability markers, chiefly the assertion vocabulary of plainly synchronous tests (xctassertequal), count as evidence against flakiness. Error analysis shows that the model fails when flakiness is hidden in shared infrastructure outside the test body or when async constructs are used in a deterministic context, exposing the intrinsic limit of lexical prediction. These results extend vocabulary-based flakiness detection to the Swift ecosystem and characterise both its effectiveness and its boundaries.

cs.SE