{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VO45V5SUE6ZYBTAKYM2ERZ4J7H","short_pith_number":"pith:VO45V5SU","schema_version":"1.0","canonical_sha256":"abb9daf65427b380cc0ac33448e789f9f3d55bff92aab15d17b82d35404e9b56","source":{"kind":"arxiv","id":"1702.00767","version":1},"attestation_state":"computed","paper":{"title":"A new Holant dichotomy inspired by quantum computation","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-02-02T18:01:03Z","abstract_excerpt":"Holant problems are a framework for the analysis of counting complexity problems on graphs. This framework is simultaneously general enough to encompass many other counting problems on graphs and specific enough to allow the derivation of dichotomy results, partitioning all problem instances into those which can be solved in polynomial time and those which are #P-hard. The Holant framework is based on the theory of holographic algorithms, which was originally inspired by concepts from quantum computation, but this connection appears not to have been explored before.\n  Here, we employ quantum i"},"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":"1702.00767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-02-02T18:01:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0d9bfc142d085fdc4c7080a7de527e07fe87029bc748ed4b3d659d92ffeafef5","abstract_canon_sha256":"27979e37cbfcde9274649902dac02a2955658ddb04f08cdf62c1269b3ff6c874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:30.889481Z","signature_b64":"TQnLmiftmXqOB9Ea5eKx3QJeYRt07xepcZuphyLpUIHHY4py5b4DK4sHSEoD8tjtHz6w5LbgMe46eGfSJi/BCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abb9daf65427b380cc0ac33448e789f9f3d55bff92aab15d17b82d35404e9b56","last_reissued_at":"2026-05-18T00:51:30.888875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:30.888875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new Holant dichotomy inspired by quantum computation","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-02-02T18:01:03Z","abstract_excerpt":"Holant problems are a framework for the analysis of counting complexity problems on graphs. This framework is simultaneously general enough to encompass many other counting problems on graphs and specific enough to allow the derivation of dichotomy results, partitioning all problem instances into those which can be solved in polynomial time and those which are #P-hard. The Holant framework is based on the theory of holographic algorithms, which was originally inspired by concepts from quantum computation, but this connection appears not to have been explored before.\n  Here, we employ quantum i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00767","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":"1702.00767","created_at":"2026-05-18T00:51:30.888969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00767v1","created_at":"2026-05-18T00:51:30.888969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00767","created_at":"2026-05-18T00:51:30.888969+00:00"},{"alias_kind":"pith_short_12","alias_value":"VO45V5SUE6ZY","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VO45V5SUE6ZYBTAK","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VO45V5SU","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05597","citing_title":"From an odd arity signature to a Holant dichotomy","ref_index":2009,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H","json":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H.json","graph_json":"https://pith.science/api/pith-number/VO45V5SUE6ZYBTAKYM2ERZ4J7H/graph.json","events_json":"https://pith.science/api/pith-number/VO45V5SUE6ZYBTAKYM2ERZ4J7H/events.json","paper":"https://pith.science/paper/VO45V5SU"},"agent_actions":{"view_html":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H","download_json":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H.json","view_paper":"https://pith.science/paper/VO45V5SU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00767&json=true","fetch_graph":"https://pith.science/api/pith-number/VO45V5SUE6ZYBTAKYM2ERZ4J7H/graph.json","fetch_events":"https://pith.science/api/pith-number/VO45V5SUE6ZYBTAKYM2ERZ4J7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H/action/storage_attestation","attest_author":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H/action/author_attestation","sign_citation":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H/action/citation_signature","submit_replication":"https://pith.science/pith/VO45V5SUE6ZYBTAKYM2ERZ4J7H/action/replication_record"}},"created_at":"2026-05-18T00:51:30.888969+00:00","updated_at":"2026-05-18T00:51:30.888969+00:00"}