{"total":101,"rows":[{"id":"2509.02547","title":"The Landscape of Agentic Reinforcement Learning for LLMs: A Survey","created":"2025-09-02","cited_by_count":205,"area":"agents"},{"id":"2511.22570","title":"DeepSeekMath-V2: Towards Self-Verifiable Mathematical Reasoning","created":"2025-11-27","cited_by_count":94,"area":"lr"},{"id":"2508.16949","title":"Breaking the Exploration Bottleneck: Rubric-Scaffolded Reinforcement Learning for General LLM Reasoning","created":"2025-08-23","cited_by_count":63,"area":"lr"},{"id":"2509.22819","title":"Hilbert: Recursively Building Formal Proofs with Informal Reasoning","created":"2025-09-26","cited_by_count":60,"area":"lr"},{"id":"2512.17260","title":"Seed-Prover 1.5: Mastering Undergraduate-Level Theorem Proving via Learning from Experience","created":"2025-12-19","cited_by_count":44,"area":null},{"id":"2510.12787","title":"Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics","created":"2025-10-14","cited_by_count":31,"area":"lr"},{"id":"2509.06493","title":"Scaling up Multi-Turn Off-Policy RL and Multi-Agent Tree Search for LLM Step-Provers","created":"2025-09-08","cited_by_count":28,"area":"lr"},{"id":"2511.02872","title":"FATE: A Formal Benchmark Series for Frontier Algebra of Multiple Difficulty Levels","created":"2025-11-04","cited_by_count":27,"area":null},{"id":"2509.18883","title":"Introducing LongCat-Flash-Thinking: A Technical Report","created":"2025-09-23","cited_by_count":22,"area":"lr"},{"id":"2512.16301","title":"Adaptation of Agentic AI: A Survey of Post-Training, Memory, and Skills","created":"2025-12-18","cited_by_count":22,"area":"agents"},{"id":"2510.04520","title":"Aria: An Agent For Retrieval and Iterative Auto-Formalization via Dependency Graph","created":"2025-10-06","cited_by_count":21,"area":"agents"},{"id":"2510.15981","title":"ProofFlow: A Dependency Graph Approach to Faithful Proof Autoformalization","created":"2025-10-13","cited_by_count":21,"area":null},{"id":"2510.26144","title":"The FM Agent","created":"2025-10-30","cited_by_count":21,"area":"agents"},{"id":"2510.24592","title":"ReForm: Reflective Autoformalization with Prospective Bounded Sequence Optimization","created":"2025-10-28","cited_by_count":20,"area":"lr"},{"id":"2510.02212","title":"DiFFPO: Training Diffusion LLMs to Reason Fast and Furious via Reinforcement Learning","created":"2025-10-02","cited_by_count":19,"area":"lr"},{"id":"2602.24273","title":"A Minimal Agent for Automated Theorem Proving","created":"2026-02-27","cited_by_count":18,"area":"agents"},{"id":"2602.09464","title":"AlgoVeri: An Aligned Benchmark for Verified Code Generation on Classical Algorithms","created":"2026-02-10","cited_by_count":12,"area":null},{"id":"2606.05400","title":"LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization","created":"2026-06-03","cited_by_count":12,"area":null},{"id":"2511.18760","title":"HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs","created":"2025-11-24","cited_by_count":11,"area":"lr"},{"id":"2602.13103","title":"R-Diverse: Mitigating Diversity Illusion in Self-Play LLM Training","created":"2026-02-13","cited_by_count":10,"area":"lr"},{"id":"2604.20209","title":"Scaling Self-Play with Self-Guidance","created":"2026-04-22","cited_by_count":10,"area":"synth"},{"id":"2605.13171","title":"Formal Conjectures: An Open and Evolving Benchmark for Verified Discovery in Mathematics","created":"2026-05-13","cited_by_count":10,"area":null},{"id":"2605.29955","title":"Formalizing Mathematics at Scale","created":"2026-05-28","cited_by_count":10,"area":null},{"id":"2603.15929","title":"Semi-Autonomous Formalization of the Vlasov-Maxwell-Landau Equilibrium","created":"2026-03-16","cited_by_count":9,"area":null},{"id":"2606.06468","title":"Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement","created":"2026-06-04","cited_by_count":9,"area":"agents"},{"id":"2608.05179","title":"Autonomous Research Agents: A Survey of AI Scientists and the Verification Gap","created":"2026-06-29","cited_by_count":9,"area":"agents"},{"id":"2510.10815","title":"DRIFT: Decompose, Retrieve, Illustrate, then Formalize Theorems","created":"2025-10-12","cited_by_count":8,"area":null},{"id":"2603.02668","title":"SorryDB: Can AI Provers Complete Real-World Lean Theorems?","created":"2026-03-03","cited_by_count":8,"area":null},{"id":"2512.10534","title":"Achieving Olympiad-Level Geometry Large Language Model Agent via Complexity Boosting Reinforcement Learning","created":"2025-12-11","cited_by_count":7,"area":"agents"},{"id":"2602.02990","title":"Learning to Repair Lean Proofs from Compiler Feedback","created":"2026-02-03","cited_by_count":7,"area":"agents"},{"id":"2605.17283","title":"OProver: A Unified Framework for Agentic Formal Theorem Proving","created":"2026-05-17","cited_by_count":7,"area":"agents"},{"id":"2510.02335","title":"FormalML: A Benchmark for Evaluating Formal Subgoal Completion in Machine Learning Theory","created":"2025-09-26","cited_by_count":5,"area":null},{"id":"2510.16552","title":"LANPO: Bootstrapping Language and Numerical Feedback for Reinforcement Learning in LLMs","created":"2025-10-18","cited_by_count":5,"area":"synth"},{"id":"2511.11500","title":"Honesty over Accuracy: Trustworthy Language Models through Reinforced Hesitation","created":"2025-11-14","cited_by_count":5,"area":null},{"id":"2603.19514","title":"Learning to Disprove: Formal Counterexample Generation with Large Language Models","created":"2026-03-19","cited_by_count":5,"area":"lr"},{"id":"2604.26311","title":"DreamProver: Evolving Transferable Lemma Libraries via a Wake-Sleep Theorem-Proving Agent","created":"2026-04-29","cited_by_count":5,"area":"agents"},{"id":"2606.26442","title":"AXLE: A Cloud Infrastructure for Lean 4 Theorem Proving Utilities","created":"2026-06-24","cited_by_count":5,"area":null},{"id":"2512.10739","title":"Intern-S1-MO: Long-horizon Reasoning Agent for Olympiad?Level Mathematical Problem Solving","created":"2025-12-11","cited_by_count":4,"area":"lr"},{"id":"2602.02477","title":"Training LLMs for Divide-and-Conquer Reasoning Elevates Test-Time Scalability","created":"2026-02-02","cited_by_count":4,"area":"lr"},{"id":"2602.02561","title":"MathlibLemma: Folklore Lemma Generation and Benchmark for Formal Mathematics","created":"2026-01-30","cited_by_count":4,"area":"lr"},{"id":"2606.31134","title":"Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","created":"2026-06-30","cited_by_count":4,"area":"lr"},{"id":"2510.17498","title":"Deep Self-Evolving Reasoning","created":"2025-10-20","cited_by_count":3,"area":"lr"},{"id":"2511.21522","title":"Pessimistic Verification for Open Ended Math Questions","created":"2025-11-26","cited_by_count":3,"area":"lr"},{"id":"2512.00997","title":"IndiMathBench: Autoformalizing Mathematical Reasoning Problems with a Human Touch","created":"2025-11-30","cited_by_count":3,"area":"lr"},{"id":"2603.29500","title":"Learning to Generate Formally Verifiable Step-by-Step Logic Reasoning via Structured Formal Intermediaries","created":"2026-03-31","cited_by_count":3,"area":"lr"},{"id":"2605.23772","title":"Agentic Proving for Program Verification","created":"2026-05-22","cited_by_count":3,"area":"agents"},{"id":"2606.04883","title":"Optimizing the Cost-Quality Tradeoff of Agentic Theorem Provers in Lean","created":"2026-06-03","cited_by_count":3,"area":"agents"},{"id":"2509.14274","title":"Discovering New Theorems via LLMs with In-Context Proof Learning in Lean","created":"2025-09-16","cited_by_count":2,"area":null},{"id":"2509.24827","title":"Putnam-like dataset summary: LLMs as mathematical competition contestants","created":"2025-09-29","cited_by_count":2,"area":null},{"id":"2510.11986","title":"Conjecturing: An Overlooked Step in Formal Mathematical Reasoning","created":"2025-10-13","cited_by_count":2,"area":"lr"},{"id":"2511.11990","title":"Improving Autoformalization Using Direct Dependency Retrieval","created":"2025-11-15","cited_by_count":2,"area":"rag"},{"id":"2512.10187","title":"MINIF2F-DAFNY: LLM-Guided Mathematical Theorem Proving via Auto-Active Verification","created":"2025-12-11","cited_by_count":2,"area":"lr"},{"id":"2512.18256","title":"MSC-180: A Benchmark for Automated Formal Theorem Proving from Mathematical Subject Classification","created":"2025-12-20","cited_by_count":2,"area":null},{"id":"2602.11639","title":"PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning","created":"2026-02-12","cited_by_count":2,"area":"lr"},{"id":"2604.00790","title":"RefineRL: Advancing Competitive Programming with Self-Refinement Reinforcement Learning","created":"2026-04-01","cited_by_count":2,"area":"lr"},{"id":"2605.08817","title":"How You Begin is How You Reason: Driving Exploration in RLVR via Prefix-Tuned Priors","created":"2026-05-09","cited_by_count":2,"area":"lr"},{"id":"2509.12603","title":"EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving","created":"2025-09-16","cited_by_count":1,"area":"lr"},{"id":"2510.12829","title":"Mathematics with large language models as provers and verifiers","created":"2025-10-11","cited_by_count":1,"area":null},{"id":"2511.13043","title":"Spark-Prover-X1: Formal Theorem Proving Through Diverse Data Training","created":"2025-11-17","cited_by_count":1,"area":null},{"id":"2512.14252","title":"G\\\"odel's Poetry","created":"2025-12-16","cited_by_count":1,"area":null},{"id":"2602.10538","title":"Why Agentic Theorem Prover Works: A Statistical Provability Theory of Mathematical Reasoning Models","created":"2026-02-11","cited_by_count":1,"area":"lr"},{"id":"2603.03352","title":"Perfect score on IPhO 2025 theory by Gemini agent","created":"2026-02-26","cited_by_count":1,"area":null},{"id":"2603.04528","title":"Discovering mathematical concepts through a multi-agent system","created":"2026-03-04","cited_by_count":1,"area":null},{"id":"2603.14628","title":"s2n-bignum-bench: A practical benchmark for evaluating low-level code reasoning of LLMs","created":"2026-03-15","cited_by_count":1,"area":"lr"},{"id":"2604.01302","title":"Scaling Reasoning Tokens via RL and Parallel Thinking: Evidence From Competitive Programming","created":"2026-04-01","cited_by_count":1,"area":"lr"},{"id":"2605.07147","title":"MathlibPR: Pull Request Merge-Readiness Benchmark for Formal Mathematical Libraries","created":"2026-05-08","cited_by_count":1,"area":"lr"},{"id":"2605.10344","title":"TMAS: Scaling Test-Time Compute via Multi-Agent Synergy","created":"2026-05-11","cited_by_count":1,"area":"lr"},{"id":"2605.15445","title":"From LLM-Generated Conjectures to Lean Formalizations: Automated Polynomial Inequality Proving via Sum-of-Squares Certificates","created":"2026-05-14","cited_by_count":1,"area":"lr"},{"id":"2605.19063","title":"Mapping Uncharted Symmetries: Machine Discovery in Combinatorics","created":"2026-05-18","cited_by_count":1,"area":null},{"id":"2605.20244","title":"Lean Refactor: Multi-Objective Controllable Proof Optimization via Agentic Strategy Search","created":"2026-05-18","cited_by_count":1,"area":"agents"},{"id":"2605.30914","title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","created":"2026-05-29","cited_by_count":1,"area":"lr"},{"id":"2606.01861","title":"A Theoretical Framework for Self-Play Theorem Proving Algorithms","created":"2026-06-01","cited_by_count":1,"area":"synth"},{"id":"2606.13782","title":"MA-ProofBench: A Two-Tiered Evaluation of LLMs for Theorem Proving in Mathematical Analysis","created":"2026-06-11","cited_by_count":1,"area":null},{"id":"2607.07779","title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","created":"2026-07-08","cited_by_count":1,"area":null},{"id":"2607.14178","title":"ReasFlow: Assisting Reasoning-Centric Scientific Discovery in Applied Mathematics via a Knowledge-Based Multi-Agent System","created":"2026-07-15","cited_by_count":1,"area":"lr"},{"id":"2607.14582","title":"MathCoPilot: An Interactive System for Human-AI Symbiotic Paradigm of Mathematical Research","created":"2026-07-16","cited_by_count":1,"area":null},{"id":"2609.05157","title":"AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanics","created":"2026-09-04","cited_by_count":1,"area":null},{"id":"2512.18857","title":"CORE: Concept-Oriented Reinforcement for Bridging the Definition-Application Gap in Mathematical Reasoning","created":"2025-12-21","cited_by_count":0,"area":"lr"},{"id":"2601.16172","title":"Inference-Time Diversity in RL-Trained Lean Theorem Provers: A Diagnostic Study","created":"2026-01-22","cited_by_count":0,"area":null},{"id":"2602.10512","title":"Exponential Sample Complexity Separation between Flat and Hierarchical Agentic Theorem Provers","created":"2026-02-11","cited_by_count":0,"area":"agents"},{"id":"2603.20405","title":"Putnam 2025 Problems in Rocq using Opus 4.6 and Rocq-MCP","created":"2026-03-20","cited_by_count":0,"area":null},{"id":"2604.18587","title":"Compile to Compress: Boosting Formal Theorem Provers by Compiler Outputs","created":"2026-03-13","cited_by_count":0,"area":"lr"},{"id":"2605.04472","title":"Automated Formal Proofs of Combinatorial Identities via Wilf-Zeilberger Guidance and LLMs","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2605.06184","title":"Teaching LLMs Program Semantics via Symbolic Execution Traces","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.11905","title":"Rethinking Supervision Granularity: Segment-Level Learning for LLM-Based Theorem Proving","created":"2026-05-12","cited_by_count":0,"area":"lr"},{"id":"2605.16379","title":"An Information-Theoretic Criterion for Efficient Data Synthesis","created":"2026-05-11","cited_by_count":0,"area":"synth"},{"id":"2605.17255","title":"CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean","created":"2026-05-17","cited_by_count":0,"area":"lr"},{"id":"2606.04273","title":"Human agency in initial human-AI proof formalization workflows","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2606.17581","title":"Visored: A Controlled-Natural-Language Prover for LLM-Generated Mathematics","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2607.06820","title":"Evaluating SageMath-Augmented LLM Agents for Computational and Experimental Mathematics","created":"2026-07-07","cited_by_count":0,"area":"agents"},{"id":"2608.14585","title":"Euclid-Omni : A Unified Neuro-Symbolic Framework for Plane Geometry","created":"2026-06-17","cited_by_count":0,"area":null},{"id":"2608.26310","title":"FaithSieve: Fine-Grained Evaluation of Math Proofs with Faithful Formal Evidence","created":"2026-08-26","cited_by_count":0,"area":null},{"id":"2609.10712","title":"An Open Recipe for IMO Gold: Training Nemotron for Olympiad Mathematics","created":"2026-09-09","cited_by_count":0,"area":null},{"id":"2609.34460","title":"When Does Structured Knowledge Help Neural Theorem Proving?","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2609.35790","title":"Sage: Formalization with Semantic Correction","created":"2026-09-16","cited_by_count":0,"area":null},{"id":"2610.09681","title":"Cost-Efficient Theorem Proving via Agent Orchestration in Program Verification","created":"2026-10-07","cited_by_count":0,"area":"agents"},{"id":"2610.11605","title":"NanoProof: Open and Efficient Automated Theorem Proving in Lean 4","created":"2026-10-08","cited_by_count":0,"area":null},{"id":"2610.11862","title":"LEVER: Adaptive Cost-Aware Proof Search Over AND/OR Graphs","created":"2026-10-08","cited_by_count":0,"area":null},{"id":"2610.13461","title":"SqueezeBench: Saturation-Resilient Evaluation of Mathematical Capability","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.17697","title":"LeanPRM: Lean-Grounded Process Supervision for Natural Language Proof Verification","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":"100"}