{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7PKBQYXQZL5J2TYTP263FPKIWP","short_pith_number":"pith:7PKBQYXQ","schema_version":"1.0","canonical_sha256":"fbd41862f0cafa9d4f137ebdb2bd48b3e8c857327f4347bb3bbd0c55e8f28368","source":{"kind":"arxiv","id":"2404.12534","version":3},"attestation_state":"computed","paper":{"title":"Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO","stat.ML"],"primary_cat":"cs.AI","authors_text":"Anima Anandkumar, Kaiyu Yang, Peiyang Song","submitted_at":"2024-04-18T22:54:08Z","abstract_excerpt":"Neural theorem proving combines large language models (LLMs) with proof assistants such as Lean, where the correctness of formal proofs can be rigorously verified, leaving no room for hallucination. With existing neural theorem provers pretrained on a fixed collection of data and offering valuable suggestions at times, it is challenging for them to continually prove novel theorems in a fully autonomous mode, where human insights may be critical. In this paper, we explore LLMs as copilots that assist humans in proving theorems. We introduce Lean Copilot, a general framework for running LLM infe"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2404.12534","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-04-18T22:54:08Z","cross_cats_sorted":["cs.LG","cs.LO","stat.ML"],"title_canon_sha256":"056739b4512bae17f45cc8c3fa8288dd6639da71a98de1931c3fbd8057ec07f0","abstract_canon_sha256":"f40c62a2a8a2d5ddd39a50726a1f386de9ff1448dfe7f53944da25ed71fc18ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:24.117630Z","signature_b64":"jTUN03AVpF7JknsBLdhl99gc4sbBi9xzPWj0qejtd1y6UV1X2up1yabbZbwy7tcwkWR7RN90AY1m6SYAS4EuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbd41862f0cafa9d4f137ebdb2bd48b3e8c857327f4347bb3bbd0c55e8f28368","last_reissued_at":"2026-07-05T11:01:24.117153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:24.117153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO","stat.ML"],"primary_cat":"cs.AI","authors_text":"Anima Anandkumar, Kaiyu Yang, Peiyang Song","submitted_at":"2024-04-18T22:54:08Z","abstract_excerpt":"Neural theorem proving combines large language models (LLMs) with proof assistants such as Lean, where the correctness of formal proofs can be rigorously verified, leaving no room for hallucination. With existing neural theorem provers pretrained on a fixed collection of data and offering valuable suggestions at times, it is challenging for them to continually prove novel theorems in a fully autonomous mode, where human insights may be critical. In this paper, we explore LLMs as copilots that assist humans in proving theorems. We introduce Lean Copilot, a general framework for running LLM infe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.12534","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.12534/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.12534","created_at":"2026-07-05T11:01:24.117206+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.12534v3","created_at":"2026-07-05T11:01:24.117206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.12534","created_at":"2026-07-05T11:01:24.117206+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PKBQYXQZL5J","created_at":"2026-07-05T11:01:24.117206+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PKBQYXQZL5J2TYT","created_at":"2026-07-05T11:01:24.117206+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PKBQYXQ","created_at":"2026-07-05T11:01:24.117206+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11113","citing_title":"A Neurosymbolic Prolog Skill for LLM-Driven Service Placement","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08728","citing_title":"Artificial Intelligence for Mathematical Reasoning: An Integrated Survey of Language Models, Neuro-symbolic Systems, and Verified Discovery","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20642","citing_title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28841","citing_title":"LAMP: Lean-based Agentic framework with MCP and Proof Repair","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27485","citing_title":"Automating Formal Verification with Agent-Guided Tree Search","ref_index":86,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30914","citing_title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","ref_index":130,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12787","citing_title":"Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2504.20984","citing_title":"ACE: A Security Architecture for LLM-Integrated App Systems","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17829","citing_title":"Interactive Evaluation Requires a Design Science","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16347","citing_title":"Lean Atlas: An Integrated Proof Environment for Scalable Human-AI Collaborative Formalization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06651","citing_title":"AI co-mathematician: Accelerating mathematicians with agentic AI","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06651","citing_title":"AI co-mathematician: Accelerating mathematicians with agentic AI","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01394","citing_title":"LiveFMBench: Unveiling the Power and Limits of Agentic Workflows in Specification Generation","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06802","citing_title":"Riemann-Bench: A Benchmark for Moonshot Mathematics","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16507","citing_title":"Deep Vision: A Formal Proof of Wolstenholmes Theorem in Lean 4","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17229","citing_title":"Yanasse: Finding New Proofs from Deep Vision's Analogies, Part 1","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP","json":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP.json","graph_json":"https://pith.science/api/pith-number/7PKBQYXQZL5J2TYTP263FPKIWP/graph.json","events_json":"https://pith.science/api/pith-number/7PKBQYXQZL5J2TYTP263FPKIWP/events.json","paper":"https://pith.science/paper/7PKBQYXQ"},"agent_actions":{"view_html":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP","download_json":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP.json","view_paper":"https://pith.science/paper/7PKBQYXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.12534&json=true","fetch_graph":"https://pith.science/api/pith-number/7PKBQYXQZL5J2TYTP263FPKIWP/graph.json","fetch_events":"https://pith.science/api/pith-number/7PKBQYXQZL5J2TYTP263FPKIWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP/action/storage_attestation","attest_author":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP/action/author_attestation","sign_citation":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP/action/citation_signature","submit_replication":"https://pith.science/pith/7PKBQYXQZL5J2TYTP263FPKIWP/action/replication_record"}},"created_at":"2026-07-05T11:01:24.117206+00:00","updated_at":"2026-07-05T11:01:24.117206+00:00"}