{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:K6AM4VH3VOSQH5PO6QCTXQ35DG","short_pith_number":"pith:K6AM4VH3","schema_version":"1.0","canonical_sha256":"5780ce54fbaba503f5eef4053bc37d19bab04d55793968ee0c890faad4268e9f","source":{"kind":"arxiv","id":"quant-ph/0511096","version":2},"attestation_state":"computed","paper":{"title":"A Polynomial Quantum Algorithm for Approximating the Jones Polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Vaughan Jones, Zeph Landau","submitted_at":"2005-11-09T20:08:32Z","abstract_excerpt":"The Jones polynomial, discovered in 1984, is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten) to be intimately connected to Topological Quantum Field Theory (TQFT). The works of Freedman, Kitaev, Larsen and Wang provide an efficient simulation of TQFT by a quantum computer, and vice versa. These results implicitly imply the existence of an efficient quantum algorithm that provides a certain additive approximation of the Jones polynomial at the fifth root of unity, e^{2\\pi i/5}, and moreover, that this pr"},"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/0511096","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-11-09T20:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"8c02d9e0c2aab440a37067923abacbd0808edc25db2a5357f77267e10f81f53e","abstract_canon_sha256":"e5719bbc86e1f5d5107d7aa7c757b6caeee6fea50fd9b002fe0152712edc57b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:51:50.856330Z","signature_b64":"B8R+j4UngnyGiM+NfQLqJpxO9AMjGegg7rM7J2j7jHwGpd64Wec7IJmLRLf6wcu0DBl3F5R7BacecclIYtSnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5780ce54fbaba503f5eef4053bc37d19bab04d55793968ee0c890faad4268e9f","last_reissued_at":"2026-07-04T14:51:50.855941Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:51:50.855941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial Quantum Algorithm for Approximating the Jones Polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Vaughan Jones, Zeph Landau","submitted_at":"2005-11-09T20:08:32Z","abstract_excerpt":"The Jones polynomial, discovered in 1984, is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten) to be intimately connected to Topological Quantum Field Theory (TQFT). The works of Freedman, Kitaev, Larsen and Wang provide an efficient simulation of TQFT by a quantum computer, and vice versa. These results implicitly imply the existence of an efficient quantum algorithm that provides a certain additive approximation of the Jones polynomial at the fifth root of unity, e^{2\\pi i/5}, and moreover, that this pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0511096","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0511096/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/0511096","created_at":"2026-07-04T14:51:50.856009+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0511096v2","created_at":"2026-07-04T14:51:50.856009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0511096","created_at":"2026-07-04T14:51:50.856009+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6AM4VH3VOSQ","created_at":"2026-07-04T14:51:50.856009+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6AM4VH3VOSQH5PO","created_at":"2026-07-04T14:51:50.856009+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6AM4VH3","created_at":"2026-07-04T14:51:50.856009+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2604.20512","citing_title":"Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":210,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04540","citing_title":"Hierarchical entanglement transitions and hidden area-law sectors in quantum many-body dynamics","ref_index":72,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20513","citing_title":"Constrained Optimal Polynomials for Quantum Linear System Solvers","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG","json":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG.json","graph_json":"https://pith.science/api/pith-number/K6AM4VH3VOSQH5PO6QCTXQ35DG/graph.json","events_json":"https://pith.science/api/pith-number/K6AM4VH3VOSQH5PO6QCTXQ35DG/events.json","paper":"https://pith.science/paper/K6AM4VH3"},"agent_actions":{"view_html":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG","download_json":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG.json","view_paper":"https://pith.science/paper/K6AM4VH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0511096&json=true","fetch_graph":"https://pith.science/api/pith-number/K6AM4VH3VOSQH5PO6QCTXQ35DG/graph.json","fetch_events":"https://pith.science/api/pith-number/K6AM4VH3VOSQH5PO6QCTXQ35DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG/action/storage_attestation","attest_author":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG/action/author_attestation","sign_citation":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG/action/citation_signature","submit_replication":"https://pith.science/pith/K6AM4VH3VOSQH5PO6QCTXQ35DG/action/replication_record"}},"created_at":"2026-07-04T14:51:50.856009+00:00","updated_at":"2026-07-04T14:51:50.856009+00:00"}