{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YDQXATAILAVVCJNSYG6AMSLWTW","short_pith_number":"pith:YDQXATAI","schema_version":"1.0","canonical_sha256":"c0e1704c08582b5125b2c1bc0649769d9f2c6fa16fe6145ca6583135bffabe37","source":{"kind":"arxiv","id":"1505.02993","version":1},"attestation_state":"computed","paper":{"title":"A Holant Dichotomy: Is the FKT Algorithm Universal?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Heng Guo, Jin-Yi Cai, Tyson Williams, Zhiguo Fu","submitted_at":"2015-05-12T13:08:25Z","abstract_excerpt":"We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. This dichotomy is specifically to answer the question: Is the FKT algorithm under a holographic transformation a \\emph{universal} strategy to obtain polynomial-time algorithms for problems over planar graphs that are intractable in general? This dichotomy is a culmination of previous ones, including those for Spin Systems, Holant, and #CSP. A recurring theme has been that a holographic reduction to FKT is a universal strategy. Surprisingly, for plan"},"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":"1505.02993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-12T13:08:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0be0cda20fa0849c03e97e03ff93c8c5437b6e95e04018ab4bcc469577b492fa","abstract_canon_sha256":"f7389443ba70eed62849a5e07eb52330747b15f6f73988a70f6f37eb2d18bbec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:15.340827Z","signature_b64":"v1JmRMXqcpX9Mf9KuhB/xb/vZD/Rcjz6GWbN1c2ible76PuOxo+bpzsZeCDKGk5vuWn2ILmjyndc1SQi68cyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e1704c08582b5125b2c1bc0649769d9f2c6fa16fe6145ca6583135bffabe37","last_reissued_at":"2026-05-18T02:14:15.340028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:15.340028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Holant Dichotomy: Is the FKT Algorithm Universal?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Heng Guo, Jin-Yi Cai, Tyson Williams, Zhiguo Fu","submitted_at":"2015-05-12T13:08:25Z","abstract_excerpt":"We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. This dichotomy is specifically to answer the question: Is the FKT algorithm under a holographic transformation a \\emph{universal} strategy to obtain polynomial-time algorithms for problems over planar graphs that are intractable in general? This dichotomy is a culmination of previous ones, including those for Spin Systems, Holant, and #CSP. A recurring theme has been that a holographic reduction to FKT is a universal strategy. Surprisingly, for plan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02993","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02993","created_at":"2026-05-18T02:14:15.340171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02993v1","created_at":"2026-05-18T02:14:15.340171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02993","created_at":"2026-05-18T02:14:15.340171+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDQXATAILAVV","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDQXATAILAVVCJNS","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDQXATAI","created_at":"2026-05-18T12:29:50.041715+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/YDQXATAILAVVCJNSYG6AMSLWTW","json":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW.json","graph_json":"https://pith.science/api/pith-number/YDQXATAILAVVCJNSYG6AMSLWTW/graph.json","events_json":"https://pith.science/api/pith-number/YDQXATAILAVVCJNSYG6AMSLWTW/events.json","paper":"https://pith.science/paper/YDQXATAI"},"agent_actions":{"view_html":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW","download_json":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW.json","view_paper":"https://pith.science/paper/YDQXATAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02993&json=true","fetch_graph":"https://pith.science/api/pith-number/YDQXATAILAVVCJNSYG6AMSLWTW/graph.json","fetch_events":"https://pith.science/api/pith-number/YDQXATAILAVVCJNSYG6AMSLWTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW/action/storage_attestation","attest_author":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW/action/author_attestation","sign_citation":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW/action/citation_signature","submit_replication":"https://pith.science/pith/YDQXATAILAVVCJNSYG6AMSLWTW/action/replication_record"}},"created_at":"2026-05-18T02:14:15.340171+00:00","updated_at":"2026-05-18T02:14:15.340171+00:00"}