A scientific agent harness raised GPT-5.2's attack success rate on 50 harmful chemistry requests from 2 to 20 percent under direct prompting
AspireAI community · arXiv preprint
Wrapping a model in an agent harness does not keep the model's safety intact, and a new study of five scientific agent harnesses finds the gap can be wide. The authors ran 50 harmful chemistry requests from SafeSciBench against four recent GPT models, each with and without its harness. Under direct prompting, with no jailbreak in the request, ChemToolAgent pushed GPT-5.2's attack success rate from 2% to 20% and Biomni pushed it to 24%; the largest single gap was 70 percentage points for DrugAgent. The adaptive PAIR attack tells the sharper story: it succeeds on only 2% of requests against the bare GPT-5.5, but on 38% to 60% of requests once the same model is deployed inside a harness. The result is not uniform - some configurations preserve or even reduce harmful compliance - which is the practical point: the safety of a deployed agent is a property of the model, the harness and the request together, and cannot be read off the base model alone.
Caveat: 50 requests and one attack family, with a keyword-based refusal rate that the authors themselves note is an imperfect measure of harmful success.
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.