{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QHYDBUMZNAESNX7QMQQVAEOZYY","short_pith_number":"pith:QHYDBUMZ","schema_version":"1.0","canonical_sha256":"81f030d199680926dff064215011d9c62bc4e83e872158c83c7a6a1b1c593a91","source":{"kind":"arxiv","id":"2404.09939","version":3},"attestation_state":"computed","paper":{"title":"A Survey on Deep Learning for Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jialiang Sun, Kaiyu Yang, Logan Murphy, Qidong Su, Xian Zhang, Xujie Si, Zenan Li, Zhaoyu Li","submitted_at":"2024-04-15T17:07:55Z","abstract_excerpt":"Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning in natural language to rigorous derivations in formal systems. In recent years, the advancement of deep learning, especially the emergence of large language models, has sparked a notable surge of research exploring these techniques to enhance the process of theorem proving. This paper presents a comprehensive survey of deep learning for theorem proving by offering (i) a thorough review of existing approaches across various tasks such as autoformalization, premise selection, proofstep generation, and proof "},"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.09939","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-04-15T17:07:55Z","cross_cats_sorted":[],"title_canon_sha256":"8ea9bcbb76b15e70711102ef340e60b820c3d66ff94a90c743c47b9f16e3d27a","abstract_canon_sha256":"daf137165c18d85296b81f3aad8c36b2b6596c9652030e1a3ec15ec533b48958"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:56.187013Z","signature_b64":"C4yylKHWEjOLTJrWuWyXvMj23a79Wwxtxnhnq7D6DYaNOUKLeLatxNhAJTEEZVHChjAuy1+/67bVFbh6WwpGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81f030d199680926dff064215011d9c62bc4e83e872158c83c7a6a1b1c593a91","last_reissued_at":"2026-07-05T08:57:56.186514Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:56.186514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Deep Learning for Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jialiang Sun, Kaiyu Yang, Logan Murphy, Qidong Su, Xian Zhang, Xujie Si, Zenan Li, Zhaoyu Li","submitted_at":"2024-04-15T17:07:55Z","abstract_excerpt":"Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning in natural language to rigorous derivations in formal systems. In recent years, the advancement of deep learning, especially the emergence of large language models, has sparked a notable surge of research exploring these techniques to enhance the process of theorem proving. This paper presents a comprehensive survey of deep learning for theorem proving by offering (i) a thorough review of existing approaches across various tasks such as autoformalization, premise selection, proofstep generation, and proof "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.09939","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.09939/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.09939","created_at":"2026-07-05T08:57:56.186558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.09939v3","created_at":"2026-07-05T08:57:56.186558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.09939","created_at":"2026-07-05T08:57:56.186558+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHYDBUMZNAES","created_at":"2026-07-05T08:57:56.186558+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHYDBUMZNAESNX7Q","created_at":"2026-07-05T08:57:56.186558+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHYDBUMZ","created_at":"2026-07-05T08:57:56.186558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07779","citing_title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","ref_index":136,"is_internal_anchor":true},{"citing_arxiv_id":"2606.17981","citing_title":"Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09450","citing_title":"TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28841","citing_title":"LAMP: Lean-based Agentic framework with MCP and Proof Repair","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2511.12253","citing_title":"The Search for Constrained Random Generators","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18436","citing_title":"VeruSAGE: A Study of Agent-Based Verification for Rust Systems","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY","json":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY.json","graph_json":"https://pith.science/api/pith-number/QHYDBUMZNAESNX7QMQQVAEOZYY/graph.json","events_json":"https://pith.science/api/pith-number/QHYDBUMZNAESNX7QMQQVAEOZYY/events.json","paper":"https://pith.science/paper/QHYDBUMZ"},"agent_actions":{"view_html":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY","download_json":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY.json","view_paper":"https://pith.science/paper/QHYDBUMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.09939&json=true","fetch_graph":"https://pith.science/api/pith-number/QHYDBUMZNAESNX7QMQQVAEOZYY/graph.json","fetch_events":"https://pith.science/api/pith-number/QHYDBUMZNAESNX7QMQQVAEOZYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY/action/storage_attestation","attest_author":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY/action/author_attestation","sign_citation":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY/action/citation_signature","submit_replication":"https://pith.science/pith/QHYDBUMZNAESNX7QMQQVAEOZYY/action/replication_record"}},"created_at":"2026-07-05T08:57:56.186558+00:00","updated_at":"2026-07-05T08:57:56.186558+00:00"}