A pull request can now rewrite a coding agent's instructions, and two agents handled it very differently
AspireAI community · arXiv (Thiago Santos de Moura, Selma Güler, Yannic Noller)
Coding agents load project memory files at the start of every session and treat them as trusted guidance, so anyone who can edit such a file, through a pull request for instance, can steer the agent without ever touching the developer's own prompt. The authors crafted two malicious memory files for each of 12 CWE classes and ran Claude Code (Sonnet 5.5) and OpenCode (Qwen 3.8 27B, DeepSeek V4.1 Flash) across 36 SecRepoBench tasks with and without them. The files moved the rate of secure completions by -8 to +6 percentage points with no consistent pattern, but disclosure differed sharply: Claude Code named the file in about two thirds of its final messages, while OpenCode mentioned it almost exclusively in its reasoning trace rather than the message the developer reads. Flagging the file explicitly as an attack did not reliably protect the code, and the paper positions itself as a first measurement rather than a complete risk assessment.
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.