Soei measured what coding agents actually did: 23.4 percent of code-edit episodes ended with no independent check
AspireAI community · arXiv (Khan, Kumar)
Rather than trust what a coding agent says it did, this work audits 45 real coding-agent sessions - 102,233 records, 20,577 tool executions and 2,336 human-to-agent episodes - and reports that 23.4 percent of code-editing episodes end with no independent check after the last edit, while 57.8 percent of the to-dos the agent marked complete after editing had no proof in between. The same corpus shows 42 percent of sessions running longer than 24 hours, 48.1 percent of transcript bytes past a 2 MiB replay bound, and 1,326 records across 16 sessions containing credential-like strings. Soei's answer is an acknowledgement-aware event schema with a hash-chained local ledger and a W3C PROV-aligned graph that stores no content or credentials, verifies at roughly 126k events per second and replays deterministically. The 23.4 percent figure comes from a classifier the authors blind-audited at 83.3 percent precision, with a wide 95 percent confidence interval of 17.1 to 35.7, so read it as an order of magnitude rather than a precise rate.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.