{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TIBPPYBSPYOMT2OL6ZPSXRUBTW","short_pith_number":"pith:TIBPPYBS","schema_version":"1.0","canonical_sha256":"9a02f7e0327e1cc9e9cbf65f2bc6819dbaa2a9733d68d452fd9bbdfb754d001b","source":{"kind":"arxiv","id":"1409.8464","version":1},"attestation_state":"computed","paper":{"title":"Model Counting for Formulas of Bounded Clique-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Friedrich Slivovsky, Stefan Szeider","submitted_at":"2014-09-30T10:27:07Z","abstract_excerpt":"We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width). This result strictly generalizes polynomial-time tractability results for classes of formulas with signed incidence graphs of bounded clique-width and classes of formulas with incidence graphs of bounded modular treewidth, which were the most general results of this kind known so far."},"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":"1409.8464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-30T10:27:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6e733036f590eea571b057c8d7f7b10ed1f7f092e8587908a60d5f3d92c781b4","abstract_canon_sha256":"c38a09251ad5d72d734cc10bc2fe56a7cd4a3ff816b6cb8b46785933fff7acd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:25.331722Z","signature_b64":"YvryUDwNWNRdoCAEBu+Zlaq5A1irnWxdS0SNGHpTeSphirfK9LtllqkEXUsbUiMUvp0RmMb7dUGPMWfW05JZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a02f7e0327e1cc9e9cbf65f2bc6819dbaa2a9733d68d452fd9bbdfb754d001b","last_reissued_at":"2026-05-18T02:41:25.331302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:25.331302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Counting for Formulas of Bounded Clique-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Friedrich Slivovsky, Stefan Szeider","submitted_at":"2014-09-30T10:27:07Z","abstract_excerpt":"We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width). This result strictly generalizes polynomial-time tractability results for classes of formulas with signed incidence graphs of bounded clique-width and classes of formulas with incidence graphs of bounded modular treewidth, which were the most general results of this kind known so far."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8464","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":"1409.8464","created_at":"2026-05-18T02:41:25.331371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8464v1","created_at":"2026-05-18T02:41:25.331371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8464","created_at":"2026-05-18T02:41:25.331371+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIBPPYBSPYOM","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIBPPYBSPYOMT2OL","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIBPPYBS","created_at":"2026-05-18T12:28:49.207871+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/TIBPPYBSPYOMT2OL6ZPSXRUBTW","json":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW.json","graph_json":"https://pith.science/api/pith-number/TIBPPYBSPYOMT2OL6ZPSXRUBTW/graph.json","events_json":"https://pith.science/api/pith-number/TIBPPYBSPYOMT2OL6ZPSXRUBTW/events.json","paper":"https://pith.science/paper/TIBPPYBS"},"agent_actions":{"view_html":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW","download_json":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW.json","view_paper":"https://pith.science/paper/TIBPPYBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8464&json=true","fetch_graph":"https://pith.science/api/pith-number/TIBPPYBSPYOMT2OL6ZPSXRUBTW/graph.json","fetch_events":"https://pith.science/api/pith-number/TIBPPYBSPYOMT2OL6ZPSXRUBTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW/action/storage_attestation","attest_author":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW/action/author_attestation","sign_citation":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW/action/citation_signature","submit_replication":"https://pith.science/pith/TIBPPYBSPYOMT2OL6ZPSXRUBTW/action/replication_record"}},"created_at":"2026-05-18T02:41:25.331371+00:00","updated_at":"2026-05-18T02:41:25.331371+00:00"}