{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:XIJ6PJSYVKILA2YDZCPFRWXXD5","short_pith_number":"pith:XIJ6PJSY","schema_version":"1.0","canonical_sha256":"ba13e7a658aa90b06b03c89e58daf71f665ff58d4d8a788395c7c58be17aef10","source":{"kind":"arxiv","id":"quant-ph/0702008","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Elad Eban, Itai Arad, Zeph Landau","submitted_at":"2007-02-01T11:35:49Z","abstract_excerpt":"In the first 36 pages of this paper, we provide polynomial quantum algorithms for additive approximations of the Tutte polynomial, at any point in the Tutte plane, for any planar graph. This includes as special cases the AJL algorithm for the Jones polynomial, the partition function of the Potts model for any weighted planer graph at any temperature, and many other combinatorial graph properties. In the second part of the paper we prove the quantum universality of many of the problems for which we provide an algorithm, thus providing a large set of new quantum-complete problems. Unfortunately,"},"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":"quant-ph/0702008","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-02-01T11:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"9b11e60bea223d1ecfd7f9e35c799408c31f9caec37170bb2ebf0b34fa9c9ebd","abstract_canon_sha256":"f9ed37cdeeaa2c0c08444eddf7a4afc5c247578518fad92b1623885662584a85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:59:12.210813Z","signature_b64":"mAAYuEYo3IQwCtGI1LcaGUv/PfiONk1JILX5Y2hiEejnVh566IlH1+8cwf9H5Hq2nrR1nDF3dQEYDtTXN2ggDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba13e7a658aa90b06b03c89e58daf71f665ff58d4d8a788395c7c58be17aef10","last_reissued_at":"2026-07-04T14:59:12.210444Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:59:12.210444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Elad Eban, Itai Arad, Zeph Landau","submitted_at":"2007-02-01T11:35:49Z","abstract_excerpt":"In the first 36 pages of this paper, we provide polynomial quantum algorithms for additive approximations of the Tutte polynomial, at any point in the Tutte plane, for any planar graph. This includes as special cases the AJL algorithm for the Jones polynomial, the partition function of the Potts model for any weighted planer graph at any temperature, and many other combinatorial graph properties. In the second part of the paper we prove the quantum universality of many of the problems for which we provide an algorithm, thus providing a large set of new quantum-complete problems. Unfortunately,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0702008","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0702008/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"quant-ph/0702008","created_at":"2026-07-04T14:59:12.210509+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0702008v1","created_at":"2026-07-04T14:59:12.210509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0702008","created_at":"2026-07-04T14:59:12.210509+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIJ6PJSYVKIL","created_at":"2026-07-04T14:59:12.210509+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIJ6PJSYVKILA2YD","created_at":"2026-07-04T14:59:12.210509+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIJ6PJSY","created_at":"2026-07-04T14:59:12.210509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":209,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14052","citing_title":"From coupled $\\mathbb{Z}_3$ Rabi models to the $\\mathbb{Z}_3$ Potts model","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5","json":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5.json","graph_json":"https://pith.science/api/pith-number/XIJ6PJSYVKILA2YDZCPFRWXXD5/graph.json","events_json":"https://pith.science/api/pith-number/XIJ6PJSYVKILA2YDZCPFRWXXD5/events.json","paper":"https://pith.science/paper/XIJ6PJSY"},"agent_actions":{"view_html":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5","download_json":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5.json","view_paper":"https://pith.science/paper/XIJ6PJSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0702008&json=true","fetch_graph":"https://pith.science/api/pith-number/XIJ6PJSYVKILA2YDZCPFRWXXD5/graph.json","fetch_events":"https://pith.science/api/pith-number/XIJ6PJSYVKILA2YDZCPFRWXXD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5/action/storage_attestation","attest_author":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5/action/author_attestation","sign_citation":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5/action/citation_signature","submit_replication":"https://pith.science/pith/XIJ6PJSYVKILA2YDZCPFRWXXD5/action/replication_record"}},"created_at":"2026-07-04T14:59:12.210509+00:00","updated_at":"2026-07-04T14:59:12.210509+00:00"}