{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OOGRBAJI2WEBEQD3NNQPZMFGTJ","short_pith_number":"pith:OOGRBAJI","canonical_record":{"source":{"id":"1603.07046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-23T01:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"5b4a987799fd919b03226a76ab43a702375cc0748c200cea2135a62c8112c86c","abstract_canon_sha256":"2be7b3af4f32607aa081801503f5ad16e0d8e1bcccf02b7a09260f34ee695eef"},"schema_version":"1.0"},"canonical_sha256":"738d108128d58812407b6b60fcb0a69a5318c230bf092981db0449abc357cede","source":{"kind":"arxiv","id":"1603.07046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07046","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07046v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07046","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"OOGRBAJI2WEB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOGRBAJI2WEBEQD3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOGRBAJI","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OOGRBAJI2WEBEQD3NNQPZMFGTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-23T01:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"5b4a987799fd919b03226a76ab43a702375cc0748c200cea2135a62c8112c86c","abstract_canon_sha256":"2be7b3af4f32607aa081801503f5ad16e0d8e1bcccf02b7a09260f34ee695eef"},"schema_version":"1.0"},"canonical_sha256":"738d108128d58812407b6b60fcb0a69a5318c230bf092981db0449abc357cede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:24.611633Z","signature_b64":"gLxl+wwFfVp4NIg8sNjbtPfKdwg47HqZbqREF9mN2HZwxDySnSis67kI6ssYJfX4jlio2HT/QIbnfxGdu4yJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"738d108128d58812407b6b60fcb0a69a5318c230bf092981db0449abc357cede","last_reissued_at":"2026-05-18T01:18:24.611129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:24.611129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07046","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-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFZbXI4xrbAKkv7zullkWgtPXYgzvweni4DfZBxh1w+5qCJ71kn2kuRe/13pDV96JBI5wNNrsXYEw8NLes8IDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:50:40.794570Z"},"content_sha256":"39ec37dbfa4d15c3bfb12eebbcf12a241b9fe8194bd77ec6d186ddc3815d48d9","schema_version":"1.0","event_id":"sha256:39ec37dbfa4d15c3bfb12eebbcf12a241b9fe8194bd77ec6d186ddc3815d48d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OOGRBAJI2WEBEQD3NNQPZMFGTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Holographic Algorithm with Matchgates Is Universal for Planar $\\#$CSP Over Boolean Domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Zhiguo Fu","submitted_at":"2016-03-23T01:57:37Z","abstract_excerpt":"We prove a complexity classification theorem that classifies all counting constraint satisfaction problems ($\\#$CSP) over Boolean variables into exactly three categories: (1) Polynomial-time tractable; (2) $\\#$P-hard for general instances, but solvable in polynomial-time over planar graphs; and (3) $\\#$P-hard over planar graphs. The classification applies to all sets of local, not necessarily symmetric, constraint functions on Boolean variables that take complex values. It is shown that Valiant's holographic algorithm with matchgates is a universal strategy for all problems in category (2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07046","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-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+ZikBLVRWnHTbuaib7JcG8vX2j5BecQ9rdanKjtPu2ZynaGE3n68Q7XaYdP6j12iZOukPKOj1PS62uSXAzQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:50:40.794925Z"},"content_sha256":"fe3f76494762d8c10c74813188d53fafe2b83d2511afafc56b5ff371c16be36b","schema_version":"1.0","event_id":"sha256:fe3f76494762d8c10c74813188d53fafe2b83d2511afafc56b5ff371c16be36b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOGRBAJI2WEBEQD3NNQPZMFGTJ/bundle.json","state_url":"https://pith.science/pith/OOGRBAJI2WEBEQD3NNQPZMFGTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOGRBAJI2WEBEQD3NNQPZMFGTJ/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-03T17:50:40Z","links":{"resolver":"https://pith.science/pith/OOGRBAJI2WEBEQD3NNQPZMFGTJ","bundle":"https://pith.science/pith/OOGRBAJI2WEBEQD3NNQPZMFGTJ/bundle.json","state":"https://pith.science/pith/OOGRBAJI2WEBEQD3NNQPZMFGTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOGRBAJI2WEBEQD3NNQPZMFGTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OOGRBAJI2WEBEQD3NNQPZMFGTJ","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":"2be7b3af4f32607aa081801503f5ad16e0d8e1bcccf02b7a09260f34ee695eef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-23T01:57:37Z","title_canon_sha256":"5b4a987799fd919b03226a76ab43a702375cc0748c200cea2135a62c8112c86c"},"schema_version":"1.0","source":{"id":"1603.07046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07046","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07046v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07046","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"OOGRBAJI2WEB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOGRBAJI2WEBEQD3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOGRBAJI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:fe3f76494762d8c10c74813188d53fafe2b83d2511afafc56b5ff371c16be36b","target":"graph","created_at":"2026-05-18T01:18:24Z","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 prove a complexity classification theorem that classifies all counting constraint satisfaction problems ($\\#$CSP) over Boolean variables into exactly three categories: (1) Polynomial-time tractable; (2) $\\#$P-hard for general instances, but solvable in polynomial-time over planar graphs; and (3) $\\#$P-hard over planar graphs. The classification applies to all sets of local, not necessarily symmetric, constraint functions on Boolean variables that take complex values. It is shown that Valiant's holographic algorithm with matchgates is a universal strategy for all problems in category (2).","authors_text":"Jin-Yi Cai, Zhiguo Fu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-23T01:57:37Z","title":"Holographic Algorithm with Matchgates Is Universal for Planar $\\#$CSP Over Boolean Domain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07046","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:39ec37dbfa4d15c3bfb12eebbcf12a241b9fe8194bd77ec6d186ddc3815d48d9","target":"record","created_at":"2026-05-18T01:18:24Z","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":"2be7b3af4f32607aa081801503f5ad16e0d8e1bcccf02b7a09260f34ee695eef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-23T01:57:37Z","title_canon_sha256":"5b4a987799fd919b03226a76ab43a702375cc0748c200cea2135a62c8112c86c"},"schema_version":"1.0","source":{"id":"1603.07046","kind":"arxiv","version":1}},"canonical_sha256":"738d108128d58812407b6b60fcb0a69a5318c230bf092981db0449abc357cede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"738d108128d58812407b6b60fcb0a69a5318c230bf092981db0449abc357cede","first_computed_at":"2026-05-18T01:18:24.611129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:24.611129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLxl+wwFfVp4NIg8sNjbtPfKdwg47HqZbqREF9mN2HZwxDySnSis67kI6ssYJfX4jlio2HT/QIbnfxGdu4yJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:24.611633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39ec37dbfa4d15c3bfb12eebbcf12a241b9fe8194bd77ec6d186ddc3815d48d9","sha256:fe3f76494762d8c10c74813188d53fafe2b83d2511afafc56b5ff371c16be36b"],"state_sha256":"65e3a024874f87336d35d46e098366076c68729ac52f90d64d92e88fb5461cd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SAUrh4kKuG0ybWLMdJLVzY3OPVOYtB+g7HQeizbAXPl1XhDwtU2GNVBXZoCAmuvSA3RI9TIKEnSxXNsBLzdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:50:40.796838Z","bundle_sha256":"7371d21a85ecf434049379c1bbd5f4d23a408e8cd4b3c2e6a35821f4969ba483"}}