{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VWW57ANGPGHOUJVVRRHRF2BZUB","short_pith_number":"pith:VWW57ANG","canonical_record":{"source":{"id":"1311.6542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-26T02:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"7a459701fa3dc8c5c58f1aeaaf44e7316ce3f55489b50f307f191d2df57a212b","abstract_canon_sha256":"b7e2fca9a7e33ae0a4ea8e0ebdbb0a5fadb8d4a7dbc9cbe8a247349d18f690fa"},"schema_version":"1.0"},"canonical_sha256":"adaddf81a6798eea26b58c4f12e839a075651cbe04f0be491ab72e3007beed0c","source":{"kind":"arxiv","id":"1311.6542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6542","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6542v1","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6542","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"VWW57ANGPGHO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VWW57ANGPGHOUJVV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VWW57ANG","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VWW57ANGPGHOUJVVRRHRF2BZUB","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-26T02:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"7a459701fa3dc8c5c58f1aeaaf44e7316ce3f55489b50f307f191d2df57a212b","abstract_canon_sha256":"b7e2fca9a7e33ae0a4ea8e0ebdbb0a5fadb8d4a7dbc9cbe8a247349d18f690fa"},"schema_version":"1.0"},"canonical_sha256":"adaddf81a6798eea26b58c4f12e839a075651cbe04f0be491ab72e3007beed0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:12.408414Z","signature_b64":"ZHZgZvYfu2LgYDVHxrg8E5H9b0fwB5ZAOAUmg+NMDSxel2b6QyVqdDhaPLlIa2XLJ9qajxKPaDzT5cL8JlnxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adaddf81a6798eea26b58c4f12e839a075651cbe04f0be491ab72e3007beed0c","last_reissued_at":"2026-05-18T03:06:12.407722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:12.407722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6542","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-05-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDrIaVEV+k+1R0Iwh5uxUt5SKSSfrhMm6uT0X5rD0ITY9jf2nuVT1VgaG0yezFQuhQuDsJ+VX1b8QfQevX28Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:06:02.092927Z"},"content_sha256":"f35cdb597c691acbc00af36e8c38ad0f1fed72f8080632f6235a936b5b624ebd","schema_version":"1.0","event_id":"sha256:f35cdb597c691acbc00af36e8c38ad0f1fed72f8080632f6235a936b5b624ebd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VWW57ANGPGHOUJVVRRHRF2BZUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementing program extraction from CL1-proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daming Zhu, Junfeng Luan, Ke Chen, Meixia Qu","submitted_at":"2013-11-26T02:09:41Z","abstract_excerpt":"Computability logic (CoL) is a formal theory of interactive computation. It understands computational problems as games played by two players: a machine and its environment, uses logical formalism to describe valid principles of computability and formulas to represent computational problems. Logic CL1 is a deductive system for a fragment of CoL. The logical vocabulary contains all of the operators of classical logic and choice operators, the atoms represent elementary games i.e. predicates of classical logic. In this paper, we present a program that takes a CL1-proof of an arbitrary formula $F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6542","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":""},"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-05-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PBjNKGW8uM/v1c06kWaa9rLs0nRHX+bsf6tTXukegK5DCwSAtSrw7JE1Ylva3nGWY9/KncamsV02eFyScv7UAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:06:02.093427Z"},"content_sha256":"9e1c5d9442bbae3a6869f99aaa2aecf9c97513c2a0568536082c09da56204649","schema_version":"1.0","event_id":"sha256:9e1c5d9442bbae3a6869f99aaa2aecf9c97513c2a0568536082c09da56204649"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWW57ANGPGHOUJVVRRHRF2BZUB/bundle.json","state_url":"https://pith.science/pith/VWW57ANGPGHOUJVVRRHRF2BZUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWW57ANGPGHOUJVVRRHRF2BZUB/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-05-26T23:06:02Z","links":{"resolver":"https://pith.science/pith/VWW57ANGPGHOUJVVRRHRF2BZUB","bundle":"https://pith.science/pith/VWW57ANGPGHOUJVVRRHRF2BZUB/bundle.json","state":"https://pith.science/pith/VWW57ANGPGHOUJVVRRHRF2BZUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWW57ANGPGHOUJVVRRHRF2BZUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VWW57ANGPGHOUJVVRRHRF2BZUB","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":"b7e2fca9a7e33ae0a4ea8e0ebdbb0a5fadb8d4a7dbc9cbe8a247349d18f690fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-26T02:09:41Z","title_canon_sha256":"7a459701fa3dc8c5c58f1aeaaf44e7316ce3f55489b50f307f191d2df57a212b"},"schema_version":"1.0","source":{"id":"1311.6542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6542","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6542v1","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6542","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"VWW57ANGPGHO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VWW57ANGPGHOUJVV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VWW57ANG","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:9e1c5d9442bbae3a6869f99aaa2aecf9c97513c2a0568536082c09da56204649","target":"graph","created_at":"2026-05-18T03:06:12Z","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"},"paper":{"abstract_excerpt":"Computability logic (CoL) is a formal theory of interactive computation. It understands computational problems as games played by two players: a machine and its environment, uses logical formalism to describe valid principles of computability and formulas to represent computational problems. Logic CL1 is a deductive system for a fragment of CoL. The logical vocabulary contains all of the operators of classical logic and choice operators, the atoms represent elementary games i.e. predicates of classical logic. In this paper, we present a program that takes a CL1-proof of an arbitrary formula $F","authors_text":"Daming Zhu, Junfeng Luan, Ke Chen, Meixia Qu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-26T02:09:41Z","title":"Implementing program extraction from CL1-proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6542","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:f35cdb597c691acbc00af36e8c38ad0f1fed72f8080632f6235a936b5b624ebd","target":"record","created_at":"2026-05-18T03:06:12Z","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":"b7e2fca9a7e33ae0a4ea8e0ebdbb0a5fadb8d4a7dbc9cbe8a247349d18f690fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-26T02:09:41Z","title_canon_sha256":"7a459701fa3dc8c5c58f1aeaaf44e7316ce3f55489b50f307f191d2df57a212b"},"schema_version":"1.0","source":{"id":"1311.6542","kind":"arxiv","version":1}},"canonical_sha256":"adaddf81a6798eea26b58c4f12e839a075651cbe04f0be491ab72e3007beed0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adaddf81a6798eea26b58c4f12e839a075651cbe04f0be491ab72e3007beed0c","first_computed_at":"2026-05-18T03:06:12.407722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:12.407722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZHZgZvYfu2LgYDVHxrg8E5H9b0fwB5ZAOAUmg+NMDSxel2b6QyVqdDhaPLlIa2XLJ9qajxKPaDzT5cL8JlnxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:12.408414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f35cdb597c691acbc00af36e8c38ad0f1fed72f8080632f6235a936b5b624ebd","sha256:9e1c5d9442bbae3a6869f99aaa2aecf9c97513c2a0568536082c09da56204649"],"state_sha256":"2c98aa2ccff9d0811afabd441d4d25bbd61df057bab17d3bb38a9346db6c2f37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXJS/ELFV+EjlkyWoaidjPid7RLKExxEoyxyaUwYf3Xg538vQ5+e+e0fLpvVExgKESJztYbB7dThO5VGiN8ZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:06:02.096957Z","bundle_sha256":"9398ce0d0f61b7db6b0432590c1525492d850033697407ea369a805aca2f95e5"}}