{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CZVDSRLELMQMV7IWQ2V642TX56","short_pith_number":"pith:CZVDSRLE","schema_version":"1.0","canonical_sha256":"166a3945645b20cafd1686abee6a77efaebf8fd96ed8d1a930b307f6e96a6fcb","source":{"kind":"arxiv","id":"1305.1409","version":2},"attestation_state":"computed","paper":{"title":"A Collapse Theorem for Holographic Algorithms with Matchgates on Domain Size at Most 4","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":"2013-05-07T05:19:48Z","abstract_excerpt":"Holographic algorithms with matchgates are a novel approach to design polynomial time computation. It uses Kasteleyn's algorithm for perfect matchings, and more importantly a holographic reduction . The two fundamental parameters of a holographic reduction are the domain size $k$ of the underlying problem, and the basis size $\\ell$. A holographic reduction transforms the computation to matchgates by a linear transformation that maps to (a tensor product space of) a linear space of dimension $2^{\\ell}$. We prove a sharp basis collapse theorem, that shows that for domain size 3 and 4, all non-tr"},"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":"1305.1409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-07T05:19:48Z","cross_cats_sorted":[],"title_canon_sha256":"e2b0a2d408e7877d94becab74936aa794631a51608c4c73a469d5b3a588b573e","abstract_canon_sha256":"e633d80d2ebfc5aec31861471d36cdb8c8e711f4fac8a4cd0dd61542e42d6211"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:24.701407Z","signature_b64":"/KMPOyVpI2ekGlq9S5vNsWRB48Ytsxhxyu6feAdrX6ScKaopV7rXic3SZYDxaAeNV+O/WjymrAM1c+sVW4L9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166a3945645b20cafd1686abee6a77efaebf8fd96ed8d1a930b307f6e96a6fcb","last_reissued_at":"2026-05-18T03:25:24.700666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:24.700666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Collapse Theorem for Holographic Algorithms with Matchgates on Domain Size at Most 4","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":"2013-05-07T05:19:48Z","abstract_excerpt":"Holographic algorithms with matchgates are a novel approach to design polynomial time computation. It uses Kasteleyn's algorithm for perfect matchings, and more importantly a holographic reduction . The two fundamental parameters of a holographic reduction are the domain size $k$ of the underlying problem, and the basis size $\\ell$. A holographic reduction transforms the computation to matchgates by a linear transformation that maps to (a tensor product space of) a linear space of dimension $2^{\\ell}$. We prove a sharp basis collapse theorem, that shows that for domain size 3 and 4, all non-tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1409","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":"1305.1409","created_at":"2026-05-18T03:25:24.700786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1409v2","created_at":"2026-05-18T03:25:24.700786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1409","created_at":"2026-05-18T03:25:24.700786+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZVDSRLELMQM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZVDSRLELMQMV7IW","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZVDSRLE","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/CZVDSRLELMQMV7IWQ2V642TX56","json":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56.json","graph_json":"https://pith.science/api/pith-number/CZVDSRLELMQMV7IWQ2V642TX56/graph.json","events_json":"https://pith.science/api/pith-number/CZVDSRLELMQMV7IWQ2V642TX56/events.json","paper":"https://pith.science/paper/CZVDSRLE"},"agent_actions":{"view_html":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56","download_json":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56.json","view_paper":"https://pith.science/paper/CZVDSRLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1409&json=true","fetch_graph":"https://pith.science/api/pith-number/CZVDSRLELMQMV7IWQ2V642TX56/graph.json","fetch_events":"https://pith.science/api/pith-number/CZVDSRLELMQMV7IWQ2V642TX56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56/action/storage_attestation","attest_author":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56/action/author_attestation","sign_citation":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56/action/citation_signature","submit_replication":"https://pith.science/pith/CZVDSRLELMQMV7IWQ2V642TX56/action/replication_record"}},"created_at":"2026-05-18T03:25:24.700786+00:00","updated_at":"2026-05-18T03:25:24.700786+00:00"}