{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KIUDM2ESS7N6A6RLHVK5FQ5JN2","short_pith_number":"pith:KIUDM2ES","schema_version":"1.0","canonical_sha256":"522836689297dbe07a2b3d55d2c3a96e85c7426910bcc7ea98cc4444f6096974","source":{"kind":"arxiv","id":"2505.16012","version":2},"attestation_state":"computed","paper":{"title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Igor Razgon","submitted_at":"2025-05-21T20:55:50Z","abstract_excerpt":"Decomposable Negation Normal Forms \\textsc{dnnf} [Darwiche, 'Decomposable Negation Normal Form', JACM, 2001] is a landmark Knowledge Compilation (\\textsc{kc}) model, highly important both in \\textsc{ai} and Theoretical Computer Science. Numerous restrictions of the model have been studied. In this paper we consider the restriction where all the gates are $\\alpha$-imbalanced that is, at most one input of each gate depends on more than $n^{\\alpha}$ variables (where $n$ is the number if variables of the function being represented).\n  The concept of imbalanced gates has been first considered in [L"},"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":"2505.16012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-05-21T20:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"0b1790e9725cede3e3847bb66eb3d36b2022abfe356bd6654ff4c3093cf6c296","abstract_canon_sha256":"35d2299d650cdd9cec468111467096193a20db275927c07efa1a78694a20e080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:07.321541Z","signature_b64":"15AEV4mt5D4jT19q5pOEaAMv5py0w6o03MNWvqGi+1grkw0EI1ThBiExQaf/oy6rFtOb0nQK+AnvDn6RGikRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"522836689297dbe07a2b3d55d2c3a96e85c7426910bcc7ea98cc4444f6096974","last_reissued_at":"2026-07-05T11:19:07.321087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:07.321087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Igor Razgon","submitted_at":"2025-05-21T20:55:50Z","abstract_excerpt":"Decomposable Negation Normal Forms \\textsc{dnnf} [Darwiche, 'Decomposable Negation Normal Form', JACM, 2001] is a landmark Knowledge Compilation (\\textsc{kc}) model, highly important both in \\textsc{ai} and Theoretical Computer Science. Numerous restrictions of the model have been studied. In this paper we consider the restriction where all the gates are $\\alpha$-imbalanced that is, at most one input of each gate depends on more than $n^{\\alpha}$ variables (where $n$ is the number if variables of the function being represented).\n  The concept of imbalanced gates has been first considered in [L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16012","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.16012/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.16012","created_at":"2026-07-05T11:19:07.321141+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.16012v2","created_at":"2026-07-05T11:19:07.321141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16012","created_at":"2026-07-05T11:19:07.321141+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIUDM2ESS7N6","created_at":"2026-07-05T11:19:07.321141+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIUDM2ESS7N6A6RL","created_at":"2026-07-05T11:19:07.321141+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIUDM2ES","created_at":"2026-07-05T11:19:07.321141+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/KIUDM2ESS7N6A6RLHVK5FQ5JN2","json":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2.json","graph_json":"https://pith.science/api/pith-number/KIUDM2ESS7N6A6RLHVK5FQ5JN2/graph.json","events_json":"https://pith.science/api/pith-number/KIUDM2ESS7N6A6RLHVK5FQ5JN2/events.json","paper":"https://pith.science/paper/KIUDM2ES"},"agent_actions":{"view_html":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2","download_json":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2.json","view_paper":"https://pith.science/paper/KIUDM2ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.16012&json=true","fetch_graph":"https://pith.science/api/pith-number/KIUDM2ESS7N6A6RLHVK5FQ5JN2/graph.json","fetch_events":"https://pith.science/api/pith-number/KIUDM2ESS7N6A6RLHVK5FQ5JN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2/action/storage_attestation","attest_author":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2/action/author_attestation","sign_citation":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2/action/citation_signature","submit_replication":"https://pith.science/pith/KIUDM2ESS7N6A6RLHVK5FQ5JN2/action/replication_record"}},"created_at":"2026-07-05T11:19:07.321141+00:00","updated_at":"2026-07-05T11:19:07.321141+00:00"}