{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5NM3SF2NZGUXWAFYTSFQKEKMOT","short_pith_number":"pith:5NM3SF2N","schema_version":"1.0","canonical_sha256":"eb59b9174dc9a97b00b89c8b05114c74cf4562745b13d3f60b9500e33af6c1e4","source":{"kind":"arxiv","id":"1111.2384","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Counting CSP with Complex Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Xi Chen","submitted_at":"2011-11-10T02:42:57Z","abstract_excerpt":"We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions, then we prove that #CSP(F) is solvable in polynomial time if all three conditions are satisfied; and is #P-hard otherwise.\n  Our complexity dichotomy generalizes a long series of important results on counting problems: (a) the problem of counting graph homomorphisms is the special case when there is a single symmetric binary function in F; (b) the problem of "},"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":"1111.2384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-10T02:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"9eb1488fcbaf8646a77debb7c7854d37e3012d6d72045777b53b74ab99ef688c","abstract_canon_sha256":"71f2af9efc0865ff8d489e96885031e7f7655ec7b8f09190eb95c63e10e97f20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:34.797100Z","signature_b64":"9VPlRgNe6ohQhJq6EhdifAh3OGMChK0Ir+N6NfIMe/EPGuAjkCQwgBw4DVb9AIYrvAkS93fN4uX9ky5WvcAHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb59b9174dc9a97b00b89c8b05114c74cf4562745b13d3f60b9500e33af6c1e4","last_reissued_at":"2026-05-18T02:21:34.796616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:34.796616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Counting CSP with Complex Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Xi Chen","submitted_at":"2011-11-10T02:42:57Z","abstract_excerpt":"We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions, then we prove that #CSP(F) is solvable in polynomial time if all three conditions are satisfied; and is #P-hard otherwise.\n  Our complexity dichotomy generalizes a long series of important results on counting problems: (a) the problem of counting graph homomorphisms is the special case when there is a single symmetric binary function in F; (b) the problem of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2384","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":"1111.2384","created_at":"2026-05-18T02:21:34.796695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2384v1","created_at":"2026-05-18T02:21:34.796695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2384","created_at":"2026-05-18T02:21:34.796695+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NM3SF2NZGUX","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NM3SF2NZGUXWAFY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NM3SF2N","created_at":"2026-05-18T12:26:20.644004+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/5NM3SF2NZGUXWAFYTSFQKEKMOT","json":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT.json","graph_json":"https://pith.science/api/pith-number/5NM3SF2NZGUXWAFYTSFQKEKMOT/graph.json","events_json":"https://pith.science/api/pith-number/5NM3SF2NZGUXWAFYTSFQKEKMOT/events.json","paper":"https://pith.science/paper/5NM3SF2N"},"agent_actions":{"view_html":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT","download_json":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT.json","view_paper":"https://pith.science/paper/5NM3SF2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2384&json=true","fetch_graph":"https://pith.science/api/pith-number/5NM3SF2NZGUXWAFYTSFQKEKMOT/graph.json","fetch_events":"https://pith.science/api/pith-number/5NM3SF2NZGUXWAFYTSFQKEKMOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/action/storage_attestation","attest_author":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/action/author_attestation","sign_citation":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/action/citation_signature","submit_replication":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/action/replication_record"}},"created_at":"2026-05-18T02:21:34.796695+00:00","updated_at":"2026-05-18T02:21:34.796695+00:00"}