{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W44M6C5A6QUAO54UXCIYSLHXDD","short_pith_number":"pith:W44M6C5A","schema_version":"1.0","canonical_sha256":"b738cf0ba0f428077794b891892cf718ec50a5cc985d71e46128418aa9c2f5d9","source":{"kind":"arxiv","id":"1412.0320","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.0320","created_at":"2026-05-18T02:28:47.410960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0320v2","created_at":"2026-05-18T02:28:47.410960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0320","created_at":"2026-05-18T02:28:47.410960+00:00"},{"alias_kind":"pith_short_12","alias_value":"W44M6C5A6QUA","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W44M6C5A6QUAO54U","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W44M6C5A","created_at":"2026-05-18T12:28:54.890064+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/W44M6C5A6QUAO54UXCIYSLHXDD","json":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD.json","graph_json":"https://pith.science/api/pith-number/W44M6C5A6QUAO54UXCIYSLHXDD/graph.json","events_json":"https://pith.science/api/pith-number/W44M6C5A6QUAO54UXCIYSLHXDD/events.json","paper":"https://pith.science/paper/W44M6C5A"},"agent_actions":{"view_html":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD","download_json":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD.json","view_paper":"https://pith.science/paper/W44M6C5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0320&json=true","fetch_graph":"https://pith.science/api/pith-number/W44M6C5A6QUAO54UXCIYSLHXDD/graph.json","fetch_events":"https://pith.science/api/pith-number/W44M6C5A6QUAO54UXCIYSLHXDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/action/storage_attestation","attest_author":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/action/author_attestation","sign_citation":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/action/citation_signature","submit_replication":"https://pith.science/pith/W44M6C5A6QUAO54UXCIYSLHXDD/action/replication_record"}},"created_at":"2026-05-18T02:28:47.410960+00:00","updated_at":"2026-05-18T02:28:47.410960+00:00"}