{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JDB6Y652FL5TCNX4I3AF6THSMH","short_pith_number":"pith:JDB6Y652","canonical_record":{"source":{"id":"1810.03502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-10-08T14:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"a2604ea58409c68d5d3cb84f20abf4d3d775e753da75ca8faa895f62f33fe4aa","abstract_canon_sha256":"14f70f27f28968967afc055e49534ca46e34c6e32051f9b99967bf3e1913c032"},"schema_version":"1.0"},"canonical_sha256":"48c3ec7bba2afb3136fc46c05f4cf261df19c41e2327a4b18d89a5828bd11286","source":{"kind":"arxiv","id":"1810.03502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03502","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03502v1","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03502","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"JDB6Y652FL5T","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JDB6Y652FL5TCNX4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JDB6Y652","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JDB6Y652FL5TCNX4I3AF6THSMH","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-10-08T14:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"a2604ea58409c68d5d3cb84f20abf4d3d775e753da75ca8faa895f62f33fe4aa","abstract_canon_sha256":"14f70f27f28968967afc055e49534ca46e34c6e32051f9b99967bf3e1913c032"},"schema_version":"1.0"},"canonical_sha256":"48c3ec7bba2afb3136fc46c05f4cf261df19c41e2327a4b18d89a5828bd11286","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:51.099282Z","signature_b64":"kuHunrJsOYQuJH9qjqoQa5DyhRa5lJBSEOGIPhitJusPuoM5QuqqBoXM25p070nJ97STt7IGFWb4EQVhVX0HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c3ec7bba2afb3136fc46c05f4cf261df19c41e2327a4b18d89a5828bd11286","last_reissued_at":"2026-05-18T00:03:51.098516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:51.098516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03502","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-18T00:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVufzAR2IVxk0Qtb/a0vZ7F5ui9HXNtjt3RRoGqt6+0Iey35mGEzs5nAiyxVx4oZ25d966LxWc4iQSNVVz6WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:44:29.145150Z"},"content_sha256":"e2084c7624827772d16790c2f5627fa5a28e77264898905ad64bb0276cfbc2be","schema_version":"1.0","event_id":"sha256:e2084c7624827772d16790c2f5627fa5a28e77264898905ad64bb0276cfbc2be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JDB6Y652FL5TCNX4I3AF6THSMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The unbearable hardness of unknotting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Arnaud de Mesmay, Eric Sedgwick, Martin Tancer, Yo'av Rieck","submitted_at":"2018-10-08T14:47:41Z","abstract_excerpt":"We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard, including detecting whether a link contains a trivial sublink with $n$ components, computing the unlinking number of a link, and computing a variety of link invariants related to four-dimensional topology (such as the $4$-ball Euler characteristic, the slicing number, and the $4$-dimensional clasp number)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03502","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-18T00:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJ3uvWnLizF5uJak+ymQyKA1eFuqH5bMj02Qxwys38Er0ofzVkZNilSUZAOoGRZog690+AU/pjWKRDPte1qTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:44:29.145801Z"},"content_sha256":"020fb2d1c770773ba4c7d6aef85658a2e1bc880d428efacac5866718c57f277e","schema_version":"1.0","event_id":"sha256:020fb2d1c770773ba4c7d6aef85658a2e1bc880d428efacac5866718c57f277e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDB6Y652FL5TCNX4I3AF6THSMH/bundle.json","state_url":"https://pith.science/pith/JDB6Y652FL5TCNX4I3AF6THSMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDB6Y652FL5TCNX4I3AF6THSMH/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-27T20:44:29Z","links":{"resolver":"https://pith.science/pith/JDB6Y652FL5TCNX4I3AF6THSMH","bundle":"https://pith.science/pith/JDB6Y652FL5TCNX4I3AF6THSMH/bundle.json","state":"https://pith.science/pith/JDB6Y652FL5TCNX4I3AF6THSMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDB6Y652FL5TCNX4I3AF6THSMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JDB6Y652FL5TCNX4I3AF6THSMH","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":"14f70f27f28968967afc055e49534ca46e34c6e32051f9b99967bf3e1913c032","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-10-08T14:47:41Z","title_canon_sha256":"a2604ea58409c68d5d3cb84f20abf4d3d775e753da75ca8faa895f62f33fe4aa"},"schema_version":"1.0","source":{"id":"1810.03502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03502","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03502v1","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03502","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"JDB6Y652FL5T","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JDB6Y652FL5TCNX4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JDB6Y652","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:020fb2d1c770773ba4c7d6aef85658a2e1bc880d428efacac5866718c57f277e","target":"graph","created_at":"2026-05-18T00:03:51Z","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 deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard, including detecting whether a link contains a trivial sublink with $n$ components, computing the unlinking number of a link, and computing a variety of link invariants related to four-dimensional topology (such as the $4$-ball Euler characteristic, the slicing number, and the $4$-dimensional clasp number).","authors_text":"Arnaud de Mesmay, Eric Sedgwick, Martin Tancer, Yo'av Rieck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-10-08T14:47:41Z","title":"The unbearable hardness of unknotting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03502","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:e2084c7624827772d16790c2f5627fa5a28e77264898905ad64bb0276cfbc2be","target":"record","created_at":"2026-05-18T00:03:51Z","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":"14f70f27f28968967afc055e49534ca46e34c6e32051f9b99967bf3e1913c032","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-10-08T14:47:41Z","title_canon_sha256":"a2604ea58409c68d5d3cb84f20abf4d3d775e753da75ca8faa895f62f33fe4aa"},"schema_version":"1.0","source":{"id":"1810.03502","kind":"arxiv","version":1}},"canonical_sha256":"48c3ec7bba2afb3136fc46c05f4cf261df19c41e2327a4b18d89a5828bd11286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48c3ec7bba2afb3136fc46c05f4cf261df19c41e2327a4b18d89a5828bd11286","first_computed_at":"2026-05-18T00:03:51.098516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:51.098516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kuHunrJsOYQuJH9qjqoQa5DyhRa5lJBSEOGIPhitJusPuoM5QuqqBoXM25p070nJ97STt7IGFWb4EQVhVX0HBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:51.099282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2084c7624827772d16790c2f5627fa5a28e77264898905ad64bb0276cfbc2be","sha256:020fb2d1c770773ba4c7d6aef85658a2e1bc880d428efacac5866718c57f277e"],"state_sha256":"40d182041669f681028efa032540f90f8a14db0c9da6f8e7de3cb61f6296dcc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6geD9Ez8JAfIiJCFsDMukpC7+mZKb5nglwrPTc/3Q6M+/Ravlk4l9F6hNjw7jO4AX2W1RNDXXihq29i1BNnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:44:29.148752Z","bundle_sha256":"0bbcebff4191e9529c52fa4d144749df068dddcd00c6723d8119a24e43517445"}}