{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X6PBXBOLCTHDNUIWQM244OBYMB","short_pith_number":"pith:X6PBXBOL","canonical_record":{"source":{"id":"1604.06715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T15:37:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"63b56b7bb8e9778b4d00c983e3d6bf123f0287a66513988b256e6aaaec4c7926","abstract_canon_sha256":"80e890a78ac1527b50ad6f2ff9932d80f5514ce6059ac4b702a6dbb1865447f0"},"schema_version":"1.0"},"canonical_sha256":"bf9e1b85cb14ce36d1168335ce3838605e9a53cecac709ddcb8d3865e24929ad","source":{"kind":"arxiv","id":"1604.06715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06715","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06715v1","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06715","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"X6PBXBOLCTHD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X6PBXBOLCTHDNUIW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X6PBXBOL","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X6PBXBOLCTHDNUIWQM244OBYMB","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T15:37:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"63b56b7bb8e9778b4d00c983e3d6bf123f0287a66513988b256e6aaaec4c7926","abstract_canon_sha256":"80e890a78ac1527b50ad6f2ff9932d80f5514ce6059ac4b702a6dbb1865447f0"},"schema_version":"1.0"},"canonical_sha256":"bf9e1b85cb14ce36d1168335ce3838605e9a53cecac709ddcb8d3865e24929ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.368547Z","signature_b64":"GKMeohqagp6TW9bShlEYjzDqKkmc3GD51vn0jKdYI13k0YZwlXoDaJRhUeqafwiIMOC/nTxesJXY7pcqHDZdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf9e1b85cb14ce36d1168335ce3838605e9a53cecac709ddcb8d3865e24929ad","last_reissued_at":"2026-05-18T01:16:28.367889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.367889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06715","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-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41bKVNr4t2UpkqFYocpsEG/aB1BgD3XTc+UPP/w89iZJR1aoCw6bHMOQeQYhNGwX6sRk/oieQbWkgh5Y1Tl+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:30:14.285087Z"},"content_sha256":"ecaa20b9779a41eddade0414e47173a5ae2a27f7e5becefe2d21620b8814a9af","schema_version":"1.0","event_id":"sha256:ecaa20b9779a41eddade0414e47173a5ae2a27f7e5becefe2d21620b8814a9af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X6PBXBOLCTHDNUIWQM244OBYMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Compilation Lower Bounds for Restricted CNF-formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.AI","authors_text":"Stefan Mengel","submitted_at":"2016-04-22T15:37:14Z","abstract_excerpt":"We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures. In particular, we show that\n  - there are CNF formulas of size $n$ and modular incidence treewidth $k$ whose smallest DNNF-encoding has size $n^{\\Omega(k)}$, and\n  - there are CNF formulas of size $n$ and incidence neighborhood diversity $k$ whose smallest DNNF-encoding has size $n^{\\Omega(\\sqrt{k})}$.\n  These results complement recent upper bounds for com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06715","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-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tF+LsVmw1AYVBAss9OBpKG3p9SodlhkrET4Igs3hup0nIbTDFLCRu0o3tRJy8Nzj5AQSACFdaqcaXViOl1jGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:30:14.285757Z"},"content_sha256":"56170afc2e5a4c82c02463d6bd8deda5b354bce7ab170043799ccdf7b10aad99","schema_version":"1.0","event_id":"sha256:56170afc2e5a4c82c02463d6bd8deda5b354bce7ab170043799ccdf7b10aad99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6PBXBOLCTHDNUIWQM244OBYMB/bundle.json","state_url":"https://pith.science/pith/X6PBXBOLCTHDNUIWQM244OBYMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6PBXBOLCTHDNUIWQM244OBYMB/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-05-27T17:30:14Z","links":{"resolver":"https://pith.science/pith/X6PBXBOLCTHDNUIWQM244OBYMB","bundle":"https://pith.science/pith/X6PBXBOLCTHDNUIWQM244OBYMB/bundle.json","state":"https://pith.science/pith/X6PBXBOLCTHDNUIWQM244OBYMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6PBXBOLCTHDNUIWQM244OBYMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X6PBXBOLCTHDNUIWQM244OBYMB","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":"80e890a78ac1527b50ad6f2ff9932d80f5514ce6059ac4b702a6dbb1865447f0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T15:37:14Z","title_canon_sha256":"63b56b7bb8e9778b4d00c983e3d6bf123f0287a66513988b256e6aaaec4c7926"},"schema_version":"1.0","source":{"id":"1604.06715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06715","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06715v1","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06715","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"X6PBXBOLCTHD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X6PBXBOLCTHDNUIW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X6PBXBOL","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:56170afc2e5a4c82c02463d6bd8deda5b354bce7ab170043799ccdf7b10aad99","target":"graph","created_at":"2026-05-18T01:16:28Z","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":"We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures. In particular, we show that\n  - there are CNF formulas of size $n$ and modular incidence treewidth $k$ whose smallest DNNF-encoding has size $n^{\\Omega(k)}$, and\n  - there are CNF formulas of size $n$ and incidence neighborhood diversity $k$ whose smallest DNNF-encoding has size $n^{\\Omega(\\sqrt{k})}$.\n  These results complement recent upper bounds for com","authors_text":"Stefan Mengel","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T15:37:14Z","title":"Parameterized Compilation Lower Bounds for Restricted CNF-formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06715","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:ecaa20b9779a41eddade0414e47173a5ae2a27f7e5becefe2d21620b8814a9af","target":"record","created_at":"2026-05-18T01:16:28Z","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":"80e890a78ac1527b50ad6f2ff9932d80f5514ce6059ac4b702a6dbb1865447f0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T15:37:14Z","title_canon_sha256":"63b56b7bb8e9778b4d00c983e3d6bf123f0287a66513988b256e6aaaec4c7926"},"schema_version":"1.0","source":{"id":"1604.06715","kind":"arxiv","version":1}},"canonical_sha256":"bf9e1b85cb14ce36d1168335ce3838605e9a53cecac709ddcb8d3865e24929ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf9e1b85cb14ce36d1168335ce3838605e9a53cecac709ddcb8d3865e24929ad","first_computed_at":"2026-05-18T01:16:28.367889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:28.367889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKMeohqagp6TW9bShlEYjzDqKkmc3GD51vn0jKdYI13k0YZwlXoDaJRhUeqafwiIMOC/nTxesJXY7pcqHDZdBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:28.368547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecaa20b9779a41eddade0414e47173a5ae2a27f7e5becefe2d21620b8814a9af","sha256:56170afc2e5a4c82c02463d6bd8deda5b354bce7ab170043799ccdf7b10aad99"],"state_sha256":"93a26933931dbe4c8822d4e8368ce96074f5d4b3df2fcfa8862f399cece1615a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4GnSmSXbWxDexWANZ9LOZ+1QpciOW5Axw5sv5J2mhkjuUPu4KfagUSUWC8lDhUDTc99dSPZolxT9hBcOzplCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:30:14.289343Z","bundle_sha256":"ee0bccfa5fba28a5e8a49063e154cb2593526977c474dc55d2a03f68e2285822"}}