{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4F2CR5IADV3RBY6TRRUHXW5JEY","short_pith_number":"pith:4F2CR5IA","schema_version":"1.0","canonical_sha256":"e17428f5001d7710e3d38c687bdba9262d5887038ed8c839ef30ae3421713aaa","source":{"kind":"arxiv","id":"1303.7179","version":1},"attestation_state":"computed","paper":{"title":"Efficient Computation of the Kauffman Bracket","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Gabriella Newman, Jonathan Shi, Lauren Ellenberg, Stephen Sawin","submitted_at":"2013-03-28T17:00:19Z","abstract_excerpt":"This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with $g$ boundary points and $n$ crossings in the Kauffman bracket skein module is a linear combination of $O(2^g)$ basis elements, with each coefficient a polynomial with at most $n$ nonzero terms, each with integer coefficients, and that the link can be built one crossing at a time as a sequence of tangles with maximum number of boundary points bounded by $C\\sqrt{n}$ for some $C.$ From this it follows that the "},"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":"1303.7179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-03-28T17:00:19Z","cross_cats_sorted":[],"title_canon_sha256":"6748c17f2062bfaf7c7920e8bdf84f65bdeb53b95123d9b9e84b577e956b1966","abstract_canon_sha256":"4baab84444f002cc5a10bb2f25609ae44f134c7413d28d3b0a7fe3b2c7e30931"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:38.098859Z","signature_b64":"WtV2rPfgguK4A0DUXk+Wy2YukhpGNOsPf9DEAkFin58HYANjKceZHc+w0kY/XX0K5ZPGS3TRk38eQ2rj765GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e17428f5001d7710e3d38c687bdba9262d5887038ed8c839ef30ae3421713aaa","last_reissued_at":"2026-05-18T03:29:38.098208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:38.098208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Computation of the Kauffman Bracket","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Gabriella Newman, Jonathan Shi, Lauren Ellenberg, Stephen Sawin","submitted_at":"2013-03-28T17:00:19Z","abstract_excerpt":"This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with $g$ boundary points and $n$ crossings in the Kauffman bracket skein module is a linear combination of $O(2^g)$ basis elements, with each coefficient a polynomial with at most $n$ nonzero terms, each with integer coefficients, and that the link can be built one crossing at a time as a sequence of tangles with maximum number of boundary points bounded by $C\\sqrt{n}$ for some $C.$ From this it follows that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7179","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":"1303.7179","created_at":"2026-05-18T03:29:38.098328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.7179v1","created_at":"2026-05-18T03:29:38.098328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7179","created_at":"2026-05-18T03:29:38.098328+00:00"},{"alias_kind":"pith_short_12","alias_value":"4F2CR5IADV3R","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4F2CR5IADV3RBY6T","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4F2CR5IA","created_at":"2026-05-18T12:27:32.513160+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/4F2CR5IADV3RBY6TRRUHXW5JEY","json":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY.json","graph_json":"https://pith.science/api/pith-number/4F2CR5IADV3RBY6TRRUHXW5JEY/graph.json","events_json":"https://pith.science/api/pith-number/4F2CR5IADV3RBY6TRRUHXW5JEY/events.json","paper":"https://pith.science/paper/4F2CR5IA"},"agent_actions":{"view_html":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY","download_json":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY.json","view_paper":"https://pith.science/paper/4F2CR5IA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.7179&json=true","fetch_graph":"https://pith.science/api/pith-number/4F2CR5IADV3RBY6TRRUHXW5JEY/graph.json","fetch_events":"https://pith.science/api/pith-number/4F2CR5IADV3RBY6TRRUHXW5JEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/action/storage_attestation","attest_author":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/action/author_attestation","sign_citation":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/action/citation_signature","submit_replication":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/action/replication_record"}},"created_at":"2026-05-18T03:29:38.098328+00:00","updated_at":"2026-05-18T03:29:38.098328+00:00"}