{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2LZI5LKGXALBEE3MHRPDNK5T3K","short_pith_number":"pith:2LZI5LKG","schema_version":"1.0","canonical_sha256":"d2f28ead46b81612136c3c5e36abb3daada76739def370075763724fe90ba49a","source":{"kind":"arxiv","id":"1804.07910","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm to Compute the Colored Jones Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.QA","authors_text":"Jesse Levitt, Mustafa Hajij","submitted_at":"2018-04-21T07:51:25Z","abstract_excerpt":"The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along a braid model of the colored Jones polynomial that was refined by Armond from the work of Huynh and L\\^e. The walk model gives rise to ordered words in a $q$-Weyl algebra which we address and study from multiple perspectives. We provide a highly optimized Mathematica implementation that exploits the modern features of the software. We include a performance a"},"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":"1804.07910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.QA","submitted_at":"2018-04-21T07:51:25Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"6804e90d2fe9fcd26772be8e87c02a6b21a65c3acd68c8d2def9fce5800b2ed8","abstract_canon_sha256":"0893408e6a1244079770f3c028705f03518c01bcba13696d1f5762ec93805f48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:55.393857Z","signature_b64":"/BiBQaMTrqGOh3jTMlSif3Ye4k551DByllU2LZQWffouZ3I9Iw2AHpRi+KNoXpnVitpoXf0aNLGskM3poZHIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2f28ead46b81612136c3c5e36abb3daada76739def370075763724fe90ba49a","last_reissued_at":"2026-05-18T00:16:55.393199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:55.393199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm to Compute the Colored Jones Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.QA","authors_text":"Jesse Levitt, Mustafa Hajij","submitted_at":"2018-04-21T07:51:25Z","abstract_excerpt":"The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along a braid model of the colored Jones polynomial that was refined by Armond from the work of Huynh and L\\^e. The walk model gives rise to ordered words in a $q$-Weyl algebra which we address and study from multiple perspectives. We provide a highly optimized Mathematica implementation that exploits the modern features of the software. We include a performance a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07910","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":""},"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":"1804.07910","created_at":"2026-05-18T00:16:55.393295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07910v2","created_at":"2026-05-18T00:16:55.393295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07910","created_at":"2026-05-18T00:16:55.393295+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LZI5LKGXALB","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LZI5LKGXALBEE3M","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LZI5LKG","created_at":"2026-05-18T12:32:02.567920+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/2LZI5LKGXALBEE3MHRPDNK5T3K","json":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K.json","graph_json":"https://pith.science/api/pith-number/2LZI5LKGXALBEE3MHRPDNK5T3K/graph.json","events_json":"https://pith.science/api/pith-number/2LZI5LKGXALBEE3MHRPDNK5T3K/events.json","paper":"https://pith.science/paper/2LZI5LKG"},"agent_actions":{"view_html":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K","download_json":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K.json","view_paper":"https://pith.science/paper/2LZI5LKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07910&json=true","fetch_graph":"https://pith.science/api/pith-number/2LZI5LKGXALBEE3MHRPDNK5T3K/graph.json","fetch_events":"https://pith.science/api/pith-number/2LZI5LKGXALBEE3MHRPDNK5T3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K/action/storage_attestation","attest_author":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K/action/author_attestation","sign_citation":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K/action/citation_signature","submit_replication":"https://pith.science/pith/2LZI5LKGXALBEE3MHRPDNK5T3K/action/replication_record"}},"created_at":"2026-05-18T00:16:55.393295+00:00","updated_at":"2026-05-18T00:16:55.393295+00:00"}