{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:3RKT6DD72EKP3VECE7TEDJJPFZ","short_pith_number":"pith:3RKT6DD7","schema_version":"1.0","canonical_sha256":"dc553f0c7fd114fdd48227e641a52f2e612a72befa7d9b728776e07f16ef3af2","source":{"kind":"arxiv","id":"0706.0020","version":1},"attestation_state":"computed","paper":{"title":"A 3-Stranded Quantum Algorithm for the Jones Polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"jr, Louis H. Kauffman, Samuel J. Lomonaco","submitted_at":"2007-05-31T21:06:32Z","abstract_excerpt":"Let K be a 3-stranded knot (or link), and let L denote the number of crossings in K. Let $\\epsilon_{1}$ and $\\epsilon_{2}$ be two positive real numbers such that $\\epsilon_{2}$ is less than or equal to 1.\n  In this paper, we create two algorithms for computing the value of the Jones polynomial of K at all points $t=exp(i\\phi)$ of the unit circle in the complex plane such that the absolute value of $\\phi$ is less than or equal to $\\pi/3$.\n  The first algorithm, called the classical 3-stranded braid (3-SB) algorithm, is a classical deterministic algorithm that has time complexity O(L). The secon"},"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":"0706.0020","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-31T21:06:32Z","cross_cats_sorted":[],"title_canon_sha256":"10d0ba950b83a79561327df681a6fb9d523f696aa6973969d17d55d2da2e4091","abstract_canon_sha256":"a9e8b3d17f016baf8bacfb6932286a96d657eb5152f3f281ae2abe63b97edc33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:12.361840Z","signature_b64":"QtNaBE4XCTtsvFMiFTvV1bKePB10f7c0rB2Hyhw7oJnQ2kwbhX0jREfX0XWnKqOv/1kjARUZricm2VzdS5JgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc553f0c7fd114fdd48227e641a52f2e612a72befa7d9b728776e07f16ef3af2","last_reissued_at":"2026-05-18T03:48:12.361086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:12.361086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 3-Stranded Quantum Algorithm for the Jones Polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"jr, Louis H. Kauffman, Samuel J. Lomonaco","submitted_at":"2007-05-31T21:06:32Z","abstract_excerpt":"Let K be a 3-stranded knot (or link), and let L denote the number of crossings in K. Let $\\epsilon_{1}$ and $\\epsilon_{2}$ be two positive real numbers such that $\\epsilon_{2}$ is less than or equal to 1.\n  In this paper, we create two algorithms for computing the value of the Jones polynomial of K at all points $t=exp(i\\phi)$ of the unit circle in the complex plane such that the absolute value of $\\phi$ is less than or equal to $\\pi/3$.\n  The first algorithm, called the classical 3-stranded braid (3-SB) algorithm, is a classical deterministic algorithm that has time complexity O(L). The secon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.0020","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":"0706.0020","created_at":"2026-05-18T03:48:12.361173+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.0020v1","created_at":"2026-05-18T03:48:12.361173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.0020","created_at":"2026-05-18T03:48:12.361173+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RKT6DD72EKP","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RKT6DD72EKP3VEC","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RKT6DD7","created_at":"2026-05-18T12:25:54.717736+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/3RKT6DD72EKP3VECE7TEDJJPFZ","json":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ.json","graph_json":"https://pith.science/api/pith-number/3RKT6DD72EKP3VECE7TEDJJPFZ/graph.json","events_json":"https://pith.science/api/pith-number/3RKT6DD72EKP3VECE7TEDJJPFZ/events.json","paper":"https://pith.science/paper/3RKT6DD7"},"agent_actions":{"view_html":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ","download_json":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ.json","view_paper":"https://pith.science/paper/3RKT6DD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.0020&json=true","fetch_graph":"https://pith.science/api/pith-number/3RKT6DD72EKP3VECE7TEDJJPFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3RKT6DD72EKP3VECE7TEDJJPFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/action/storage_attestation","attest_author":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/action/author_attestation","sign_citation":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/action/citation_signature","submit_replication":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/action/replication_record"}},"created_at":"2026-05-18T03:48:12.361173+00:00","updated_at":"2026-05-18T03:48:12.361173+00:00"}