aspireai.
PUBLIC EDITION

Four in five unsupported numbers in AI research agent papers were real values pulled from the wrong experiment, not invented data

AspireAI community · arXiv
Re-analysis of a public benchmark for AI research agents found that only 21 of 135 submissions passed an LLM judge's integrity gate, and the usual reading of that result is fabrication: agents inventing results. The authors re-analyzed all 540 released judgments at the level of individual rubric criteria, then hand-labeled 256 numerical claims from 18 submissions against the agents' own working directories. Their finding is that failures concentrate on alignment between the paper and the underlying work rather than overt cheating, and that roughly four in five unsupported numbers exist somewhere in the agent's files but belong to a different experiment, metric or run; numbers with no source at all are a minority. They built a deterministic claim-to-evidence checker with rules frozen before labeling, which certified claims with 0.92 precision against blinded annotators (78 of 85 certified claims traceable, Cohen's kappa 0.89) while verifying only a subset. A same-evidence LLM verifier had higher recall but accepted 19 of the 53 non-traceable claims, roughly three times the checker's rate. The scope limit is explicit: one benchmark, nine agents, fifteen tasks.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.