{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:3RKT6DD72EKP3VECE7TEDJJPFZ","short_pith_number":"pith:3RKT6DD7","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"},"canonical_sha256":"dc553f0c7fd114fdd48227e641a52f2e612a72befa7d9b728776e07f16ef3af2","source":{"kind":"arxiv","id":"0706.0020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.0020","created_at":"2026-05-18T03:48:12Z"},{"alias_kind":"arxiv_version","alias_value":"0706.0020v1","created_at":"2026-05-18T03:48:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.0020","created_at":"2026-05-18T03:48:12Z"},{"alias_kind":"pith_short_12","alias_value":"3RKT6DD72EKP","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"3RKT6DD72EKP3VEC","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"3RKT6DD7","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:3RKT6DD72EKP3VECE7TEDJJPFZ","target":"record","payload":{"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"},"canonical_sha256":"dc553f0c7fd114fdd48227e641a52f2e612a72befa7d9b728776e07f16ef3af2","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"},"source_kind":"arxiv","source_id":"0706.0020","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:48:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBJVg9VpREl8TLRaai8Bv8U+s9bRuvwEZ/h8o/ibsGLFu/BolWdWSpZedk8uhaqOab7RC+Qdu+UZ3MVOI2/nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:45.961024Z"},"content_sha256":"52e0c82bcaf2724551e3f400d092ea06edd7d491a2252cae72a645679ec119f4","schema_version":"1.0","event_id":"sha256:52e0c82bcaf2724551e3f400d092ea06edd7d491a2252cae72a645679ec119f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:3RKT6DD72EKP3VECE7TEDJJPFZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:48:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzX58B/tRnt1lqnvF6D7ecEsDdrMkv11Gp4yZSAhuiYtc4R4pqZ/0S4NKkY8ixW3m/sIEo67jf9SKZgX9a2XCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:45.961423Z"},"content_sha256":"87eae3bbc629ce34394fc7027a6860e994823a0a9b9a5db88599b59ed480afe7","schema_version":"1.0","event_id":"sha256:87eae3bbc629ce34394fc7027a6860e994823a0a9b9a5db88599b59ed480afe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/bundle.json","state_url":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T20:26:45Z","links":{"resolver":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ","bundle":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/bundle.json","state":"https://pith.science/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RKT6DD72EKP3VECE7TEDJJPFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:3RKT6DD72EKP3VECE7TEDJJPFZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9e8b3d17f016baf8bacfb6932286a96d657eb5152f3f281ae2abe63b97edc33","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-31T21:06:32Z","title_canon_sha256":"10d0ba950b83a79561327df681a6fb9d523f696aa6973969d17d55d2da2e4091"},"schema_version":"1.0","source":{"id":"0706.0020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.0020","created_at":"2026-05-18T03:48:12Z"},{"alias_kind":"arxiv_version","alias_value":"0706.0020v1","created_at":"2026-05-18T03:48:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.0020","created_at":"2026-05-18T03:48:12Z"},{"alias_kind":"pith_short_12","alias_value":"3RKT6DD72EKP","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"3RKT6DD72EKP3VEC","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"3RKT6DD7","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:87eae3bbc629ce34394fc7027a6860e994823a0a9b9a5db88599b59ed480afe7","target":"graph","created_at":"2026-05-18T03:48:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"jr, Louis H. Kauffman, Samuel J. Lomonaco","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2007-05-31T21:06:32Z","title":"A 3-Stranded Quantum Algorithm for the Jones Polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.0020","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:52e0c82bcaf2724551e3f400d092ea06edd7d491a2252cae72a645679ec119f4","target":"record","created_at":"2026-05-18T03:48:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a9e8b3d17f016baf8bacfb6932286a96d657eb5152f3f281ae2abe63b97edc33","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-31T21:06:32Z","title_canon_sha256":"10d0ba950b83a79561327df681a6fb9d523f696aa6973969d17d55d2da2e4091"},"schema_version":"1.0","source":{"id":"0706.0020","kind":"arxiv","version":1}},"canonical_sha256":"dc553f0c7fd114fdd48227e641a52f2e612a72befa7d9b728776e07f16ef3af2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc553f0c7fd114fdd48227e641a52f2e612a72befa7d9b728776e07f16ef3af2","first_computed_at":"2026-05-18T03:48:12.361086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:12.361086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QtNaBE4XCTtsvFMiFTvV1bKePB10f7c0rB2Hyhw7oJnQ2kwbhX0jREfX0XWnKqOv/1kjARUZricm2VzdS5JgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:12.361840Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.0020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52e0c82bcaf2724551e3f400d092ea06edd7d491a2252cae72a645679ec119f4","sha256:87eae3bbc629ce34394fc7027a6860e994823a0a9b9a5db88599b59ed480afe7"],"state_sha256":"03a84a6308cc2aab1445100956e6db112c6c8ac1efacce05662eff1c9bb30a47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBUtPXPf/H8DVxQVTgtw6HfU6paCH+lva/3tNL+CIIWQIAkz7LsJ04nMMiatnMhSUyRUTmutctfv0ViE/1aXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:26:45.963448Z","bundle_sha256":"32ea1e2961458c2ffb331b9c36dc6684b6df02ad51729cd810691556de40d945"}}