{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QLZ35MMYD2G5H6SBHPQGKVNFOT","short_pith_number":"pith:QLZ35MMY","schema_version":"1.0","canonical_sha256":"82f3beb1981e8dd3fa413be06555a574d338aa93289116d00430a5985486ab53","source":{"kind":"arxiv","id":"1405.6043","version":1},"attestation_state":"computed","paper":{"title":"Understanding model counting for $\\beta$-acyclic CNF-formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CC","authors_text":"Florent Capelli, Johann Brault-Baron, Stefan Mengel","submitted_at":"2014-05-23T12:38:18Z","abstract_excerpt":"We extend the knowledge about so-called structural restrictions of $\\mathrm{\\#SAT}$ by giving a polynomial time algorithm for $\\beta$-acyclic $\\mathrm{\\#SAT}$. In contrast to previous algorithms in the area, our algorithm does not proceed by dynamic programming but works along an elimination order, solving a weighted version of constraint satisfaction. Moreover, we give evidence that this deviation from more standard algorithm is not a coincidence, but that there is likely no dynamic programming algorithm of the usual style for $\\beta$-acyclic $\\mathrm{\\#SAT}$."},"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":"1405.6043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-23T12:38:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8164526da913bafe736f2d4fc821d10562e3a57036815c28733c1bc8a12ce7e2","abstract_canon_sha256":"b659e8ab4ee0d0f6325e24d182320361ed95d0b74a199016329299644fa30288"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.202882Z","signature_b64":"+nJydmm9VgKo6hy6EVWaPU1E3NbCyv9fc52EQgJi45wBCIis/EPKHbKLvhQDRvVoOAc0Vu16h5+8oL0WttkTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f3beb1981e8dd3fa413be06555a574d338aa93289116d00430a5985486ab53","last_reissued_at":"2026-05-18T02:51:14.202412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.202412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding model counting for $\\beta$-acyclic CNF-formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CC","authors_text":"Florent Capelli, Johann Brault-Baron, Stefan Mengel","submitted_at":"2014-05-23T12:38:18Z","abstract_excerpt":"We extend the knowledge about so-called structural restrictions of $\\mathrm{\\#SAT}$ by giving a polynomial time algorithm for $\\beta$-acyclic $\\mathrm{\\#SAT}$. In contrast to previous algorithms in the area, our algorithm does not proceed by dynamic programming but works along an elimination order, solving a weighted version of constraint satisfaction. Moreover, we give evidence that this deviation from more standard algorithm is not a coincidence, but that there is likely no dynamic programming algorithm of the usual style for $\\beta$-acyclic $\\mathrm{\\#SAT}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6043","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.6043","created_at":"2026-05-18T02:51:14.202477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6043v1","created_at":"2026-05-18T02:51:14.202477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6043","created_at":"2026-05-18T02:51:14.202477+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLZ35MMYD2G5","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLZ35MMYD2G5H6SB","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLZ35MMY","created_at":"2026-05-18T12:28:46.137349+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/QLZ35MMYD2G5H6SBHPQGKVNFOT","json":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT.json","graph_json":"https://pith.science/api/pith-number/QLZ35MMYD2G5H6SBHPQGKVNFOT/graph.json","events_json":"https://pith.science/api/pith-number/QLZ35MMYD2G5H6SBHPQGKVNFOT/events.json","paper":"https://pith.science/paper/QLZ35MMY"},"agent_actions":{"view_html":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT","download_json":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT.json","view_paper":"https://pith.science/paper/QLZ35MMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6043&json=true","fetch_graph":"https://pith.science/api/pith-number/QLZ35MMYD2G5H6SBHPQGKVNFOT/graph.json","fetch_events":"https://pith.science/api/pith-number/QLZ35MMYD2G5H6SBHPQGKVNFOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT/action/storage_attestation","attest_author":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT/action/author_attestation","sign_citation":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT/action/citation_signature","submit_replication":"https://pith.science/pith/QLZ35MMYD2G5H6SBHPQGKVNFOT/action/replication_record"}},"created_at":"2026-05-18T02:51:14.202477+00:00","updated_at":"2026-05-18T02:51:14.202477+00:00"}