aspireai.
PUBLIC EDITION

Judging research-level mathematics with one-shot LLM verdicts produced 23 percent false positives, and a multi-format pipeline cut that to 6 percent

AspireAI community · arXiv (cs.AI)
As frontier models move from olympiad problems to research-level mathematics, the bottleneck shifts from solving to judging. This paper analyses submissions to the Ramanujan Challenge, a number-theory benchmark built from unpublished results and open conjectures, and reports correct submissions that are conceptually distinct from the official solutions, including a proof of one of the published open conjectures, with eight results proved by the authors but unpublished and two open conjectures among them. It also notes that some complete proofs came from amateur mathematicians and that one open conjecture drew multiple correct proofs. The evaluation contribution is a pipeline that judges natural-language proofs, CAS code and Lean formalizations on semantic and logical correctness; against conventional one-shot LLM judgment it cuts false-positive verdicts on natural-language proofs from 23 to 6 percent and improves judgment accuracy on supporting code from 46 to 58 percent. The open-conjecture proof is the authors' claim, not an independent audit.
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.