{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YOH2H5HVDU5KR3ZCCAC3XLEMLG","short_pith_number":"pith:YOH2H5HV","schema_version":"1.0","canonical_sha256":"c38fa3f4f51d3aa8ef221005bbac8c59a40ac676df59001631140f3c9ee96e25","source":{"kind":"arxiv","id":"0906.2154","version":7},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0906.2154","created_at":"2026-05-18T01:37:40.357095+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.2154v7","created_at":"2026-05-18T01:37:40.357095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2154","created_at":"2026-05-18T01:37:40.357095+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOH2H5HVDU5K","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOH2H5HVDU5KR3ZC","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOH2H5HV","created_at":"2026-05-18T12:26:02.257875+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/YOH2H5HVDU5KR3ZCCAC3XLEMLG","json":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG.json","graph_json":"https://pith.science/api/pith-number/YOH2H5HVDU5KR3ZCCAC3XLEMLG/graph.json","events_json":"https://pith.science/api/pith-number/YOH2H5HVDU5KR3ZCCAC3XLEMLG/events.json","paper":"https://pith.science/paper/YOH2H5HV"},"agent_actions":{"view_html":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG","download_json":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG.json","view_paper":"https://pith.science/paper/YOH2H5HV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.2154&json=true","fetch_graph":"https://pith.science/api/pith-number/YOH2H5HVDU5KR3ZCCAC3XLEMLG/graph.json","fetch_events":"https://pith.science/api/pith-number/YOH2H5HVDU5KR3ZCCAC3XLEMLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/action/storage_attestation","attest_author":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/action/author_attestation","sign_citation":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/action/citation_signature","submit_replication":"https://pith.science/pith/YOH2H5HVDU5KR3ZCCAC3XLEMLG/action/replication_record"}},"created_at":"2026-05-18T01:37:40.357095+00:00","updated_at":"2026-05-18T01:37:40.357095+00:00"}