{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KFDAOWDU53J557UWX2OP3UMOJE","short_pith_number":"pith:KFDAOWDU","canonical_record":{"source":{"id":"1106.2352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-12T22:22:07Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"2dff00f27023ab879006068d12e12916f534703126bda962a10ec97a4d5f574f","abstract_canon_sha256":"1da3837432a13be3333c243a4c3a902fde696b66853a3fb52d5d7fb96907f38e"},"schema_version":"1.0"},"canonical_sha256":"5146075874eed3defe96be9cfdd18e4915864bd1ecbf892a5a60321c728726ae","source":{"kind":"arxiv","id":"1106.2352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2352","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2352v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2352","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"KFDAOWDU53J5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KFDAOWDU53J557UW","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KFDAOWDU","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KFDAOWDU53J557UWX2OP3UMOJE","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-12T22:22:07Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"2dff00f27023ab879006068d12e12916f534703126bda962a10ec97a4d5f574f","abstract_canon_sha256":"1da3837432a13be3333c243a4c3a902fde696b66853a3fb52d5d7fb96907f38e"},"schema_version":"1.0"},"canonical_sha256":"5146075874eed3defe96be9cfdd18e4915864bd1ecbf892a5a60321c728726ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:42.809595Z","signature_b64":"5/FNGVsta3wK60qaj6Jm3GcxnjZoh1Jr6/NaTm3gLJcbC8DDGH1DzrKjtWbIPQcDIBlLzaqhc5h/+agqMuqhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5146075874eed3defe96be9cfdd18e4915864bd1ecbf892a5a60321c728726ae","last_reissued_at":"2026-05-18T04:19:42.808889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:42.808889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2352","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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcb1UzMylX10mcDK6pNF14O1vNVWJC2nxdLVGcdn3OzEE27ZhXS3EHDPyBmFiPCMQw7f1R/WZamBZgokg+3DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:09:22.214793Z"},"content_sha256":"92156517046f177818b0daf955db53d8026e7b38ba46a62b8e9c791ab86e7198","schema_version":"1.0","event_id":"sha256:92156517046f177818b0daf955db53d8026e7b38ba46a62b8e9c791ab86e7198"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KFDAOWDU53J557UWX2OP3UMOJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cognitive Binary Logic - The Natural Unified Formal Theory of Propositional Binary Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Luminita State, Nicolaie Popescu-Bodorin","submitted_at":"2011-06-12T22:22:07Z","abstract_excerpt":"This paper presents a formal theory which describes propositional binary logic as a semantically closed formal language, and allows for syntactically and semantically well-formed formulae, formal proofs (demonstrability in Hilbertian acception), deduction (Gentzen's view of demonstrability), CNF-ization, and deconstruction to be expressed and tested in the same (computational) formal language, using the same data structure. It is also shown here that Cognitive Binary Logic is a self-described theory in which the Liar Paradox is deconstructed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2352","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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIKu1hOa1K4hwqK4aEgyz/DHP7/9ZDLbPJQHp9k5TByJUqE+47hu7ci2lgwjxRkiro4r7TImdA4ooAsLoqb8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:09:22.215146Z"},"content_sha256":"fd75765a92de84a64e7b8824f3b873e5fe4a3c38440ecb523039d30efa3c199a","schema_version":"1.0","event_id":"sha256:fd75765a92de84a64e7b8824f3b873e5fe4a3c38440ecb523039d30efa3c199a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFDAOWDU53J557UWX2OP3UMOJE/bundle.json","state_url":"https://pith.science/pith/KFDAOWDU53J557UWX2OP3UMOJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFDAOWDU53J557UWX2OP3UMOJE/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-22T23:09:22Z","links":{"resolver":"https://pith.science/pith/KFDAOWDU53J557UWX2OP3UMOJE","bundle":"https://pith.science/pith/KFDAOWDU53J557UWX2OP3UMOJE/bundle.json","state":"https://pith.science/pith/KFDAOWDU53J557UWX2OP3UMOJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFDAOWDU53J557UWX2OP3UMOJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KFDAOWDU53J557UWX2OP3UMOJE","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":"1da3837432a13be3333c243a4c3a902fde696b66853a3fb52d5d7fb96907f38e","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-12T22:22:07Z","title_canon_sha256":"2dff00f27023ab879006068d12e12916f534703126bda962a10ec97a4d5f574f"},"schema_version":"1.0","source":{"id":"1106.2352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2352","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2352v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2352","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"KFDAOWDU53J5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KFDAOWDU53J557UW","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KFDAOWDU","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:fd75765a92de84a64e7b8824f3b873e5fe4a3c38440ecb523039d30efa3c199a","target":"graph","created_at":"2026-05-18T04:19:42Z","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":"This paper presents a formal theory which describes propositional binary logic as a semantically closed formal language, and allows for syntactically and semantically well-formed formulae, formal proofs (demonstrability in Hilbertian acception), deduction (Gentzen's view of demonstrability), CNF-ization, and deconstruction to be expressed and tested in the same (computational) formal language, using the same data structure. It is also shown here that Cognitive Binary Logic is a self-described theory in which the Liar Paradox is deconstructed.","authors_text":"Luminita State, Nicolaie Popescu-Bodorin","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-12T22:22:07Z","title":"Cognitive Binary Logic - The Natural Unified Formal Theory of Propositional Binary Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2352","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:92156517046f177818b0daf955db53d8026e7b38ba46a62b8e9c791ab86e7198","target":"record","created_at":"2026-05-18T04:19:42Z","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":"1da3837432a13be3333c243a4c3a902fde696b66853a3fb52d5d7fb96907f38e","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-12T22:22:07Z","title_canon_sha256":"2dff00f27023ab879006068d12e12916f534703126bda962a10ec97a4d5f574f"},"schema_version":"1.0","source":{"id":"1106.2352","kind":"arxiv","version":1}},"canonical_sha256":"5146075874eed3defe96be9cfdd18e4915864bd1ecbf892a5a60321c728726ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5146075874eed3defe96be9cfdd18e4915864bd1ecbf892a5a60321c728726ae","first_computed_at":"2026-05-18T04:19:42.808889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:42.808889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/FNGVsta3wK60qaj6Jm3GcxnjZoh1Jr6/NaTm3gLJcbC8DDGH1DzrKjtWbIPQcDIBlLzaqhc5h/+agqMuqhBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:42.809595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92156517046f177818b0daf955db53d8026e7b38ba46a62b8e9c791ab86e7198","sha256:fd75765a92de84a64e7b8824f3b873e5fe4a3c38440ecb523039d30efa3c199a"],"state_sha256":"b96f011b82ddd12153e316dff16e0a4f0c256c5f5c289384200fa24a90d6adec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ln7QiCbbigP64v8MGWKNLX1ReZC7mTzA6su7zIO3046hfgXzglKOb2lw3MQ7Gk2OZcx5VHRHwsPMTG3z4JT+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:09:22.217146Z","bundle_sha256":"601a2a48b9b5ae3ea80a8e4d17c4c75934bf97ba50c075238aa4e626810424a3"}}