{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:YOH2H5HVDU5KR3ZCCAC3XLEMLG","short_pith_number":"pith:YOH2H5HV","canonical_record":{"source":{"id":"0906.2154","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-11T16:34:51Z","cross_cats_sorted":["cs.AI","cs.CC","math.LO"],"title_canon_sha256":"0a2d19fec2d956110636e1beb22f1136314efbfbad7e3d676954d446ec2a0f8a","abstract_canon_sha256":"1743981b2307f2c83b3e06167a9edbb2aebf7c0d2f8a881bc379f2c10f0f540b"},"schema_version":"1.0"},"canonical_sha256":"c38fa3f4f51d3aa8ef221005bbac8c59a40ac676df59001631140f3c9ee96e25","source":{"kind":"arxiv","id":"0906.2154","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2154","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2154v7","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2154","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"YOH2H5HVDU5K","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"YOH2H5HVDU5KR3ZC","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"YOH2H5HV","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:YOH2H5HVDU5KR3ZCCAC3XLEMLG","target":"record","payload":{"canonical_record":{"source":{"id":"0906.2154","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-11T16:34:51Z","cross_cats_sorted":["cs.AI","cs.CC","math.LO"],"title_canon_sha256":"0a2d19fec2d956110636e1beb22f1136314efbfbad7e3d676954d446ec2a0f8a","abstract_canon_sha256":"1743981b2307f2c83b3e06167a9edbb2aebf7c0d2f8a881bc379f2c10f0f540b"},"schema_version":"1.0"},"canonical_sha256":"c38fa3f4f51d3aa8ef221005bbac8c59a40ac676df59001631140f3c9ee96e25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.357718Z","signature_b64":"/ecVX/GAbL+utxq7OZ+Lh7ULrkWklB81I//QGqmh363u+U7JWShjDHOr8/IxRoD8qtoNFPlutzweDpIxZfo+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c38fa3f4f51d3aa8ef221005bbac8c59a40ac676df59001631140f3c9ee96e25","last_reissued_at":"2026-05-18T01:37:40.356977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.356977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.2154","source_version":7,"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-18T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkXzryDXz/kE3PGuUzpwaG2pQwSE95QgAKmVhuOoR3WlGpLCcu5+IlPfaqn2QvpiinJX/ovlvSRjQVRYSQNkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:47:48.491173Z"},"content_sha256":"44396a5960dc36b89207d3e620cc2a83ba8c93e919952f273e7bb0bed8bd3720","schema_version":"1.0","event_id":"sha256:44396a5960dc36b89207d3e620cc2a83ba8c93e919952f273e7bb0bed8bd3720"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:YOH2H5HVDU5KR3ZCCAC3XLEMLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From formulas to cirquents in computability logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Department of Co), Giorgi Japaridze (School of Computer Science, Shandong University, Technology","submitted_at":"2009-06-11T16:34:51Z","abstract_excerpt":"Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Its expressions represent interactive computational tasks seen as games played by a machine against the environment, and \"truth\" is understood as existence of an algorithmic winning strategy. With logical operators standing for operations on games, the formalism of CoL is open-ended, and has already undergone series o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2154","kind":"arxiv","version":7},"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-18T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhLv0pA+1K3B/tHEbGwX3GfCijGZaRiw+x6XrnF20PZ9izygnUfmbZqozyY+iZ+AFQgQXtnexj2JFdSOjpkwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:47:48.491569Z"},"content_sha256":"4f760a12d3952567d6b26b254f43de7f00b18aaa4b3cbbbbaaf4c5ba298965d4","schema_version":"1.0","event_id":"sha256:4f760a12d3952567d6b26b254f43de7f00b18aaa4b3cbbbbaaf4c5ba298965d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/bundle.json","state_url":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/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-05T20:47:48Z","links":{"resolver":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG","bundle":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/bundle.json","state":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:YOH2H5HVDU5KR3ZCCAC3XLEMLG","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":"1743981b2307f2c83b3e06167a9edbb2aebf7c0d2f8a881bc379f2c10f0f540b","cross_cats_sorted":["cs.AI","cs.CC","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-11T16:34:51Z","title_canon_sha256":"0a2d19fec2d956110636e1beb22f1136314efbfbad7e3d676954d446ec2a0f8a"},"schema_version":"1.0","source":{"id":"0906.2154","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2154","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2154v7","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2154","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"YOH2H5HVDU5K","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"YOH2H5HVDU5KR3ZC","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"YOH2H5HV","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:4f760a12d3952567d6b26b254f43de7f00b18aaa4b3cbbbbaaf4c5ba298965d4","target":"graph","created_at":"2026-05-18T01:37:40Z","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) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Its expressions represent interactive computational tasks seen as games played by a machine against the environment, and \"truth\" is understood as existence of an algorithmic winning strategy. With logical operators standing for operations on games, the formalism of CoL is open-ended, and has already undergone series o","authors_text":"Department of Co), Giorgi Japaridze (School of Computer Science, Shandong University, Technology","cross_cats":["cs.AI","cs.CC","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-11T16:34:51Z","title":"From formulas to cirquents in computability logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2154","kind":"arxiv","version":7},"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:44396a5960dc36b89207d3e620cc2a83ba8c93e919952f273e7bb0bed8bd3720","target":"record","created_at":"2026-05-18T01:37:40Z","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":"1743981b2307f2c83b3e06167a9edbb2aebf7c0d2f8a881bc379f2c10f0f540b","cross_cats_sorted":["cs.AI","cs.CC","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-11T16:34:51Z","title_canon_sha256":"0a2d19fec2d956110636e1beb22f1136314efbfbad7e3d676954d446ec2a0f8a"},"schema_version":"1.0","source":{"id":"0906.2154","kind":"arxiv","version":7}},"canonical_sha256":"c38fa3f4f51d3aa8ef221005bbac8c59a40ac676df59001631140f3c9ee96e25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c38fa3f4f51d3aa8ef221005bbac8c59a40ac676df59001631140f3c9ee96e25","first_computed_at":"2026-05-18T01:37:40.356977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:40.356977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ecVX/GAbL+utxq7OZ+Lh7ULrkWklB81I//QGqmh363u+U7JWShjDHOr8/IxRoD8qtoNFPlutzweDpIxZfo+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:40.357718Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.2154","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44396a5960dc36b89207d3e620cc2a83ba8c93e919952f273e7bb0bed8bd3720","sha256:4f760a12d3952567d6b26b254f43de7f00b18aaa4b3cbbbbaaf4c5ba298965d4"],"state_sha256":"e09bc93df8be9da0e6071af46f38cf03137a5b9c345dbc7e8d1ef07adf0c3908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5vajRPklTX0EdWHqZGcdDP629Yxb+wRV9wv7S9Rt4n0fykJ2dPFopUin9/vIe2xoeMf4SYW0x6CP3ORWydITBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:47:48.494306Z","bundle_sha256":"0af3f52b5726f45af913aef8e0ccbea7950b08e8f21ff6491aa8642c2a2e1c3a"}}