{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UFMMEBI6BK3V32LMAHPDDP5HGV","short_pith_number":"pith:UFMMEBI6","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"},"canonical_sha256":"a158c2051e0ab75de96c01de31bfa73578bbd11180abd17644bb29c767053bd4","source":{"kind":"arxiv","id":"2606.01861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01861","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01861v1","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01861","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"UFMMEBI6BK3V","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"pith_short_16","alias_value":"UFMMEBI6BK3V32LM","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"pith_short_8","alias_value":"UFMMEBI6","created_at":"2026-06-02T02:04:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UFMMEBI6BK3V32LMAHPDDP5HGV","target":"record","payload":{"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"},"canonical_sha256":"a158c2051e0ab75de96c01de31bfa73578bbd11180abd17644bb29c767053bd4","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"},"source_kind":"arxiv","source_id":"2606.01861","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fM5YdlZXvj3uWbmIgOt+gN82UZb4t1LJpY9mnNpJ6j6whJ8e1X3VP2azalz9b51B9u+hicJWohw/vLUJ8ffgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:27:27.019072Z"},"content_sha256":"f354aa8edfefe277b0e3f63e1bc9bcaebcaf7250cf74400bad2ede46ddd04d39","schema_version":"1.0","event_id":"sha256:f354aa8edfefe277b0e3f63e1bc9bcaebcaf7250cf74400bad2ede46ddd04d39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UFMMEBI6BK3V32LMAHPDDP5HGV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AB7KVHkKruGapDXs2IAvkbn/MYZhrpvjSLs5CfYqT3YexHKR7leHlaVn8UTiHVQsbthxaD6Vi1X9PWTXfxZdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:27:27.019497Z"},"content_sha256":"ecd21a4a29d4928b027850bd3f57dd160d95ac92122850a7787243f82b70f095","schema_version":"1.0","event_id":"sha256:ecd21a4a29d4928b027850bd3f57dd160d95ac92122850a7787243f82b70f095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/bundle.json","state_url":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T10:27:27Z","links":{"resolver":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV","bundle":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/bundle.json","state":"https://pith.science/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFMMEBI6BK3V32LMAHPDDP5HGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UFMMEBI6BK3V32LMAHPDDP5HGV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f523316692c74841df8cb3cc0311faedf4f2b48c979edc133222873d99ea1b1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T08:12:47Z","title_canon_sha256":"95a9c1513690468a652f9dc8d2bc70a90bf58617479499628064fec87f17a666"},"schema_version":"1.0","source":{"id":"2606.01861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01861","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01861v1","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01861","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"UFMMEBI6BK3V","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"pith_short_16","alias_value":"UFMMEBI6BK3V32LM","created_at":"2026-06-02T02:04:58Z"},{"alias_kind":"pith_short_8","alias_value":"UFMMEBI6","created_at":"2026-06-02T02:04:58Z"}],"graph_snapshots":[{"event_id":"sha256:ecd21a4a29d4928b027850bd3f57dd160d95ac92122850a7787243f82b70f095","target":"graph","created_at":"2026-06-02T02:04:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.01861/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Thomas Chen, Zhiyuan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T08:12:47Z","title":"A Theoretical Framework for Self-Play Theorem Proving Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01861","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f354aa8edfefe277b0e3f63e1bc9bcaebcaf7250cf74400bad2ede46ddd04d39","target":"record","created_at":"2026-06-02T02:04:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f523316692c74841df8cb3cc0311faedf4f2b48c979edc133222873d99ea1b1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T08:12:47Z","title_canon_sha256":"95a9c1513690468a652f9dc8d2bc70a90bf58617479499628064fec87f17a666"},"schema_version":"1.0","source":{"id":"2606.01861","kind":"arxiv","version":1}},"canonical_sha256":"a158c2051e0ab75de96c01de31bfa73578bbd11180abd17644bb29c767053bd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a158c2051e0ab75de96c01de31bfa73578bbd11180abd17644bb29c767053bd4","first_computed_at":"2026-06-02T02:04:58.910910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:58.910910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rpwv7V+CR1xn6Z8cHEYJSXk0lf7+ts0rAMxu7mkrJn47Qdxy37odi3jW8gsxwX3DfyLbyM5uB54Lyue60YzsCQ==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:58.911262Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f354aa8edfefe277b0e3f63e1bc9bcaebcaf7250cf74400bad2ede46ddd04d39","sha256:ecd21a4a29d4928b027850bd3f57dd160d95ac92122850a7787243f82b70f095"],"state_sha256":"aa8488a4049d311cdccdde6b1fa6ec49930e5418922574f601e68e32095bfdc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ytw9LJ7C8YLe+RMZRNCzc3iyLKq51e+QX4etFuFTFgwwDBnjLyNJHr/Mj5fGOHP9QPsrMG7SDi1rwQFRxdrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:27:27.021680Z","bundle_sha256":"af35e0e2a1360826bfd9c21c73307a60480de0b36bbc5ca0e8749c4c7a9ab05a"}}