{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UFMMEBI6BK3V32LMAHPDDP5HGV","short_pith_number":"pith:UFMMEBI6","schema_version":"1.0","canonical_sha256":"a158c2051e0ab75de96c01de31bfa73578bbd11180abd17644bb29c767053bd4","source":{"kind":"arxiv","id":"2606.01861","version":1},"attestation_state":"computed","paper":{"title":"A Theoretical Framework for Self-Play Theorem Proving Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Thomas Chen, Zhiyuan Li","submitted_at":"2026-06-01T08:12:47Z","abstract_excerpt":"Self-play, a type of training algorithm that enables a model to self-improve, has recently shown promising empirical results in the context of formal theorem proving using Large Language Models (LLMs). (Dong & Ma, 2025) instantiate self-play with two cooperating agents: a prover, which proves theorems, and a conjecturer, which generates new theorems as a curriculum to the prover. In this paper, we provide a theoretical framework for understanding the self-improvement capabilities of self-play algorithms for theorem proving. First, we formalize the set of theorems as a graph, with nodes as theo"},"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":"2606.01861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T08:12:47Z","cross_cats_sorted":[],"title_canon_sha256":"95a9c1513690468a652f9dc8d2bc70a90bf58617479499628064fec87f17a666","abstract_canon_sha256":"f523316692c74841df8cb3cc0311faedf4f2b48c979edc133222873d99ea1b1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:58.911262Z","signature_b64":"rpwv7V+CR1xn6Z8cHEYJSXk0lf7+ts0rAMxu7mkrJn47Qdxy37odi3jW8gsxwX3DfyLbyM5uB54Lyue60YzsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a158c2051e0ab75de96c01de31bfa73578bbd11180abd17644bb29c767053bd4","last_reissued_at":"2026-06-02T02:04:58.910910Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:58.910910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theoretical Framework for Self-Play Theorem Proving Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Thomas Chen, Zhiyuan Li","submitted_at":"2026-06-01T08:12:47Z","abstract_excerpt":"Self-play, a type of training algorithm that enables a model to self-improve, has recently shown promising empirical results in the context of formal theorem proving using Large Language Models (LLMs). (Dong & Ma, 2025) instantiate self-play with two cooperating agents: a prover, which proves theorems, and a conjecturer, which generates new theorems as a curriculum to the prover. In this paper, we provide a theoretical framework for understanding the self-improvement capabilities of self-play algorithms for theorem proving. First, we formalize the set of theorems as a graph, with nodes as theo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01861","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/2606.01861/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":"2606.01861","created_at":"2026-06-02T02:04:58.910974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01861v1","created_at":"2026-06-02T02:04:58.910974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01861","created_at":"2026-06-02T02:04:58.910974+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFMMEBI6BK3V","created_at":"2026-06-02T02:04:58.910974+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFMMEBI6BK3V32LM","created_at":"2026-06-02T02:04:58.910974+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFMMEBI6","created_at":"2026-06-02T02:04:58.910974+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV","json":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV.json","graph_json":"https://pith.science/api/pith-number/UFMMEBI6BK3V32LMAHPDDP5HGV/graph.json","events_json":"https://pith.science/api/pith-number/UFMMEBI6BK3V32LMAHPDDP5HGV/events.json","paper":"https://pith.science/paper/UFMMEBI6"},"agent_actions":{"view_html":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV","download_json":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV.json","view_paper":"https://pith.science/paper/UFMMEBI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01861&json=true","fetch_graph":"https://pith.science/api/pith-number/UFMMEBI6BK3V32LMAHPDDP5HGV/graph.json","fetch_events":"https://pith.science/api/pith-number/UFMMEBI6BK3V32LMAHPDDP5HGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/action/storage_attestation","attest_author":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/action/author_attestation","sign_citation":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/action/citation_signature","submit_replication":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/action/replication_record"}},"created_at":"2026-06-02T02:04:58.910974+00:00","updated_at":"2026-06-02T02:04:58.910974+00:00"}