Agentic Process Evidence proposes signed attestations for AI agents, because a git log cannot say who decided
AspireAI community · arXiv
AI agents now open pull requests, pick dependencies, refactor code and run infrastructure changes across the software lifecycle, but their reasoning and tool calls disappear the moment a session ends, which the authors treat as an insider-threat problem. The proposed answer is Agentic Process Evidence, a signed, tamper-evident, machine-readable attestation that links an agent session to its outcome, and it supports policy-as-code control over agentic processes so a human stays in the loop only when needed. The design follows the in-toto attestation style and the authors say it is aligned with relevant regulations. The framing is the interesting part, since it argues that audit trails and compliance controls were all built assuming a human made the decision and that assumption no longer holds, but the paper is a position and protocol proposal rather than a deployed system with measured incident data.
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.