arXiv AI
AI with Authority, from Application to Silicon
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Sep 1
Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free
arXiv:2608.28997v1 Announce Type: new Abstract: In May 2026 an OpenAI model produced a counterexample to the Erd\H{o}s unit distance conjecture. Five mathematicians published a human-verified version...
arXiv AI
Oct 31
Efficient Scalable Oversight via Rewinding
The paper introduces Rewindable Interactive Proofs (RIPs), a new model for scalable oversight where a weak verifier can rewind a powerful AI prover to an earlier state during interaction. RIPs enable verification of oracle‑aided computations that are robust to small changes in oracle answers, achieving near‑linear verifier time without relying on cryptography. The authors provide a construction, implement it on MNIST, and demonstrate that RIPs can outperform existing proof systems in practice.
arXiv AI
Oct 31
Beyond fabrication: Misattributed numbers in papers written by AI research agents
The paper examines how AI‑written research papers often contain misattributed numerical claims. By re‑analyzing 540 judgments from a benchmark of nine AI agents on fifteen research problems, the authors manually labeled 256 claims and found that most failures stem from misalignment between the paper and the underlying work rather than outright cheating. They propose a deterministic claim‑to‑evidence checker that achieves over 90% precision and, when combined with an LLM verifier, offers a more reliable audit of AI‑generated research.
arXiv AI
Jul 29
F(AI)2R: Who Did What, and Who Checked? Verifiable AI Provenance as an Executable Skill
arXiv:2607. 25637v1 Announce Type: cross Abstract: F(AI)2R is FAIR research with AI in the loop, twice: an AI-assisted authoring pass and a machine-readable audit pass over every artefact.
Hugging Face Trending Papers
Oct 29
Efficient Scalable Oversight via Rewinding
The paper introduces Rewindable Interactive Proofs (RIPs), a new model for scalable oversight where a weak verifier can rewind a powerful AI prover to an earlier state during interaction. RIPs enable efficient verification of computations whose outputs are robust to small changes in oracle answers, achieving near-linear verifier time without relying on cryptography. The authors implement the protocol, demonstrate a preliminary MNIST experiment, and show that an RIP can outperform a state‑of‑the‑art deployed proof system.
arXiv AI
Oct 31
Scaling Lean Theorem Proving for Real-World Code Verification
The paper introduces EasyProver, a Lean theorem prover that uses recursive agents, isolated contexts, asynchronous search, parallel tactic probing, and an elastic elaboration service. It achieves near‑saturation results on several benchmark suites, proving 669/672 PutnamBench problems, all six IMO 2026 formalizations, 597/600 NTP4VC verification conditions, and all 189 VERINA tasks. Additionally, the authors present Aegis, a pipeline that transforms competitive programming problems into harder verification tasks by generating safe Rust solutions, translating them to Lean, and producing 2,045 Rust‑Lean program pairs with 11,533 candidate specifications, enabling new benchmarks for provers and reinforcement learning.