{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FGWRC6VYVW6RJFXL7CRWQ7ZOMX","short_pith_number":"pith:FGWRC6VY","canonical_record":{"source":{"id":"2502.00434","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-01T14:00:04Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"bf7c141a57acaf20f9fbf3c6b0517d5b6b0422fb598ac92a9bc495b4c061c0c2","abstract_canon_sha256":"acf06896edcbe34e9b5be24ea4e06400ff9cf57bc0fb1c6810eccab7418653cc"},"schema_version":"1.0"},"canonical_sha256":"29ad117ab8adbd1496ebf8a3687f2e65c50df43c0aea2b23a855e6468171d227","source":{"kind":"arxiv","id":"2502.00434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00434","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00434v1","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00434","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"FGWRC6VYVW6R","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"pith_short_16","alias_value":"FGWRC6VYVW6RJFXL","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"pith_short_8","alias_value":"FGWRC6VY","created_at":"2026-07-05T10:08:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FGWRC6VYVW6RJFXL7CRWQ7ZOMX","target":"record","payload":{"canonical_record":{"source":{"id":"2502.00434","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-01T14:00:04Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"bf7c141a57acaf20f9fbf3c6b0517d5b6b0422fb598ac92a9bc495b4c061c0c2","abstract_canon_sha256":"acf06896edcbe34e9b5be24ea4e06400ff9cf57bc0fb1c6810eccab7418653cc"},"schema_version":"1.0"},"canonical_sha256":"29ad117ab8adbd1496ebf8a3687f2e65c50df43c0aea2b23a855e6468171d227","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:33.609848Z","signature_b64":"Y7HcTIYRgtmL6m3AzdsCno3VJnKJZ/MYjp3AEj2OMyTxl44h1L6xyAQAisGBo90EzgHBJ+xF2z5a0dcf8ThrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29ad117ab8adbd1496ebf8a3687f2e65c50df43c0aea2b23a855e6468171d227","last_reissued_at":"2026-07-05T10:08:33.609349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:33.609349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.00434","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-07-05T10:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiTAc0PlaRIzzQCC6Z9OnSSTBE4nxkR/DXyvpzpgIJpfpulUmLQppuvAtJ50QrlTN6jhUTls8gm8D1Md/NJQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:40:35.113704Z"},"content_sha256":"e64ae7fb29a89843b245e2f9ec8a487b9ef1482d6eb74a1371976fb7bb4caf27","schema_version":"1.0","event_id":"sha256:e64ae7fb29a89843b245e2f9ec8a487b9ef1482d6eb74a1371976fb7bb4caf27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FGWRC6VYVW6RJFXL7CRWQ7ZOMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compilation and Fast Model Counting beyond CNF","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.CC","authors_text":"Alexis de Colnet, Stefan Szeider, Tianwei Zhang","submitted_at":"2025-02-01T14:00:04Z","abstract_excerpt":"Circuits in deterministic decomposable negation normal form (d-DNNF) are representations of Boolean functions that enable linear-time model counting. This paper strengthens our theoretical knowledge of what classes of functions can be efficiently transformed, or compiled, into d-DNNF. Our main contribution is the fixed-parameter tractable (FPT) compilation of conjunctions of specific constraints parameterized by incidence treewidth. This subsumes the known result for CNF. The constraints in question are all functions representable by constant-width ordered binary decision diagrams (OBDDs) for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00434","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.00434/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"},"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-07-05T10:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAIFsffigZZOXxhvdJJV2l6471C50j+mp9mSW18zQPfIMfJTEYpz8bOjBsRchu/0RhxYDRrrUvPFtT9ubTvqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:40:35.114500Z"},"content_sha256":"6ab0d38a3575cea96657b69d7aed87b000fd5516497a82a0e3b64af282d33326","schema_version":"1.0","event_id":"sha256:6ab0d38a3575cea96657b69d7aed87b000fd5516497a82a0e3b64af282d33326"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGWRC6VYVW6RJFXL7CRWQ7ZOMX/bundle.json","state_url":"https://pith.science/pith/FGWRC6VYVW6RJFXL7CRWQ7ZOMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGWRC6VYVW6RJFXL7CRWQ7ZOMX/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-08-20T12:40:35Z","links":{"resolver":"https://pith.science/pith/FGWRC6VYVW6RJFXL7CRWQ7ZOMX","bundle":"https://pith.science/pith/FGWRC6VYVW6RJFXL7CRWQ7ZOMX/bundle.json","state":"https://pith.science/pith/FGWRC6VYVW6RJFXL7CRWQ7ZOMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGWRC6VYVW6RJFXL7CRWQ7ZOMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FGWRC6VYVW6RJFXL7CRWQ7ZOMX","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":"acf06896edcbe34e9b5be24ea4e06400ff9cf57bc0fb1c6810eccab7418653cc","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-01T14:00:04Z","title_canon_sha256":"bf7c141a57acaf20f9fbf3c6b0517d5b6b0422fb598ac92a9bc495b4c061c0c2"},"schema_version":"1.0","source":{"id":"2502.00434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00434","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00434v1","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00434","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"FGWRC6VYVW6R","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"pith_short_16","alias_value":"FGWRC6VYVW6RJFXL","created_at":"2026-07-05T10:08:33Z"},{"alias_kind":"pith_short_8","alias_value":"FGWRC6VY","created_at":"2026-07-05T10:08:33Z"}],"graph_snapshots":[{"event_id":"sha256:6ab0d38a3575cea96657b69d7aed87b000fd5516497a82a0e3b64af282d33326","target":"graph","created_at":"2026-07-05T10:08:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.00434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Circuits in deterministic decomposable negation normal form (d-DNNF) are representations of Boolean functions that enable linear-time model counting. This paper strengthens our theoretical knowledge of what classes of functions can be efficiently transformed, or compiled, into d-DNNF. Our main contribution is the fixed-parameter tractable (FPT) compilation of conjunctions of specific constraints parameterized by incidence treewidth. This subsumes the known result for CNF. The constraints in question are all functions representable by constant-width ordered binary decision diagrams (OBDDs) for ","authors_text":"Alexis de Colnet, Stefan Szeider, Tianwei Zhang","cross_cats":["cs.AI","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00434","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:e64ae7fb29a89843b245e2f9ec8a487b9ef1482d6eb74a1371976fb7bb4caf27","target":"record","created_at":"2026-07-05T10:08:33Z","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":"acf06896edcbe34e9b5be24ea4e06400ff9cf57bc0fb1c6810eccab7418653cc","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-01T14:00:04Z","title_canon_sha256":"bf7c141a57acaf20f9fbf3c6b0517d5b6b0422fb598ac92a9bc495b4c061c0c2"},"schema_version":"1.0","source":{"id":"2502.00434","kind":"arxiv","version":1}},"canonical_sha256":"29ad117ab8adbd1496ebf8a3687f2e65c50df43c0aea2b23a855e6468171d227","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29ad117ab8adbd1496ebf8a3687f2e65c50df43c0aea2b23a855e6468171d227","first_computed_at":"2026-07-05T10:08:33.609349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:33.609349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y7HcTIYRgtmL6m3AzdsCno3VJnKJZ/MYjp3AEj2OMyTxl44h1L6xyAQAisGBo90EzgHBJ+xF2z5a0dcf8ThrAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:33.609848Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e64ae7fb29a89843b245e2f9ec8a487b9ef1482d6eb74a1371976fb7bb4caf27","sha256:6ab0d38a3575cea96657b69d7aed87b000fd5516497a82a0e3b64af282d33326"],"state_sha256":"2297dcbe2c881ffe8b026042be7b413a85716831ec3966dbfb3641d835ba8697"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ykbQcqyQKTHLJi4V5OVIKXPDoiXea0Vg4Pg3ny7R0i0ryDlGt/G1tmugD3Co/HIC/X+wgO95t0RlJYJcirsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T12:40:35.122396Z","bundle_sha256":"c728d7586b74a1c94efc405a705b12d4486e3441c794e8508331fcda88c12c6e"}}