{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ETXJSFJH4QHPCUMUAB7B3GBFLM","short_pith_number":"pith:ETXJSFJH","canonical_record":{"source":{"id":"1211.1079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-05T23:54:47Z","cross_cats_sorted":["cs.CG","math.OC"],"title_canon_sha256":"a6c823338e5d49df9b8713bfbc5ecc99a9738abd03a091872e33e1e83bd93ce6","abstract_canon_sha256":"fb88ade97469c137a7ab4eb4721f23b297a5b9d8fa52a6e44f7a28163487f338"},"schema_version":"1.0"},"canonical_sha256":"24ee991527e40ef15194007e1d98255b0353f1068efc3d1f8f47616c56ce96c2","source":{"kind":"arxiv","id":"1211.1079","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1079","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1079v3","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1079","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"ETXJSFJH4QHP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ETXJSFJH4QHPCUMU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ETXJSFJH","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ETXJSFJH4QHPCUMUAB7B3GBFLM","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-05T23:54:47Z","cross_cats_sorted":["cs.CG","math.OC"],"title_canon_sha256":"a6c823338e5d49df9b8713bfbc5ecc99a9738abd03a091872e33e1e83bd93ce6","abstract_canon_sha256":"fb88ade97469c137a7ab4eb4721f23b297a5b9d8fa52a6e44f7a28163487f338"},"schema_version":"1.0"},"canonical_sha256":"24ee991527e40ef15194007e1d98255b0353f1068efc3d1f8f47616c56ce96c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:45.880924Z","signature_b64":"EkPOYkSDQByLYf+cYK/cmRZR1zKrZnbrpwC/vC3KGouWRHehS0kchL3ei7EnDmJjvkekj1GqUxTbc/mYlB9hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24ee991527e40ef15194007e1d98255b0353f1068efc3d1f8f47616c56ce96c2","last_reissued_at":"2026-05-18T02:40:45.880427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:45.880427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1079","source_version":3,"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:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXIpGw17UFCQiv4Go0/7zD9cgbD9/Bjn8KQGomsj7quu7Zt9m/OCjF0q4Nz/MKXutbNHOpIkzXmMj9zmvcVEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:43:10.932062Z"},"content_sha256":"5d6f0f77d5668a25c3ef8dd7f8ff4477036c20328e42e52a245d437cd0d87482","schema_version":"1.0","event_id":"sha256:5d6f0f77d5668a25c3ef8dd7f8ff4477036c20328e42e52a245d437cd0d87482"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ETXJSFJH4QHPCUMUAB7B3GBFLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.OC"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton, Melih Ozlen","submitted_at":"2012-11-05T23:54:47Z","abstract_excerpt":"It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be untangled) are typically easy to identify using fast simplification techniques, whereas non-trivial knots (which cannot be untangled) are more resistant to being conclusively identified as such. Here we present the first unknot recognition algorithm which is always conclusive and, although exponential time in theory, exhibits a clear polynomial time behaviour unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1079","kind":"arxiv","version":3},"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:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvezdeIOjMiMY4W0C6g450p11sikbp5FQe5SXbFjhOH9OaTMhuDkyAwE4U1ySqmdHERYR+rGMx5+vgNwkZYhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:43:10.932798Z"},"content_sha256":"4959f8c0e56203d4688908e9fa5b3e03553a2ab62668885c92ed4a499a67eb11","schema_version":"1.0","event_id":"sha256:4959f8c0e56203d4688908e9fa5b3e03553a2ab62668885c92ed4a499a67eb11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETXJSFJH4QHPCUMUAB7B3GBFLM/bundle.json","state_url":"https://pith.science/pith/ETXJSFJH4QHPCUMUAB7B3GBFLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETXJSFJH4QHPCUMUAB7B3GBFLM/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-11T22:43:10Z","links":{"resolver":"https://pith.science/pith/ETXJSFJH4QHPCUMUAB7B3GBFLM","bundle":"https://pith.science/pith/ETXJSFJH4QHPCUMUAB7B3GBFLM/bundle.json","state":"https://pith.science/pith/ETXJSFJH4QHPCUMUAB7B3GBFLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETXJSFJH4QHPCUMUAB7B3GBFLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ETXJSFJH4QHPCUMUAB7B3GBFLM","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":"fb88ade97469c137a7ab4eb4721f23b297a5b9d8fa52a6e44f7a28163487f338","cross_cats_sorted":["cs.CG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-05T23:54:47Z","title_canon_sha256":"a6c823338e5d49df9b8713bfbc5ecc99a9738abd03a091872e33e1e83bd93ce6"},"schema_version":"1.0","source":{"id":"1211.1079","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1079","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1079v3","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1079","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"ETXJSFJH4QHP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ETXJSFJH4QHPCUMU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ETXJSFJH","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:4959f8c0e56203d4688908e9fa5b3e03553a2ab62668885c92ed4a499a67eb11","target":"graph","created_at":"2026-05-18T02:40:45Z","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":"It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be untangled) are typically easy to identify using fast simplification techniques, whereas non-trivial knots (which cannot be untangled) are more resistant to being conclusively identified as such. Here we present the first unknot recognition algorithm which is always conclusive and, although exponential time in theory, exhibits a clear polynomial time behaviour unde","authors_text":"Benjamin A. Burton, Melih Ozlen","cross_cats":["cs.CG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-05T23:54:47Z","title":"A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1079","kind":"arxiv","version":3},"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:5d6f0f77d5668a25c3ef8dd7f8ff4477036c20328e42e52a245d437cd0d87482","target":"record","created_at":"2026-05-18T02:40:45Z","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":"fb88ade97469c137a7ab4eb4721f23b297a5b9d8fa52a6e44f7a28163487f338","cross_cats_sorted":["cs.CG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-05T23:54:47Z","title_canon_sha256":"a6c823338e5d49df9b8713bfbc5ecc99a9738abd03a091872e33e1e83bd93ce6"},"schema_version":"1.0","source":{"id":"1211.1079","kind":"arxiv","version":3}},"canonical_sha256":"24ee991527e40ef15194007e1d98255b0353f1068efc3d1f8f47616c56ce96c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24ee991527e40ef15194007e1d98255b0353f1068efc3d1f8f47616c56ce96c2","first_computed_at":"2026-05-18T02:40:45.880427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:45.880427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EkPOYkSDQByLYf+cYK/cmRZR1zKrZnbrpwC/vC3KGouWRHehS0kchL3ei7EnDmJjvkekj1GqUxTbc/mYlB9hDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:45.880924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1079","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d6f0f77d5668a25c3ef8dd7f8ff4477036c20328e42e52a245d437cd0d87482","sha256:4959f8c0e56203d4688908e9fa5b3e03553a2ab62668885c92ed4a499a67eb11"],"state_sha256":"847f65d6b480ef67c6719f63806ed727ba08085da653e1c6f766ed37feb53080"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNozKe0pJP/bWklMhGMMe7j8/zJ77jcHN72i7KRBT724YG0UNsxSdr3hiPyCs4/excbNHpWMCyGCMFpYleSaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:43:10.936728Z","bundle_sha256":"3e52b037ce84cf6a0813f62ccb319e5bf744a6b5a07d6c13342e30352ce50653"}}