{"total":151,"rows":[{"id":"2303.18223","title":"A Survey of Large Language Models","created":"2023-03-31","cited_by_count":2576,"area":null},{"id":"2307.03109","title":"A Survey on Evaluation of Large Language Models","created":"2023-07-06","cited_by_count":1242,"area":null},{"id":"2210.12283","title":"Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs","created":"2022-10-21","cited_by_count":291,"area":null},{"id":"2210.06774","title":"Re3: Generating Longer Stories With Recursive Reprompting and Revision","created":"2022-10-13","cited_by_count":193,"area":null},{"id":"2302.12433","title":"ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics","created":"2023-02-24","cited_by_count":192,"area":null},{"id":"2502.07640","title":"Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving","created":"2025-02-11","cited_by_count":133,"area":null},{"id":"2406.03847","title":"Lean Workbook: A large-scale Lean problem set formalized from natural language math problems","created":"2024-06-06","cited_by_count":122,"area":null},{"id":"2303.04910","title":"Baldur: Whole-Proof Generation and Repair with Large Language Models","created":"2023-03-08","cited_by_count":119,"area":null},{"id":"2310.00656","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","created":"2023-10-01","cited_by_count":109,"area":null},{"id":"2502.03544","title":"Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2","created":"2025-02-05","cited_by_count":97,"area":null},{"id":"2305.11391","title":"A Survey of Safety and Trustworthiness of Large Language Models through the Lens of Verification and Validation","created":"2023-05-19","cited_by_count":93,"area":null},{"id":"2402.09371","title":"Transformers Can Achieve Length Generalization But Not Robustly","created":"2024-02-14","cited_by_count":86,"area":null},{"id":"2303.10868","title":"Retrieving Multimodal Information for Augmented Generation: A Survey","created":"2023-03-20","cited_by_count":85,"area":null},{"id":"2502.03438","title":"BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Proving","created":"2025-02-05","cited_by_count":84,"area":null},{"id":"2403.01632","title":"SynCode: LLM Generation with Grammar Augmentation","created":"2024-03-03","cited_by_count":69,"area":null},{"id":"2303.04864","title":"nl2spec: Interactively Translating Unstructured Natural Language to Temporal Logics with Large Language Models","created":"2023-03-08","cited_by_count":60,"area":null},{"id":"2404.12534","title":"Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean","created":"2024-04-18","cited_by_count":58,"area":null},{"id":"2510.01346","title":"Aristotle: IMO-level Automated Theorem Proving","created":"2025-10-01","cited_by_count":58,"area":null},{"id":"2404.09939","title":"A Survey on Deep Learning for Theorem Proving","created":"2024-04-15","cited_by_count":57,"area":null},{"id":"2309.04295","title":"FIMO: A Challenge Formal Dataset for Automated Theorem Proving","created":"2023-09-08","cited_by_count":55,"area":null},{"id":"2303.04488","title":"Magnushammer: A Transformer-Based Approach to Premise Selection","created":"2023-03-08","cited_by_count":50,"area":null},{"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":"2311.03755","title":"Multilingual Mathematical Autoformalization","created":"2023-11-07","cited_by_count":39,"area":null},{"id":"2401.12491","title":"Assessing and Understanding Creativity in Large Language Models","created":"2024-01-23","cited_by_count":35,"area":null},{"id":"2405.01379","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving","created":"2024-05-02","cited_by_count":35,"area":null},{"id":"2410.12112","title":"Planning Anything with Rigor: General-Purpose Zero-Shot Planning with LLM-based Formalized Programming","created":"2024-10-15","cited_by_count":35,"area":null},{"id":"2410.15700","title":"InternLM2.5-StepProver: Advancing Automated Theorem Proving via Critic-Guided Search","created":"2024-10-21","cited_by_count":34,"area":null},{"id":"2206.01962","title":"Formal Specifications from Natural Language","created":"2022-06-04","cited_by_count":33,"area":null},{"id":"2406.07222","title":"Reliable Evaluation and Benchmarks for Statement Autoformalization","created":"2024-06-11","cited_by_count":32,"area":null},{"id":"2309.01933","title":"Provably safe systems: the only path to controllable AGI","created":"2023-09-05","cited_by_count":29,"area":null},{"id":"2301.02195","title":"Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs","created":"2023-01-05","cited_by_count":27,"area":null},{"id":"2405.17216","title":"Autoformalizing Euclidean Geometry","created":"2024-05-27","cited_by_count":27,"area":null},{"id":"2405.14414","title":"Proving Theorems Recursively","created":"2024-05-23","cited_by_count":26,"area":null},{"id":"2309.15806","title":"Lyra: Orchestrating Dual Correction in Automated Theorem Proving","created":"2023-09-27","cited_by_count":25,"area":null},{"id":"2312.07622","title":"Mathematical Language Models: A Survey","created":"2023-12-12","cited_by_count":24,"area":null},{"id":"2410.10135","title":"FormalAlign: Automated Alignment Evaluation for Autoformalization","created":"2024-10-14","cited_by_count":24,"area":null},{"id":"2209.13020","title":"Law Informs Code: A Legal Informatics Approach to Aligning Artificial Intelligence with Humans","created":"2022-09-14","cited_by_count":23,"area":null},{"id":"2405.20671","title":"Position Coupling: Improving Length Generalization of Arithmetic Transformers Using Task Structure","created":"2024-05-31","cited_by_count":23,"area":null},{"id":"2502.05567","title":"ATLAS: Autoformalizing Theorems through Lifting, Augmentation, and Synthesis of Data","created":"2025-02-08","cited_by_count":23,"area":null},{"id":"2211.07524","title":"Towards a Mathematics Formalisation Assistant using Large Language Models","created":"2022-11-14","cited_by_count":22,"area":null},{"id":"2409.14274","title":"Proof Automation with Large Language Models","created":"2024-09-22","cited_by_count":22,"area":null},{"id":"2505.23486","title":"Autoformalization in the Era of Large Language Models: A Survey","created":"2025-05-29","cited_by_count":21,"area":null},{"id":"2510.15981","title":"ProofFlow: A Dependency Graph Approach to Faithful Proof Autoformalization","created":"2025-10-13","cited_by_count":21,"area":null},{"id":"2506.07047","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","created":"2025-06-08","cited_by_count":18,"area":null},{"id":"2506.11085","title":"LeanExplore: A search engine for Lean 4 declarations","created":"2025-06-04","cited_by_count":18,"area":null},{"id":"2601.03298","title":"130k Lines of Formal Topology in Two Weeks: Simple and Cheap Autoformalization for Everyone?","created":"2026-01-06","cited_by_count":18,"area":null},{"id":"2602.17016","title":"M2F: Automated Formalization of Mathematical Literature at Scale","created":"2026-02-19","cited_by_count":15,"area":null},{"id":"2511.03108","title":"miniF2F-Lean Revisited: Reviewing Limitations and Charting a Path Forward","created":"2025-11-05","cited_by_count":14,"area":null},{"id":"2401.08664","title":"Adapting Large Language Models for Education: Foundational Capabilities, Potentials, and Challenges","created":"2023-12-27","cited_by_count":13,"area":null},{"id":"2212.01944","title":"Automaton-Based Representations of Task Knowledge from Generative Language Models","created":"2022-12-04","cited_by_count":12,"area":null},{"id":"2402.13321","title":"Rigor with Machine Learning from Field Theory to the Poincar\\'e Conjecture","created":"2024-02-20","cited_by_count":12,"area":null},{"id":"2507.07399","title":"Generalized Tree Edit Distance (GTED): A Faithful Evaluation Metric for Statement Autoformalization","created":"2025-07-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":"2402.16269","title":"From Large Language Models and Optimization to Decision Optimization CoPilot: A Research Manifesto","created":"2024-02-26","cited_by_count":11,"area":null},{"id":"2408.05506","title":"Your Context Is Not an Array: Unveiling Random Access Limitations in Transformers","created":"2024-08-10","cited_by_count":11,"area":null},{"id":"2408.11172","title":"SubgoalXL: Subgoal-based Expert Learning for Theorem Proving","created":"2024-08-20","cited_by_count":11,"area":null},{"id":"2501.18310","title":"ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis","created":"2025-01-30","cited_by_count":11,"area":null},{"id":"2310.07957","title":"A New Approach Towards Autoformalization","created":"2023-10-12","cited_by_count":10,"area":null},{"id":"2509.22246","title":"ASSESS: A Semantic and Structural Evaluation Framework for Statement Similarity","created":"2025-09-26","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":"2205.15231","title":"A Survey in Mathematical Language Processing","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2404.01234","title":"GFLean: An Autoformalisation Framework for Lean via GF","created":"2024-04-01","cited_by_count":9,"area":null},{"id":"2508.18914","title":"FormaRL: Enhancing Autoformalization with no Labeled Data","created":"2025-08-26","cited_by_count":9,"area":null},{"id":"2511.09008","title":"A Neurosymbolic Approach to Natural Language Formalization and Verification","created":"2025-11-12","cited_by_count":9,"area":null},{"id":"2606.29493","title":"Faults in Our Formal Benchmarking: Dataset Defects and Evaluation Failures in Lean Theorem Proving","created":"2026-06-28","cited_by_count":9,"area":null},{"id":"2301.10095","title":"Large Language Models as Fiduciaries: A Case Study Toward Robustly Communicating With Artificial Intelligence Through Legal Standards","created":"2023-01-24","cited_by_count":8,"area":null},{"id":"2408.14915","title":"Can Transformers Do Enumerative Geometry?","created":"2024-08-27","cited_by_count":8,"area":null},{"id":"2505.24264","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","created":"2025-05-30","cited_by_count":8,"area":null},{"id":"2510.15940","title":"Lean Finder: Semantic Search for Mathlib That Understands User Intents","created":"2025-10-08","cited_by_count":8,"area":null},{"id":"2510.25427","title":"RLMEval: Evaluating Research-Level Neural Theorem Proving","created":"2025-10-29","cited_by_count":8,"area":null},{"id":"2602.05216","title":"Semantic Search over 9 Million Mathematical Theorems","created":"2026-02-05","cited_by_count":8,"area":null},{"id":"2604.03071","title":"Automatic Textbook Formalization","created":"2026-04-03","cited_by_count":8,"area":null},{"id":"2604.25031","title":"Faithful Autoformalization via Roundtrip Verification and Repair","created":"2026-04-27","cited_by_count":8,"area":null},{"id":"2212.10754","title":"CoRRPUS: Code-based Structured Prompting for Neurosymbolic Story Understanding","created":"2022-12-21","cited_by_count":7,"area":null},{"id":"2310.08796","title":"End-to-end Story Plot Generator","created":"2023-10-13","cited_by_count":7,"area":null},{"id":"2510.06857","title":"Autoformalizer with Tool Feedback","created":"2025-10-08","cited_by_count":7,"area":null},{"id":"2505.15740","title":"HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement","created":"2025-05-21","cited_by_count":6,"area":null},{"id":"2606.16541","title":"The Faithfulness Gap: Certifying Semantic Equivalence Between Natural-Language and Formal Mathematical Statements","created":"2026-06-15","cited_by_count":6,"area":null},{"id":"2402.10767","title":"Inference to the Best Explanation in Large Language Models","created":"2024-02-16","cited_by_count":5,"area":null},{"id":"2503.04763","title":"MiniF2F in Rocq: Automatic Translation Between Proof Assistants -- A Case Study","created":"2025-02-11","cited_by_count":5,"area":null},{"id":"2504.17017","title":"Neural Theorem Proving: Generating and Structuring Proofs for Formal Verification","created":"2025-04-23","cited_by_count":5,"area":null},{"id":"2602.01493","title":"OpInf-LLM: Parametric PDE Solving with LLMs via Operator Inference","created":"2026-02-02","cited_by_count":5,"area":null},{"id":"2603.26996","title":"FormalProofBench: Can Models Write Graduate Level Math Proofs That Are Formally Verified?","created":"2026-03-27","cited_by_count":5,"area":null},{"id":"2406.10268","title":"Autograding Mathematical Induction Proofs with Natural Language Processing","created":"2024-06-11","cited_by_count":4,"area":null},{"id":"2410.15748","title":"Alchemy: Amplifying Theorem-Proving Capability through Symbolic Mutation","created":"2024-10-21","cited_by_count":4,"area":null},{"id":"2412.16177","title":"Mining Math Conjectures from LLMs: A Pruning Approach","created":"2024-12-09","cited_by_count":4,"area":null},{"id":"2502.15507","title":"Steering LLMs for Formal Theorem Proving","created":"2025-02-21","cited_by_count":4,"area":null},{"id":"2605.14061","title":"MathAtlas: A Benchmark for Autoformalization in the Wild","created":"2026-05-13","cited_by_count":4,"area":null},{"id":"2606.13925","title":"Sorries Are Not the Hard Part: An Expert-Review Case Study of a Semi-Autonomous Formalization","created":"2026-06-11","cited_by_count":4,"area":null},{"id":"2606.26525","title":"Theory-Scale Auto-Formalization of Logics for Computer Science","created":"2026-06-25","cited_by_count":4,"area":null},{"id":"2608.29270","title":"SHADOWBENCH: Toward Reliable Automatic Evaluation of Semantic Alignment in Autoformalization","created":"2026-08-29","cited_by_count":4,"area":null},{"id":"2403.18327","title":"$\\forall$uto$\\exists$val: Autonomous Assessment of LLMs in Formal Synthesis and Interpretation Tasks","created":"2024-03-27","cited_by_count":3,"area":null},{"id":"2512.10317","title":"Translating Informal Proofs into Formal Proofs Using a Chain of States","created":"2025-12-11","cited_by_count":3,"area":null},{"id":"2605.30333","title":"COMPOSE: Composing Future Theorems from Citations and Formal Structure","created":"2026-05-28","cited_by_count":3,"area":null},{"id":"2606.08049","title":"SKILL.nb: Selective Formalization and Gated Execution for Durable Agent Workflows","created":"2026-06-06","cited_by_count":3,"area":null},{"id":"2308.10380","title":"A Human-on-the-Loop Optimization Autoformalism Approach for Sustainability","created":"2023-08-20","cited_by_count":2,"area":null},{"id":"2503.09730","title":"Local Look-Ahead Guidance via Verifier-in-the-Loop for Automated Theorem Proving","created":"2025-03-12","cited_by_count":2,"area":null},{"id":"2602.04892","title":"Doc2Spec: Synthesizing Formal Programming Specifications from Natural Language via Grammar Induction","created":"2026-01-30","cited_by_count":2,"area":null},{"id":"2606.14688","title":"Flood and Harvest: The Provable Necessity of Trivia for Generating Valuable Mathematics via the Lens of Language Generation in the Limit","created":"2026-06-12","cited_by_count":2,"area":null},{"id":"2607.20474","title":"VeriSimpl: Robust Optimization Modeling from Natural Language using Simplification-based Verification","created":"2026-05-24","cited_by_count":2,"area":null}],"next_cursor":"100"}