{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5NM3SF2NZGUXWAFYTSFQKEKMOT","short_pith_number":"pith:5NM3SF2N","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"},"canonical_sha256":"eb59b9174dc9a97b00b89c8b05114c74cf4562745b13d3f60b9500e33af6c1e4","source":{"kind":"arxiv","id":"1111.2384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2384","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2384v1","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2384","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"5NM3SF2NZGUX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5NM3SF2NZGUXWAFY","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5NM3SF2N","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5NM3SF2NZGUXWAFYTSFQKEKMOT","target":"record","payload":{"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"},"canonical_sha256":"eb59b9174dc9a97b00b89c8b05114c74cf4562745b13d3f60b9500e33af6c1e4","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"},"source_kind":"arxiv","source_id":"1111.2384","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TRgmQXUEn/IBLugSyP0+js9oUFHFGZqTpSclLLTvQN408nx4N4gKtruNFASqRCEJ5IR5tYLtYWm1NHxq6bdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:19:32.871072Z"},"content_sha256":"5e7b971b226e1520122b63d6e7424770145514f63a0f19a86ee8dba87406c605","schema_version":"1.0","event_id":"sha256:5e7b971b226e1520122b63d6e7424770145514f63a0f19a86ee8dba87406c605"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5NM3SF2NZGUXWAFYTSFQKEKMOT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dk3dNNCpDsFecafGT2Nn3mf9Hn4L1y9xnMAHQFt0zoFwZfgKdjHzHp9KQoRonlG3PvBURgiBXZa7PXNLeXV8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:19:32.871455Z"},"content_sha256":"57eb3df68e14e1a069b84c5cf73d320cfdfa5d8ba6820721663f5451c5eb2b1d","schema_version":"1.0","event_id":"sha256:57eb3df68e14e1a069b84c5cf73d320cfdfa5d8ba6820721663f5451c5eb2b1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/bundle.json","state_url":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T19:19:32Z","links":{"resolver":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT","bundle":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/bundle.json","state":"https://pith.science/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NM3SF2NZGUXWAFYTSFQKEKMOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5NM3SF2NZGUXWAFYTSFQKEKMOT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"71f2af9efc0865ff8d489e96885031e7f7655ec7b8f09190eb95c63e10e97f20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-10T02:42:57Z","title_canon_sha256":"9eb1488fcbaf8646a77debb7c7854d37e3012d6d72045777b53b74ab99ef688c"},"schema_version":"1.0","source":{"id":"1111.2384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2384","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2384v1","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2384","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"5NM3SF2NZGUX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5NM3SF2NZGUXWAFY","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5NM3SF2N","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:57eb3df68e14e1a069b84c5cf73d320cfdfa5d8ba6820721663f5451c5eb2b1d","target":"graph","created_at":"2026-05-18T02:21:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Jin-Yi Cai, Xi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-10T02:42:57Z","title":"Complexity of Counting CSP with Complex Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2384","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5e7b971b226e1520122b63d6e7424770145514f63a0f19a86ee8dba87406c605","target":"record","created_at":"2026-05-18T02:21:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"71f2af9efc0865ff8d489e96885031e7f7655ec7b8f09190eb95c63e10e97f20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-10T02:42:57Z","title_canon_sha256":"9eb1488fcbaf8646a77debb7c7854d37e3012d6d72045777b53b74ab99ef688c"},"schema_version":"1.0","source":{"id":"1111.2384","kind":"arxiv","version":1}},"canonical_sha256":"eb59b9174dc9a97b00b89c8b05114c74cf4562745b13d3f60b9500e33af6c1e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb59b9174dc9a97b00b89c8b05114c74cf4562745b13d3f60b9500e33af6c1e4","first_computed_at":"2026-05-18T02:21:34.796616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:34.796616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9VPlRgNe6ohQhJq6EhdifAh3OGMChK0Ir+N6NfIMe/EPGuAjkCQwgBw4DVb9AIYrvAkS93fN4uX9ky5WvcAHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:34.797100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.2384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e7b971b226e1520122b63d6e7424770145514f63a0f19a86ee8dba87406c605","sha256:57eb3df68e14e1a069b84c5cf73d320cfdfa5d8ba6820721663f5451c5eb2b1d"],"state_sha256":"62c5e08a3ed390e67a1feb9e923880420c2c31348b0c7c6a5d0fd4fc30a8cfd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yi+um829OXRFZ+KQtpqmEd/H/FkpcWB0gLq8adBZpXjm192MAJnszgQzSyZt3h9VOGgJ0EjIJFMv5cNsXQqwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:19:32.873435Z","bundle_sha256":"c6c1b9e25da0fa33bb0ac3a468a0102a2bc8f3dadfd1e0907416fe2753d468aa"}}