{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DIXEU7H4YPOWL6NI3Y45XADBMK","short_pith_number":"pith:DIXEU7H4","canonical_record":{"source":{"id":"2606.29662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-06-29T00:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"f08c3cda15a1b7be6d04316aa599e495704a9b630c268936b74b1d23406095b7","abstract_canon_sha256":"bc3b9776eced16c759e1a52ba7b73325dfccf9b6f903f94a56fb75b704120fef"},"schema_version":"1.0"},"canonical_sha256":"1a2e4a7cfcc3dd65f9a8de39db8061629c3c5cdf118b3f4a6baf8dc342010b78","source":{"kind":"arxiv","id":"2606.29662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29662","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29662v1","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29662","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"pith_short_12","alias_value":"DIXEU7H4YPOW","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"pith_short_16","alias_value":"DIXEU7H4YPOWL6NI","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"pith_short_8","alias_value":"DIXEU7H4","created_at":"2026-06-30T02:17:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DIXEU7H4YPOWL6NI3Y45XADBMK","target":"record","payload":{"canonical_record":{"source":{"id":"2606.29662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-06-29T00:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"f08c3cda15a1b7be6d04316aa599e495704a9b630c268936b74b1d23406095b7","abstract_canon_sha256":"bc3b9776eced16c759e1a52ba7b73325dfccf9b6f903f94a56fb75b704120fef"},"schema_version":"1.0"},"canonical_sha256":"1a2e4a7cfcc3dd65f9a8de39db8061629c3c5cdf118b3f4a6baf8dc342010b78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:29.327194Z","signature_b64":"tMiqAr5zrNwrm2Sg/1LmMA96UM2hqncGM1Se7eKsG2Y5M3Vme7zms0UzYVW3IH7tMp2iOpdJFCoLwb8sbb2vBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a2e4a7cfcc3dd65f9a8de39db8061629c3c5cdf118b3f4a6baf8dc342010b78","last_reissued_at":"2026-06-30T02:17:29.326567Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:29.326567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.29662","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-06-30T02:17:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INoizHtiZ39nF8uxQkZPnIEJ/ouEDr+kWBW1v3t81ZT1Bhiv2B3UxVhqzVXeCSAPT+P3uC8CmJL+Llh82rcdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:35:00.409979Z"},"content_sha256":"b558d6acc486de094dd68ae42f364486effa7687c4137d14beb525228b8a190e","schema_version":"1.0","event_id":"sha256:b558d6acc486de094dd68ae42f364486effa7687c4137d14beb525228b8a190e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DIXEU7H4YPOWL6NI3Y45XADBMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed-parameter tractable computation of Reshetikhin--Turaev knot polynomials via tensor networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Shana Yunsheng Li","submitted_at":"2026-06-29T00:12:48Z","abstract_excerpt":"We give a thorough analysis of the time complexity of computing Reshetikhin--Turaev knot polynomials via tensor contractions on the associated tensor networks, showing that the computation is fixed-parameter tractable with respect to a parameter at most linear in the tree-width of the input knot diagram. When combined with existing approximation algorithms for tree decomposition, this recovers the sub-exponential bound $e^{O(\\sqrt{n})}$ for the time complexity of computing any Reshetikhin--Turaev knot polynomial. We accompany this paper with an implementation of such an algorithm in SnapPy, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29662","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.29662/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-30T02:17:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amepw2ZtEFx9IxfYqvM6rhL/n6NmwX6SdT61QzPg8sZjNdk7/2mh8r3QOsvdHfyTx+RuAhs/ICYhEfVROdNMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:35:00.410630Z"},"content_sha256":"ea5bc9c8dee13a0e227985a0d9d56ba84d0ab8a363411c627bb7b9180676a3a8","schema_version":"1.0","event_id":"sha256:ea5bc9c8dee13a0e227985a0d9d56ba84d0ab8a363411c627bb7b9180676a3a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIXEU7H4YPOWL6NI3Y45XADBMK/bundle.json","state_url":"https://pith.science/pith/DIXEU7H4YPOWL6NI3Y45XADBMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIXEU7H4YPOWL6NI3Y45XADBMK/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-30T22:35:00Z","links":{"resolver":"https://pith.science/pith/DIXEU7H4YPOWL6NI3Y45XADBMK","bundle":"https://pith.science/pith/DIXEU7H4YPOWL6NI3Y45XADBMK/bundle.json","state":"https://pith.science/pith/DIXEU7H4YPOWL6NI3Y45XADBMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIXEU7H4YPOWL6NI3Y45XADBMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DIXEU7H4YPOWL6NI3Y45XADBMK","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":"bc3b9776eced16c759e1a52ba7b73325dfccf9b6f903f94a56fb75b704120fef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-06-29T00:12:48Z","title_canon_sha256":"f08c3cda15a1b7be6d04316aa599e495704a9b630c268936b74b1d23406095b7"},"schema_version":"1.0","source":{"id":"2606.29662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29662","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29662v1","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29662","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"pith_short_12","alias_value":"DIXEU7H4YPOW","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"pith_short_16","alias_value":"DIXEU7H4YPOWL6NI","created_at":"2026-06-30T02:17:29Z"},{"alias_kind":"pith_short_8","alias_value":"DIXEU7H4","created_at":"2026-06-30T02:17:29Z"}],"graph_snapshots":[{"event_id":"sha256:ea5bc9c8dee13a0e227985a0d9d56ba84d0ab8a363411c627bb7b9180676a3a8","target":"graph","created_at":"2026-06-30T02:17:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.29662/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a thorough analysis of the time complexity of computing Reshetikhin--Turaev knot polynomials via tensor contractions on the associated tensor networks, showing that the computation is fixed-parameter tractable with respect to a parameter at most linear in the tree-width of the input knot diagram. When combined with existing approximation algorithms for tree decomposition, this recovers the sub-exponential bound $e^{O(\\sqrt{n})}$ for the time complexity of computing any Reshetikhin--Turaev knot polynomial. We accompany this paper with an implementation of such an algorithm in SnapPy, wh","authors_text":"Shana Yunsheng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-06-29T00:12:48Z","title":"Fixed-parameter tractable computation of Reshetikhin--Turaev knot polynomials via tensor networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29662","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:b558d6acc486de094dd68ae42f364486effa7687c4137d14beb525228b8a190e","target":"record","created_at":"2026-06-30T02:17:29Z","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":"bc3b9776eced16c759e1a52ba7b73325dfccf9b6f903f94a56fb75b704120fef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-06-29T00:12:48Z","title_canon_sha256":"f08c3cda15a1b7be6d04316aa599e495704a9b630c268936b74b1d23406095b7"},"schema_version":"1.0","source":{"id":"2606.29662","kind":"arxiv","version":1}},"canonical_sha256":"1a2e4a7cfcc3dd65f9a8de39db8061629c3c5cdf118b3f4a6baf8dc342010b78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a2e4a7cfcc3dd65f9a8de39db8061629c3c5cdf118b3f4a6baf8dc342010b78","first_computed_at":"2026-06-30T02:17:29.326567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:29.326567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tMiqAr5zrNwrm2Sg/1LmMA96UM2hqncGM1Se7eKsG2Y5M3Vme7zms0UzYVW3IH7tMp2iOpdJFCoLwb8sbb2vBw==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:29.327194Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.29662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b558d6acc486de094dd68ae42f364486effa7687c4137d14beb525228b8a190e","sha256:ea5bc9c8dee13a0e227985a0d9d56ba84d0ab8a363411c627bb7b9180676a3a8"],"state_sha256":"f61ada1ecd3db8e1604be9dbd1952a45dfccc82b7e378194fa585cdb04b81088"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yldlLziwDui05nbPf8hEkNiVONde9/xLlr6HhyGXyAJ1qMhT8kDsDRSlVbnTKXymNFbW2c8Lw0U1XAGI+o2KBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:35:00.413764Z","bundle_sha256":"3853b0826a76b7181c418d4bd1b2eb8f77459f2420d04cefc2ec9dc7c2f48689"}}