{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GPQICE6TQ2X7HCL7B75ZDYBHIM","short_pith_number":"pith:GPQICE6T","schema_version":"1.0","canonical_sha256":"33e08113d386aff3897f0ffb91e027432d2613860bb1fce590aeea6ac258d5da","source":{"kind":"arxiv","id":"1704.05798","version":2},"attestation_state":"computed","paper":{"title":"A complete dichotomy for complex-valued Holant^c","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Miriam Backens","submitted_at":"2017-04-19T16:13:05Z","abstract_excerpt":"Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, where any function set considered must contain the two unary functions pinning inputs to values 0 or 1. The complexity classification of Holant problems usually takes the form of dichotomy theorems, showing that for any set of functions in the family, the problem is either #P-hard or it can be solved in polynomial time. Previous such results include a dichotomy for real-valued Holant^c and one for Holant^c with complex "},"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":"1704.05798","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-19T16:13:05Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4c718e711cd02e79680ac61b6207de6f422719648f11f2ea381d32d6a916acb9","abstract_canon_sha256":"ae5260cd7da577948b8a95af0c67effc50d569f0b0fdda492613649903158ed2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:43.922854Z","signature_b64":"gU/TCWwUp06mcl5SKQmXv0Zt2hxY9IZcRv3d08VaruNoKHsp9xJONbEq1S9CFgKqYt2lKMWZFSYO4PeRR58BCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33e08113d386aff3897f0ffb91e027432d2613860bb1fce590aeea6ac258d5da","last_reissued_at":"2026-05-18T00:01:43.922306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:43.922306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complete dichotomy for complex-valued Holant^c","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Miriam Backens","submitted_at":"2017-04-19T16:13:05Z","abstract_excerpt":"Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, where any function set considered must contain the two unary functions pinning inputs to values 0 or 1. The complexity classification of Holant problems usually takes the form of dichotomy theorems, showing that for any set of functions in the family, the problem is either #P-hard or it can be solved in polynomial time. Previous such results include a dichotomy for real-valued Holant^c and one for Holant^c with complex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05798","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":"1704.05798","created_at":"2026-05-18T00:01:43.922395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05798v2","created_at":"2026-05-18T00:01:43.922395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05798","created_at":"2026-05-18T00:01:43.922395+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPQICE6TQ2X7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPQICE6TQ2X7HCL7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPQICE6T","created_at":"2026-05-18T12:31:18.294218+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/GPQICE6TQ2X7HCL7B75ZDYBHIM","json":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM.json","graph_json":"https://pith.science/api/pith-number/GPQICE6TQ2X7HCL7B75ZDYBHIM/graph.json","events_json":"https://pith.science/api/pith-number/GPQICE6TQ2X7HCL7B75ZDYBHIM/events.json","paper":"https://pith.science/paper/GPQICE6T"},"agent_actions":{"view_html":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM","download_json":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM.json","view_paper":"https://pith.science/paper/GPQICE6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05798&json=true","fetch_graph":"https://pith.science/api/pith-number/GPQICE6TQ2X7HCL7B75ZDYBHIM/graph.json","fetch_events":"https://pith.science/api/pith-number/GPQICE6TQ2X7HCL7B75ZDYBHIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM/action/storage_attestation","attest_author":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM/action/author_attestation","sign_citation":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM/action/citation_signature","submit_replication":"https://pith.science/pith/GPQICE6TQ2X7HCL7B75ZDYBHIM/action/replication_record"}},"created_at":"2026-05-18T00:01:43.922395+00:00","updated_at":"2026-05-18T00:01:43.922395+00:00"}