{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4RMK2HKSQGNHF6VSHXH7GPWCTV","short_pith_number":"pith:4RMK2HKS","canonical_record":{"source":{"id":"1302.0180","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-02-01T13:44:57Z","cross_cats_sorted":[],"title_canon_sha256":"f0160e712241f0c2d82d7b87d471454f61ec3af90fd9bed2d0e8d45c349a54fd","abstract_canon_sha256":"16618156ef2fc88461d4e37c4f0adfbc8232402a7d7e4000e94319f996032f06"},"schema_version":"1.0"},"canonical_sha256":"e458ad1d52819a72fab23dcff33ec29d54c508583e27a2a7900f152817f64b9e","source":{"kind":"arxiv","id":"1302.0180","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0180","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0180v2","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0180","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"4RMK2HKSQGNH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4RMK2HKSQGNHF6VS","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4RMK2HKS","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4RMK2HKSQGNHF6VSHXH7GPWCTV","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0180","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-02-01T13:44:57Z","cross_cats_sorted":[],"title_canon_sha256":"f0160e712241f0c2d82d7b87d471454f61ec3af90fd9bed2d0e8d45c349a54fd","abstract_canon_sha256":"16618156ef2fc88461d4e37c4f0adfbc8232402a7d7e4000e94319f996032f06"},"schema_version":"1.0"},"canonical_sha256":"e458ad1d52819a72fab23dcff33ec29d54c508583e27a2a7900f152817f64b9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:36.253304Z","signature_b64":"pl6yhISMQDvoV0BmP1Mwq1nOsvmZ2159Q9v4I1/22FFCPSbttiK0qOqDCM3ezuZ2xv7TIFlTHi2bkafyNronAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e458ad1d52819a72fab23dcff33ec29d54c508583e27a2a7900f152817f64b9e","last_reissued_at":"2026-05-18T02:31:36.252651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:36.252651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0180","source_version":2,"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-18T02:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hd3vZ1pwPTWn1LuzJKlZrV7G0KTSI+bauWk3i6EleMwaxR85CJk4vrGQGOMoqQlvjxSUwXUuI7JRQEVaI+/NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:30:59.985143Z"},"content_sha256":"531224c88f32b44aaea1cabd807d37133740be0e17da6478afe570bc204c8250","schema_version":"1.0","event_id":"sha256:531224c88f32b44aaea1cabd807d37133740be0e17da6478afe570bc204c8250"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4RMK2HKSQGNHF6VSHXH7GPWCTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A polynomial upper bound on Reidemeister moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Marc Lackenby","submitted_at":"2013-02-01T13:44:57Z","abstract_excerpt":"We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar theorem for split links, which provides a polynomial upper bound on the number of Reidemeister moves required to transform a diagram of the link into a disconnected diagram."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0180","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"},"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-18T02:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YyfNmlrhlGgJPzC8wwHdEYC1mnkeE1KZPD1BSIF9idUNi01PI8jUnvWyGm2KiKtfU9EFOfBzq2sAFqQw89iFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:30:59.985715Z"},"content_sha256":"4a4782068ce8391373eccc79bccfdd0f8a22f588bc9e70abb2f6432e0a996cd2","schema_version":"1.0","event_id":"sha256:4a4782068ce8391373eccc79bccfdd0f8a22f588bc9e70abb2f6432e0a996cd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RMK2HKSQGNHF6VSHXH7GPWCTV/bundle.json","state_url":"https://pith.science/pith/4RMK2HKSQGNHF6VSHXH7GPWCTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RMK2HKSQGNHF6VSHXH7GPWCTV/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-31T20:30:59Z","links":{"resolver":"https://pith.science/pith/4RMK2HKSQGNHF6VSHXH7GPWCTV","bundle":"https://pith.science/pith/4RMK2HKSQGNHF6VSHXH7GPWCTV/bundle.json","state":"https://pith.science/pith/4RMK2HKSQGNHF6VSHXH7GPWCTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RMK2HKSQGNHF6VSHXH7GPWCTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4RMK2HKSQGNHF6VSHXH7GPWCTV","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":"16618156ef2fc88461d4e37c4f0adfbc8232402a7d7e4000e94319f996032f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-02-01T13:44:57Z","title_canon_sha256":"f0160e712241f0c2d82d7b87d471454f61ec3af90fd9bed2d0e8d45c349a54fd"},"schema_version":"1.0","source":{"id":"1302.0180","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0180","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0180v2","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0180","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"4RMK2HKSQGNH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4RMK2HKSQGNHF6VS","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4RMK2HKS","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:4a4782068ce8391373eccc79bccfdd0f8a22f588bc9e70abb2f6432e0a996cd2","target":"graph","created_at":"2026-05-18T02:31:36Z","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":"We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar theorem for split links, which provides a polynomial upper bound on the number of Reidemeister moves required to transform a diagram of the link into a disconnected diagram.","authors_text":"Marc Lackenby","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-02-01T13:44:57Z","title":"A polynomial upper bound on Reidemeister moves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0180","kind":"arxiv","version":2},"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:531224c88f32b44aaea1cabd807d37133740be0e17da6478afe570bc204c8250","target":"record","created_at":"2026-05-18T02:31:36Z","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":"16618156ef2fc88461d4e37c4f0adfbc8232402a7d7e4000e94319f996032f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-02-01T13:44:57Z","title_canon_sha256":"f0160e712241f0c2d82d7b87d471454f61ec3af90fd9bed2d0e8d45c349a54fd"},"schema_version":"1.0","source":{"id":"1302.0180","kind":"arxiv","version":2}},"canonical_sha256":"e458ad1d52819a72fab23dcff33ec29d54c508583e27a2a7900f152817f64b9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e458ad1d52819a72fab23dcff33ec29d54c508583e27a2a7900f152817f64b9e","first_computed_at":"2026-05-18T02:31:36.252651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:36.252651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pl6yhISMQDvoV0BmP1Mwq1nOsvmZ2159Q9v4I1/22FFCPSbttiK0qOqDCM3ezuZ2xv7TIFlTHi2bkafyNronAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:36.253304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0180","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:531224c88f32b44aaea1cabd807d37133740be0e17da6478afe570bc204c8250","sha256:4a4782068ce8391373eccc79bccfdd0f8a22f588bc9e70abb2f6432e0a996cd2"],"state_sha256":"813ff41546673d69df8335e3db97a0814f875048937281ad231a57132d03fd3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"orZvFE+E+U4nF11REBYXuf6UlqhI4d4xG5aSTB0jWeuvrvHadM+dPJc2NdKNdN9iT+LBF+SGdHtz/VTVJqoiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:30:59.989233Z","bundle_sha256":"33673e48e7a1f14d3e5ca503f241b9ebfd2753b39f696526801cfaf667bc4b30"}}