{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5GBRTQKYKIK3I44SMNF6DGORZN","short_pith_number":"pith:5GBRTQKY","schema_version":"1.0","canonical_sha256":"e98319c1585215b47392634be199d1cb5ebde3a56212666bc22a6bcddd45abd6","source":{"kind":"arxiv","id":"2202.01344","version":1},"attestation_state":"computed","paper":{"title":"Formal Mathematics Statement Curriculum Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Igor Babuschkin, Ilya Sutskever, Jesse Michael Han, Kunhao Zheng, Mantas Baksys, Stanislas Polu","submitted_at":"2022-02-03T00:17:00Z","abstract_excerpt":"We explore the use of expert iteration in the context of language modeling applied to formal mathematics. We show that at same compute budget, expert iteration, by which we mean proof search interleaved with learning, dramatically outperforms proof search only. We also observe that when applied to a collection of formal statements of sufficiently varied difficulty, expert iteration is capable of finding and solving a curriculum of increasingly difficult problems, without the need for associated ground-truth proofs. Finally, by applying this expert iteration to a manually curated set of problem"},"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":"2202.01344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-03T00:17:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7e3c99bd70f2b2bd4b224ddc12c529b17dffd62f2f5807ad55381b8ea8453901","abstract_canon_sha256":"c7dcaadf7ae61a4651bf7342e330a04251715ba77dc73c0dc524e39659da4be5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:53.205428Z","signature_b64":"WJS5+TIz0pxLrvDQdNV4P5YfRpYNAUXA7mCrRSHi/snS7XFb7gEE1Zsacxl9jj3eO/FTdSBd6gtj+pp8HPEgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e98319c1585215b47392634be199d1cb5ebde3a56212666bc22a6bcddd45abd6","last_reissued_at":"2026-07-05T03:53:53.204909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:53.204909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Mathematics Statement Curriculum Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Igor Babuschkin, Ilya Sutskever, Jesse Michael Han, Kunhao Zheng, Mantas Baksys, Stanislas Polu","submitted_at":"2022-02-03T00:17:00Z","abstract_excerpt":"We explore the use of expert iteration in the context of language modeling applied to formal mathematics. We show that at same compute budget, expert iteration, by which we mean proof search interleaved with learning, dramatically outperforms proof search only. We also observe that when applied to a collection of formal statements of sufficiently varied difficulty, expert iteration is capable of finding and solving a curriculum of increasingly difficult problems, without the need for associated ground-truth proofs. Finally, by applying this expert iteration to a manually curated set of problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.01344","kind":"arxiv","version":1},"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/2202.01344/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":"2202.01344","created_at":"2026-07-05T03:53:53.204974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.01344v1","created_at":"2026-07-05T03:53:53.204974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.01344","created_at":"2026-07-05T03:53:53.204974+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GBRTQKYKIK3","created_at":"2026-07-05T03:53:53.204974+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GBRTQKYKIK3I44S","created_at":"2026-07-05T03:53:53.204974+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GBRTQKY","created_at":"2026-07-05T03:53:53.204974+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19315","citing_title":"Diffusion-Proof: Recipe for Formal Theorem Proving Beyond Auto-Regressive Generation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28572","citing_title":"Geometric Measurements of the Axiom of Choice in Neural Proof Embeddings","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28841","citing_title":"LAMP: Lean-based Agentic framework with MCP and Proof Repair","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27485","citing_title":"Automating Formal Verification with Agent-Guided Tree Search","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29955","citing_title":"Formalizing Mathematics at Scale","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30914","citing_title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17283","citing_title":"OProver: A Unified Framework for Agentic Formal Theorem Proving","ref_index":129,"is_internal_anchor":false},{"citing_arxiv_id":"2310.10631","citing_title":"Llemma: An Open Language Model For Mathematics","ref_index":172,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12809","citing_title":"Correcting Influence: Unboxing LLM Outputs with Orthogonal Latent Spaces","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16421","citing_title":"Measuring Representation Robustness in Large Language Models for Geometry","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11905","citing_title":"Rethinking Supervision Granularity: Segment-Level Learning for LLM-Based Theorem Proving","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06401","citing_title":"ProofSketcher: Hybrid LLM + Lightweight Proof Checker for Reliable Math/Logic Reasoning","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2303.03378","citing_title":"PaLM-E: An Embodied Multimodal Language Model","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN","json":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN.json","graph_json":"https://pith.science/api/pith-number/5GBRTQKYKIK3I44SMNF6DGORZN/graph.json","events_json":"https://pith.science/api/pith-number/5GBRTQKYKIK3I44SMNF6DGORZN/events.json","paper":"https://pith.science/paper/5GBRTQKY"},"agent_actions":{"view_html":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN","download_json":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN.json","view_paper":"https://pith.science/paper/5GBRTQKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.01344&json=true","fetch_graph":"https://pith.science/api/pith-number/5GBRTQKYKIK3I44SMNF6DGORZN/graph.json","fetch_events":"https://pith.science/api/pith-number/5GBRTQKYKIK3I44SMNF6DGORZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN/action/storage_attestation","attest_author":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN/action/author_attestation","sign_citation":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN/action/citation_signature","submit_replication":"https://pith.science/pith/5GBRTQKYKIK3I44SMNF6DGORZN/action/replication_record"}},"created_at":"2026-07-05T03:53:53.204974+00:00","updated_at":"2026-07-05T03:53:53.204974+00:00"}