{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2NWVR2FNHDZHQMWBFH64NAVAUY","short_pith_number":"pith:2NWVR2FN","schema_version":"1.0","canonical_sha256":"d36d58e8ad38f27832c129fdc682a0a620f6ad9aabd5914885ec31e853017778","source":{"kind":"arxiv","id":"1012.5659","version":1},"attestation_state":"computed","paper":{"title":"Non-negative Weighted #CSPs: An Effective Complexity Dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Pinyan Lu, Xi Chen","submitted_at":"2010-12-27T20:49:07Z","abstract_excerpt":"We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms and the celebrated dichotomy theorem for unweighted #CSP. Our dichotomy theorem gives a succinct criterion for tractability. If a set F of constraint functions satisfies the criterion, then the counting CSP problem defined by F is solvable in polynomial time; if it does not satisfy the criterion, then the problem is #P-hard. We furthermore show that the quest"},"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":"1012.5659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-27T20:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"2269d0d674eac9dac14a2b537b899ee185901cc85a75d8aef17874dcc02bd82b","abstract_canon_sha256":"219813ee23086a3ac8230cfd4d1b66e8b6f7be7be349cd7201d23469b073b2b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:22.656478Z","signature_b64":"Qy+UhOeyCii/K0O8OmfU+bz9BKnDYB5YaJaM9jCvLyJoGBlzVbQIPSGvopoIENN7+mT3nkmLsS2mwNOgNkQoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d36d58e8ad38f27832c129fdc682a0a620f6ad9aabd5914885ec31e853017778","last_reissued_at":"2026-05-18T04:32:22.655763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:22.655763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-negative Weighted #CSPs: An Effective Complexity Dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Pinyan Lu, Xi Chen","submitted_at":"2010-12-27T20:49:07Z","abstract_excerpt":"We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms and the celebrated dichotomy theorem for unweighted #CSP. Our dichotomy theorem gives a succinct criterion for tractability. If a set F of constraint functions satisfies the criterion, then the counting CSP problem defined by F is solvable in polynomial time; if it does not satisfy the criterion, then the problem is #P-hard. We furthermore show that the quest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5659","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":"1012.5659","created_at":"2026-05-18T04:32:22.655858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5659v1","created_at":"2026-05-18T04:32:22.655858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5659","created_at":"2026-05-18T04:32:22.655858+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NWVR2FNHDZH","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NWVR2FNHDZHQMWB","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NWVR2FN","created_at":"2026-05-18T12:26:03.138858+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/2NWVR2FNHDZHQMWBFH64NAVAUY","json":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY.json","graph_json":"https://pith.science/api/pith-number/2NWVR2FNHDZHQMWBFH64NAVAUY/graph.json","events_json":"https://pith.science/api/pith-number/2NWVR2FNHDZHQMWBFH64NAVAUY/events.json","paper":"https://pith.science/paper/2NWVR2FN"},"agent_actions":{"view_html":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY","download_json":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY.json","view_paper":"https://pith.science/paper/2NWVR2FN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5659&json=true","fetch_graph":"https://pith.science/api/pith-number/2NWVR2FNHDZHQMWBFH64NAVAUY/graph.json","fetch_events":"https://pith.science/api/pith-number/2NWVR2FNHDZHQMWBFH64NAVAUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY/action/storage_attestation","attest_author":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY/action/author_attestation","sign_citation":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY/action/citation_signature","submit_replication":"https://pith.science/pith/2NWVR2FNHDZHQMWBFH64NAVAUY/action/replication_record"}},"created_at":"2026-05-18T04:32:22.655858+00:00","updated_at":"2026-05-18T04:32:22.655858+00:00"}