{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5DQEJJTODKM6TQEX6RPWOYVQE7","short_pith_number":"pith:5DQEJJTO","canonical_record":{"source":{"id":"1401.6307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-24T10:33:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2c65d4ebb1c1f4741b7424a427311ddc3cbef79aa0b5ca41618a556341221eff","abstract_canon_sha256":"753ee83a12639e7b4ce3a47ce6d285cd9f4fc42f432317ecc423af3bc0db9e6d"},"schema_version":"1.0"},"canonical_sha256":"e8e044a66e1a99e9c097f45f6762b027ffec9aee7bd002d65d8390b40c9a1aa7","source":{"kind":"arxiv","id":"1401.6307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6307","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6307v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6307","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"5DQEJJTODKM6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5DQEJJTODKM6TQEX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5DQEJJTO","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5DQEJJTODKM6TQEX6RPWOYVQE7","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-24T10:33:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2c65d4ebb1c1f4741b7424a427311ddc3cbef79aa0b5ca41618a556341221eff","abstract_canon_sha256":"753ee83a12639e7b4ce3a47ce6d285cd9f4fc42f432317ecc423af3bc0db9e6d"},"schema_version":"1.0"},"canonical_sha256":"e8e044a66e1a99e9c097f45f6762b027ffec9aee7bd002d65d8390b40c9a1aa7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.537988Z","signature_b64":"6B6p4pYno5VXDNblVu+eIn6nMHVbTK8rFeiVRXrEkeeWPbFLmX6z87sOS/tC34LX1X8hmidCVxC3t7WusN5fDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8e044a66e1a99e9c097f45f6762b027ffec9aee7bd002d65d8390b40c9a1aa7","last_reissued_at":"2026-05-18T03:01:12.537075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.537075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6307","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03TsuUwVnIrWVtNmBcKuqYXpandlmA3RKlY4cFyfIHWw7HaRYBnNDSJIzNUGTRKVJeN1joSibTf10Q1QCVb2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:52:28.248398Z"},"content_sha256":"1ecc18cb46c225aa036bbc9123a40456e3beacf7efb7d7a0a79758a0701ebc18","schema_version":"1.0","event_id":"sha256:1ecc18cb46c225aa036bbc9123a40456e3beacf7efb7d7a0a79758a0701ebc18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5DQEJJTODKM6TQEX6RPWOYVQE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypergraph Acyclicity and Propositional Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CC","authors_text":"Arnaud Durand, Florent Capelli, Stefan Mengel","submitted_at":"2014-01-24T10:33:23Z","abstract_excerpt":"We show that the propositional model counting problem #SAT for CNF- formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time. We show that this class of hypergraphs is incomparable to hypergraphs of bounded incidence cliquewidth which were the biggest class of hypergraphs for which #SAT was known to be solvable in polynomial time so far. Furthermore, we present a polynomial time algorithm that computes a disjoint branches decomposition of a given hypergraph if it exists and rejects otherwise. Finally, we show that some slight extensions of the cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6307","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DZBKlL7hUOu+NjqLl8tveGLiNiSVWSKdXQy9K9FUWV5pj3UpMyVooqYIGcJy+XGQHNGLcOCmrgna65u8nBLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:52:28.249155Z"},"content_sha256":"9f632dfb2dd6878423d40726d9a7f0f1308c10a6a46a51a568c206bc687b6dfa","schema_version":"1.0","event_id":"sha256:9f632dfb2dd6878423d40726d9a7f0f1308c10a6a46a51a568c206bc687b6dfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DQEJJTODKM6TQEX6RPWOYVQE7/bundle.json","state_url":"https://pith.science/pith/5DQEJJTODKM6TQEX6RPWOYVQE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DQEJJTODKM6TQEX6RPWOYVQE7/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-10T11:52:28Z","links":{"resolver":"https://pith.science/pith/5DQEJJTODKM6TQEX6RPWOYVQE7","bundle":"https://pith.science/pith/5DQEJJTODKM6TQEX6RPWOYVQE7/bundle.json","state":"https://pith.science/pith/5DQEJJTODKM6TQEX6RPWOYVQE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DQEJJTODKM6TQEX6RPWOYVQE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5DQEJJTODKM6TQEX6RPWOYVQE7","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":"753ee83a12639e7b4ce3a47ce6d285cd9f4fc42f432317ecc423af3bc0db9e6d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-24T10:33:23Z","title_canon_sha256":"2c65d4ebb1c1f4741b7424a427311ddc3cbef79aa0b5ca41618a556341221eff"},"schema_version":"1.0","source":{"id":"1401.6307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6307","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6307v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6307","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"5DQEJJTODKM6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5DQEJJTODKM6TQEX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5DQEJJTO","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:9f632dfb2dd6878423d40726d9a7f0f1308c10a6a46a51a568c206bc687b6dfa","target":"graph","created_at":"2026-05-18T03:01:12Z","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 that the propositional model counting problem #SAT for CNF- formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time. We show that this class of hypergraphs is incomparable to hypergraphs of bounded incidence cliquewidth which were the biggest class of hypergraphs for which #SAT was known to be solvable in polynomial time so far. Furthermore, we present a polynomial time algorithm that computes a disjoint branches decomposition of a given hypergraph if it exists and rejects otherwise. Finally, we show that some slight extensions of the cla","authors_text":"Arnaud Durand, Florent Capelli, Stefan Mengel","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-24T10:33:23Z","title":"Hypergraph Acyclicity and Propositional Model Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6307","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:1ecc18cb46c225aa036bbc9123a40456e3beacf7efb7d7a0a79758a0701ebc18","target":"record","created_at":"2026-05-18T03:01:12Z","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":"753ee83a12639e7b4ce3a47ce6d285cd9f4fc42f432317ecc423af3bc0db9e6d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-24T10:33:23Z","title_canon_sha256":"2c65d4ebb1c1f4741b7424a427311ddc3cbef79aa0b5ca41618a556341221eff"},"schema_version":"1.0","source":{"id":"1401.6307","kind":"arxiv","version":1}},"canonical_sha256":"e8e044a66e1a99e9c097f45f6762b027ffec9aee7bd002d65d8390b40c9a1aa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8e044a66e1a99e9c097f45f6762b027ffec9aee7bd002d65d8390b40c9a1aa7","first_computed_at":"2026-05-18T03:01:12.537075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:12.537075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6B6p4pYno5VXDNblVu+eIn6nMHVbTK8rFeiVRXrEkeeWPbFLmX6z87sOS/tC34LX1X8hmidCVxC3t7WusN5fDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:12.537988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ecc18cb46c225aa036bbc9123a40456e3beacf7efb7d7a0a79758a0701ebc18","sha256:9f632dfb2dd6878423d40726d9a7f0f1308c10a6a46a51a568c206bc687b6dfa"],"state_sha256":"5449592965c13acf86f50d49d07760c25209983aae80c2e6e0e5081c8e420a9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eioISxzVf9xmzyT29Ze+nfY1GRt5u3kBqbnFRz7vPdToit/6+1UMVKRV9aY0w5LA78i5f+8WQ2dTtUVhMQO4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:52:28.253535Z","bundle_sha256":"63c27760f70cb026dc640d18d2f6cd83a381154172b332dd1949cd0dbec598b6"}}