{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZOUE7LSBRGJQUHJK2TT3SNKFZC","short_pith_number":"pith:ZOUE7LSB","schema_version":"1.0","canonical_sha256":"cba84fae4189930a1d2ad4e7b93545c8ac34d3fa7b8896d9e4da1cea7547d03f","source":{"kind":"arxiv","id":"1003.3879","version":4},"attestation_state":"computed","paper":{"title":"An Effective Dichotomy for the Counting Constraint Satisfaction Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Richerby, Martin Dyer","submitted_at":"2010-03-19T20:09:09Z","abstract_excerpt":"Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem #CSP. A problem from #CSP is characterised by a constraint language, which is a fixed, finite set of relations over a finite domain D. An instance of the problem uses these relations to constrain the variables in a larger set. Bulatov showed that the problem of counting the satisfying assignments of instances of any problem from #CSP is either in polynomial time (FP) or is #P-complete. His proof draws heavily on techniques from universal algebra and cannot be understood without a secure grasp of that field. We giv"},"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":"1003.3879","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-03-19T20:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"6b28041538e68fee6b1dc5d085fe61fc12beb0de54844ecc8a05ab4fcd161c5a","abstract_canon_sha256":"f57a90d7d88b01c4df0be11ae11632fe1861a1a2f48e8b8cff0ca3825a1cd974"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:18.991685Z","signature_b64":"frMYtgzMNGeI3JcVDf7XuS5tGp6JxpyBADkCxUs9PfJW9hj94+Y2la/NkK12/Y6NWwEkTkwWebMC8Ln+p7cxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cba84fae4189930a1d2ad4e7b93545c8ac34d3fa7b8896d9e4da1cea7547d03f","last_reissued_at":"2026-05-18T04:15:18.990914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:18.990914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Effective Dichotomy for the Counting Constraint Satisfaction Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Richerby, Martin Dyer","submitted_at":"2010-03-19T20:09:09Z","abstract_excerpt":"Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem #CSP. A problem from #CSP is characterised by a constraint language, which is a fixed, finite set of relations over a finite domain D. An instance of the problem uses these relations to constrain the variables in a larger set. Bulatov showed that the problem of counting the satisfying assignments of instances of any problem from #CSP is either in polynomial time (FP) or is #P-complete. His proof draws heavily on techniques from universal algebra and cannot be understood without a secure grasp of that field. We giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3879","kind":"arxiv","version":4},"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":"1003.3879","created_at":"2026-05-18T04:15:18.991075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3879v4","created_at":"2026-05-18T04:15:18.991075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3879","created_at":"2026-05-18T04:15:18.991075+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOUE7LSBRGJQ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOUE7LSBRGJQUHJK","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOUE7LSB","created_at":"2026-05-18T12:26:18.847500+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/ZOUE7LSBRGJQUHJK2TT3SNKFZC","json":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC.json","graph_json":"https://pith.science/api/pith-number/ZOUE7LSBRGJQUHJK2TT3SNKFZC/graph.json","events_json":"https://pith.science/api/pith-number/ZOUE7LSBRGJQUHJK2TT3SNKFZC/events.json","paper":"https://pith.science/paper/ZOUE7LSB"},"agent_actions":{"view_html":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC","download_json":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC.json","view_paper":"https://pith.science/paper/ZOUE7LSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3879&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOUE7LSBRGJQUHJK2TT3SNKFZC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOUE7LSBRGJQUHJK2TT3SNKFZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC/action/storage_attestation","attest_author":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC/action/author_attestation","sign_citation":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC/action/citation_signature","submit_replication":"https://pith.science/pith/ZOUE7LSBRGJQUHJK2TT3SNKFZC/action/replication_record"}},"created_at":"2026-05-18T04:15:18.991075+00:00","updated_at":"2026-05-18T04:15:18.991075+00:00"}