{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3K3YV3OS6CAWQ2YLYOP3LOII4L","short_pith_number":"pith:3K3YV3OS","schema_version":"1.0","canonical_sha256":"dab78aedd2f081686b0bc39fb5b908e2d9e3fb0f88209aea20ba707affdc1a19","source":{"kind":"arxiv","id":"1001.0464","version":3},"attestation_state":"computed","paper":{"title":"Holant Problems for Regular Graphs with Complex Edge Functions","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Michael Kowalczyk","submitted_at":"2010-01-04T12:33:25Z","abstract_excerpt":"We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which allow us to prove that a pair of combinatorial gadgets in combination succeed in proving #P-hardness; and (3) algebraic symmetrization, which significantly lowers the symbolic complexity of the proof for computational complexity. With holographic reductions the classification theorem also applies to problems beyond the basic model."},"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":"1001.0464","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-01-04T12:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"f263d2e77520ca725cc2bb9f13eab64e86a26c1f72a963dc965fa1fa08a3ad7f","abstract_canon_sha256":"c1cc13202e48b45b59640b32686b6e6a05d6783a12c424f5636422eba592fb94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:02.625089Z","signature_b64":"v05ICwVyuO2ZmqkmQjGT+7YnwR+pmCD9XwtFFryJwlSK6WXAFxMJX5yrcKXbX3hsosXrbPIER3c/Dui5OFjCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dab78aedd2f081686b0bc39fb5b908e2d9e3fb0f88209aea20ba707affdc1a19","last_reissued_at":"2026-05-18T04:16:02.624280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:02.624280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Holant Problems for Regular Graphs with Complex Edge Functions","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Michael Kowalczyk","submitted_at":"2010-01-04T12:33:25Z","abstract_excerpt":"We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which allow us to prove that a pair of combinatorial gadgets in combination succeed in proving #P-hardness; and (3) algebraic symmetrization, which significantly lowers the symbolic complexity of the proof for computational complexity. With holographic reductions the classification theorem also applies to problems beyond the basic model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0464","kind":"arxiv","version":3},"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":"1001.0464","created_at":"2026-05-18T04:16:02.624427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0464v3","created_at":"2026-05-18T04:16:02.624427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0464","created_at":"2026-05-18T04:16:02.624427+00:00"},{"alias_kind":"pith_short_12","alias_value":"3K3YV3OS6CAW","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3K3YV3OS6CAWQ2YL","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3K3YV3OS","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/3K3YV3OS6CAWQ2YLYOP3LOII4L","json":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L.json","graph_json":"https://pith.science/api/pith-number/3K3YV3OS6CAWQ2YLYOP3LOII4L/graph.json","events_json":"https://pith.science/api/pith-number/3K3YV3OS6CAWQ2YLYOP3LOII4L/events.json","paper":"https://pith.science/paper/3K3YV3OS"},"agent_actions":{"view_html":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L","download_json":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L.json","view_paper":"https://pith.science/paper/3K3YV3OS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0464&json=true","fetch_graph":"https://pith.science/api/pith-number/3K3YV3OS6CAWQ2YLYOP3LOII4L/graph.json","fetch_events":"https://pith.science/api/pith-number/3K3YV3OS6CAWQ2YLYOP3LOII4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L/action/storage_attestation","attest_author":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L/action/author_attestation","sign_citation":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L/action/citation_signature","submit_replication":"https://pith.science/pith/3K3YV3OS6CAWQ2YLYOP3LOII4L/action/replication_record"}},"created_at":"2026-05-18T04:16:02.624427+00:00","updated_at":"2026-05-18T04:16:02.624427+00:00"}