{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W44M6C5A6QUAO54UXCIYSLHXDD","short_pith_number":"pith:W44M6C5A","canonical_record":{"source":{"id":"1412.0320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T01:10:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6fefb44b416cb5a46572dcb814853cad657474a1e7a6e96c0017073841bddb82","abstract_canon_sha256":"ef57288c427955821eeacd39f8cbf1c2e313a07f947529a4ad7dbdd74bc3f063"},"schema_version":"1.0"},"canonical_sha256":"b738cf0ba0f428077794b891892cf718ec50a5cc985d71e46128418aa9c2f5d9","source":{"kind":"arxiv","id":"1412.0320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0320","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0320v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0320","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"W44M6C5A6QUA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W44M6C5A6QUAO54U","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W44M6C5A","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W44M6C5A6QUAO54UXCIYSLHXDD","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T01:10:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6fefb44b416cb5a46572dcb814853cad657474a1e7a6e96c0017073841bddb82","abstract_canon_sha256":"ef57288c427955821eeacd39f8cbf1c2e313a07f947529a4ad7dbdd74bc3f063"},"schema_version":"1.0"},"canonical_sha256":"b738cf0ba0f428077794b891892cf718ec50a5cc985d71e46128418aa9c2f5d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.411312Z","signature_b64":"3KGOhbinsV4c9XJ2YOfnOT/divJfxumtFfURzvk3IMqrg3OTrlsi/2AykuEKDX6O11lE6xVDFDJ7gXRRupSrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b738cf0ba0f428077794b891892cf718ec50a5cc985d71e46128418aa9c2f5d9","last_reissued_at":"2026-05-18T02:28:47.410877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.410877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0320","source_version":2,"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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDF8IKL5e1zXzCzEmkJeCZiXy2706GeXG4f1+JiF1R5Eh1svO0YRrwgUhjxyozucgKWRmhYSjj0KGdBY86c3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:26:21.749350Z"},"content_sha256":"716ac2001b5649dcd9f6aab37bca1ef31fece9ffd185f6503ecae22d715278bc","schema_version":"1.0","event_id":"sha256:716ac2001b5649dcd9f6aab37bca1ef31fece9ffd185f6503ecae22d715278bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W44M6C5A6QUAO54UXCIYSLHXDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Xishun Zhao, Yuping Shen","submitted_at":"2014-12-01T01:10:30Z","abstract_excerpt":"\\emph{Canonical (logic) programs} (CP) refer to normal logic programs augmented with connective $not\\ not$. In this paper we address the question of whether CP are \\emph{succinctly incomparable} with \\emph{propositional formulas} (PF). Our main result shows that the PARITY problem, which can be polynomially represented in PF but \\emph{only} has exponential representations in CP. In other words, PARITY \\emph{separates} PF from CP. Simply speaking, this means that exponential size blowup is generally inevitable when translating a set of formulas in PF into an equivalent program in CP (without in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0320","kind":"arxiv","version":2},"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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUhCI0d1S73qvs9HBbvNdFUuIBV5soWeCeuD39gfLauvRd8QI7JpipRDB3vNhajvtctiYZ8BDa+jnbKoJvWsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:26:21.749702Z"},"content_sha256":"e37df008e0c6ce5eab040ea8c759058aed71ee2b97b48c51a1433c81202df3be","schema_version":"1.0","event_id":"sha256:e37df008e0c6ce5eab040ea8c759058aed71ee2b97b48c51a1433c81202df3be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/bundle.json","state_url":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W44M6C5A6QUAO54UXCIYSLHXDD/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-07T04:26:21Z","links":{"resolver":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD","bundle":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/bundle.json","state":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W44M6C5A6QUAO54UXCIYSLHXDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W44M6C5A6QUAO54UXCIYSLHXDD","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":"ef57288c427955821eeacd39f8cbf1c2e313a07f947529a4ad7dbdd74bc3f063","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T01:10:30Z","title_canon_sha256":"6fefb44b416cb5a46572dcb814853cad657474a1e7a6e96c0017073841bddb82"},"schema_version":"1.0","source":{"id":"1412.0320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0320","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0320v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0320","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"W44M6C5A6QUA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W44M6C5A6QUAO54U","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W44M6C5A","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:e37df008e0c6ce5eab040ea8c759058aed71ee2b97b48c51a1433c81202df3be","target":"graph","created_at":"2026-05-18T02:28:47Z","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":"\\emph{Canonical (logic) programs} (CP) refer to normal logic programs augmented with connective $not\\ not$. In this paper we address the question of whether CP are \\emph{succinctly incomparable} with \\emph{propositional formulas} (PF). Our main result shows that the PARITY problem, which can be polynomially represented in PF but \\emph{only} has exponential representations in CP. In other words, PARITY \\emph{separates} PF from CP. Simply speaking, this means that exponential size blowup is generally inevitable when translating a set of formulas in PF into an equivalent program in CP (without in","authors_text":"Xishun Zhao, Yuping Shen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T01:10:30Z","title":"Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0320","kind":"arxiv","version":2},"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:716ac2001b5649dcd9f6aab37bca1ef31fece9ffd185f6503ecae22d715278bc","target":"record","created_at":"2026-05-18T02:28:47Z","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":"ef57288c427955821eeacd39f8cbf1c2e313a07f947529a4ad7dbdd74bc3f063","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T01:10:30Z","title_canon_sha256":"6fefb44b416cb5a46572dcb814853cad657474a1e7a6e96c0017073841bddb82"},"schema_version":"1.0","source":{"id":"1412.0320","kind":"arxiv","version":2}},"canonical_sha256":"b738cf0ba0f428077794b891892cf718ec50a5cc985d71e46128418aa9c2f5d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b738cf0ba0f428077794b891892cf718ec50a5cc985d71e46128418aa9c2f5d9","first_computed_at":"2026-05-18T02:28:47.410877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.410877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3KGOhbinsV4c9XJ2YOfnOT/divJfxumtFfURzvk3IMqrg3OTrlsi/2AykuEKDX6O11lE6xVDFDJ7gXRRupSrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.411312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:716ac2001b5649dcd9f6aab37bca1ef31fece9ffd185f6503ecae22d715278bc","sha256:e37df008e0c6ce5eab040ea8c759058aed71ee2b97b48c51a1433c81202df3be"],"state_sha256":"ed332290e23c1aafa691b27467c86e3b128cb51c6d7d6b99ea7adfd6c5586702"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7kOaBaMz5gxQHU57cdxZpBRIHIZpS0RsbbYrVUIPdhQF+lPJ09bkKIYMTrILUBuRTS3y5S6KPNH50ht2NMEVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:26:21.751626Z","bundle_sha256":"0c14606ceca90b7d37b366ee93385da2257b336c816021a3f76bf0ba8ba5af46"}}