{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CUVNM7W4G5OSLDIEBCX7O5J3GA","short_pith_number":"pith:CUVNM7W4","schema_version":"1.0","canonical_sha256":"152ad67edc375d258d0408aff7753b301064649025b9cb87e903fd0fbe5d74f2","source":{"kind":"arxiv","id":"1307.7430","version":2},"attestation_state":"computed","paper":{"title":"Holographic Algorithms Beyond Matchgates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Heng Guo, Jin-Yi Cai, Tyson Williams","submitted_at":"2013-07-29T01:19:18Z","abstract_excerpt":"Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among problems with different descriptions via certain basis transformations. In this paper, we replace matchgates in the paradigm above by the affine type and the product type constraint functions, which are known to be tractable in general (not necessarily planar) graphs. More specifically, we present polynomial-time algorithms to decide if a given counting pro"},"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":"1307.7430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-29T01:19:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7ce3ddcb491f1e2bbe32211f8dc0770539c14e1ba54c32ea5df758916084f30d","abstract_canon_sha256":"9487240d5f2caf59b62ba101b276d36a193a0b4dd96c1fd33c867819c6c27239"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.701758Z","signature_b64":"89phvP+9rtxfBgvq9X9lMLfgO2up5Bbb4DUfzixcUUnJgW0nwyLkun0JgQo3O7lF+satcMVjKyNlLzdYIIWQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"152ad67edc375d258d0408aff7753b301064649025b9cb87e903fd0fbe5d74f2","last_reissued_at":"2026-05-18T00:26:18.701288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.701288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Holographic Algorithms Beyond Matchgates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Heng Guo, Jin-Yi Cai, Tyson Williams","submitted_at":"2013-07-29T01:19:18Z","abstract_excerpt":"Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among problems with different descriptions via certain basis transformations. In this paper, we replace matchgates in the paradigm above by the affine type and the product type constraint functions, which are known to be tractable in general (not necessarily planar) graphs. More specifically, we present polynomial-time algorithms to decide if a given counting pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7430","kind":"arxiv","version":2},"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":"1307.7430","created_at":"2026-05-18T00:26:18.701362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7430v2","created_at":"2026-05-18T00:26:18.701362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7430","created_at":"2026-05-18T00:26:18.701362+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUVNM7W4G5OS","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUVNM7W4G5OSLDIE","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUVNM7W4","created_at":"2026-05-18T12:27:40.988391+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/CUVNM7W4G5OSLDIEBCX7O5J3GA","json":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA.json","graph_json":"https://pith.science/api/pith-number/CUVNM7W4G5OSLDIEBCX7O5J3GA/graph.json","events_json":"https://pith.science/api/pith-number/CUVNM7W4G5OSLDIEBCX7O5J3GA/events.json","paper":"https://pith.science/paper/CUVNM7W4"},"agent_actions":{"view_html":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA","download_json":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA.json","view_paper":"https://pith.science/paper/CUVNM7W4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7430&json=true","fetch_graph":"https://pith.science/api/pith-number/CUVNM7W4G5OSLDIEBCX7O5J3GA/graph.json","fetch_events":"https://pith.science/api/pith-number/CUVNM7W4G5OSLDIEBCX7O5J3GA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA/action/storage_attestation","attest_author":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA/action/author_attestation","sign_citation":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA/action/citation_signature","submit_replication":"https://pith.science/pith/CUVNM7W4G5OSLDIEBCX7O5J3GA/action/replication_record"}},"created_at":"2026-05-18T00:26:18.701362+00:00","updated_at":"2026-05-18T00:26:18.701362+00:00"}