arXiv:2605.22875v2 Announce Type: replace Abstract: Long-horizon mathematical reasoning fails less often because a model cannot produce a valid next step than because an agent fails to maintain and e...
Automatically constructing well-specified and valuable mathematical conjectures remains a central challenge in AI-assisted mathematical discovery. Many existing open problems and conjectures are often too broad, underspecified, or difficult to connect to plausible proof or refutation strategies.
EPOCH is an evidence‑governed architecture for AI research agents that improves how candidate discoveries are evaluated and validated. By combining explicit task contracts, typed memory, active falsification, admission checks, and independent replay, EPOCH ensures that each candidate is judged against the strength and scope of its claim. The system achieves state‑of‑the‑art performance on several benchmarks, including AlgoTune, Math14, and AgentHPO, and demonstrates significant advances in executable constructions, algorithm optimization, counterexamples, and proof‑supported results across ten discovery problems.
The paper introduces Ansatz, a mathematical research agent that uses Continual Graph Memory to organize and reuse intermediate proof results across multiple problems. The system represents facts, plans, and counterexamples in a unified graph, enabling dependency-aware retrieval, evidence-sensitive curation, and scoped recall to guide long-horizon proof searches. Experiments show Ansatz solves all ten First Proof Second Batch problems, tackles the Jamison caterpillar conjecture, and makes progress on several Erdős problems without human help.
arXiv:2607. 14582v1 Announce Type: new Abstract: Existing LLM-based theorem provers have achieved impressive results on formal mathematics benchmarks, yet they remain confined to acting as autonomous agents that prove a stated proposition.
arXiv:2607. 06820v1 Announce Type: new Abstract: Recent advances in AI for Mathematics have focused largely on autoformalization and theorem proving, leaving the role of Computer Algebra Systems (CAS) in agentic LLM workflows underexplored.
arXiv:2603. 02668v2 Announce Type: replace Abstract: We present SorryDB, a dynamically-updating benchmark of open Lean tasks drawn from 78 real world formalization projects on GitHub.
arXiv:2607. 11307v1 Announce Type: new Abstract: Full-proof autoformalization bridges extensive mathematical proofs in natural language with formally validated reasoning, offering a pathway to elevate the ceiling of verifiable mathematical reasoning.
The paper introduces the AI Mathematician (AIM) framework, which leverages Large Reasoning Models (LRMs) to tackle frontier mathematical research. AIM addresses the complexity and procedural rigor of research problems through an exploration mechanism for longer solution paths and a pessimistic reasonable verification method for reliability. Early experiments show AIM can autonomously construct significant proof components and uncover non‑trivial insights across real‑world mathematical topics.
arXiv:2606. 15258v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly capable of mathematical problem solving and can even assist with research-level proofs, yet we still lack a scalable and reproducible way to measure step-level reasoning in long proofs across diverse sources.
MathAdv is a diagnostic benchmark for formal theorem proving that covers 13 undergraduate- and graduate-level mathematics domains. It includes Lean 4 proofs and up to three auxiliary tasks—multiple-choice questions, fill-in-the-blank problems, and expert-crafted transformations—to probe knowledge, informal reasoning, and robustness to problem presentation. Evaluation of current theorem provers shows formalization is a major bottleneck, performance varies by domain, natural-language guidance can help or hinder models, and equivalent reformulations reveal significant robustness gaps.
ReuF2F is a Lean 4 benchmark comprising 244 formalized open problems sourced from Research Experiences for Undergraduates (REU). It aims to evaluate coding agents on less prominent, entry‑level research problems across diverse mathematical subfields, using a Docker‑based Lean project setup and a unified harness called Leanimum‑agent. The study finds that even the best model solves only about 40 % of the problems, indicating significant room for improvement.