{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4F2CR5IADV3RBY6TRRUHXW5JEY","short_pith_number":"pith:4F2CR5IA","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"},"canonical_sha256":"e17428f5001d7710e3d38c687bdba9262d5887038ed8c839ef30ae3421713aaa","source":{"kind":"arxiv","id":"1303.7179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7179","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7179v1","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7179","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"4F2CR5IADV3R","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4F2CR5IADV3RBY6T","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4F2CR5IA","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4F2CR5IADV3RBY6TRRUHXW5JEY","target":"record","payload":{"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"},"canonical_sha256":"e17428f5001d7710e3d38c687bdba9262d5887038ed8c839ef30ae3421713aaa","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"},"source_kind":"arxiv","source_id":"1303.7179","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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUOV2PgYBuNcCp6sNdsc2TJIGfaQjhJnLIc+ZwnvoVP7zSkU9IUQ1O0LyYPSfMNRISHG7MQprZDLwWniE6edCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:49:01.897759Z"},"content_sha256":"f759044c5c8301d6eb58f9d0421e2389e99db5da9524c2040bbf53d7fd9eae25","schema_version":"1.0","event_id":"sha256:f759044c5c8301d6eb58f9d0421e2389e99db5da9524c2040bbf53d7fd9eae25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4F2CR5IADV3RBY6TRRUHXW5JEY","target":"graph","payload":{"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"},"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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1KLOSidsvHWgaMRgeUzq6aexUZeQpOgiCVcbsfWAsVUCve3RGDu7C78CW3BZXgbBySXXCTNLdQYz/uBjr+UAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:49:01.898457Z"},"content_sha256":"fc1220b9a4749dd477765ba69fb02568c6830b53a711bfdbb6c379c9ffe2c385","schema_version":"1.0","event_id":"sha256:fc1220b9a4749dd477765ba69fb02568c6830b53a711bfdbb6c379c9ffe2c385"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/bundle.json","state_url":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/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-05-27T22:49:01Z","links":{"resolver":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY","bundle":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/bundle.json","state":"https://pith.science/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4F2CR5IADV3RBY6TRRUHXW5JEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4F2CR5IADV3RBY6TRRUHXW5JEY","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":"4baab84444f002cc5a10bb2f25609ae44f134c7413d28d3b0a7fe3b2c7e30931","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-03-28T17:00:19Z","title_canon_sha256":"6748c17f2062bfaf7c7920e8bdf84f65bdeb53b95123d9b9e84b577e956b1966"},"schema_version":"1.0","source":{"id":"1303.7179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7179","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7179v1","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7179","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"4F2CR5IADV3R","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4F2CR5IADV3RBY6T","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4F2CR5IA","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:fc1220b9a4749dd477765ba69fb02568c6830b53a711bfdbb6c379c9ffe2c385","target":"graph","created_at":"2026-05-18T03:29:38Z","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":"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 ","authors_text":"Gabriella Newman, Jonathan Shi, Lauren Ellenberg, Stephen Sawin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-03-28T17:00:19Z","title":"Efficient Computation of the Kauffman Bracket"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7179","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:f759044c5c8301d6eb58f9d0421e2389e99db5da9524c2040bbf53d7fd9eae25","target":"record","created_at":"2026-05-18T03:29:38Z","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":"4baab84444f002cc5a10bb2f25609ae44f134c7413d28d3b0a7fe3b2c7e30931","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-03-28T17:00:19Z","title_canon_sha256":"6748c17f2062bfaf7c7920e8bdf84f65bdeb53b95123d9b9e84b577e956b1966"},"schema_version":"1.0","source":{"id":"1303.7179","kind":"arxiv","version":1}},"canonical_sha256":"e17428f5001d7710e3d38c687bdba9262d5887038ed8c839ef30ae3421713aaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e17428f5001d7710e3d38c687bdba9262d5887038ed8c839ef30ae3421713aaa","first_computed_at":"2026-05-18T03:29:38.098208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:38.098208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WtV2rPfgguK4A0DUXk+Wy2YukhpGNOsPf9DEAkFin58HYANjKceZHc+w0kY/XX0K5ZPGS3TRk38eQ2rj765GAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:38.098859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f759044c5c8301d6eb58f9d0421e2389e99db5da9524c2040bbf53d7fd9eae25","sha256:fc1220b9a4749dd477765ba69fb02568c6830b53a711bfdbb6c379c9ffe2c385"],"state_sha256":"6e57a70478de6485a97c47203d914b2e6a8b7697236fd41975932081c97f99ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyOr+3QG2FHF6D0Szl0mAmEtAgdfB4/I8szWh2DDY9QV1JaMGZ1xH8kxTbwnCfsDp6yfKA5youQpoP0jGCc1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:49:01.903223Z","bundle_sha256":"b71ac0f8f77198add2ae9b7e74e7b3166819e9a8ecc48b35981c410fdc4572c7"}}