{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OFWLSGXVYDPTXNBEPD25CHC6S2","short_pith_number":"pith:OFWLSGXV","canonical_record":{"source":{"id":"1903.04532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-03-11T18:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"9ee39c5caeb44e5b687ee556662290a896ef036829f9ed923b35e46fd11f85ed","abstract_canon_sha256":"d7e47ee592f61009f02a1a56c99a86acb26ec91ca12c68475fd088e1f3214b03"},"schema_version":"1.0"},"canonical_sha256":"716cb91af5c0df3bb42478f5d11c5e9688f86ce8e75362df4de015e04d2113e2","source":{"kind":"arxiv","id":"1903.04532","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04532","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04532v2","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04532","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"OFWLSGXVYDPT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OFWLSGXVYDPTXNBE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OFWLSGXV","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OFWLSGXVYDPTXNBEPD25CHC6S2","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-03-11T18:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"9ee39c5caeb44e5b687ee556662290a896ef036829f9ed923b35e46fd11f85ed","abstract_canon_sha256":"d7e47ee592f61009f02a1a56c99a86acb26ec91ca12c68475fd088e1f3214b03"},"schema_version":"1.0"},"canonical_sha256":"716cb91af5c0df3bb42478f5d11c5e9688f86ce8e75362df4de015e04d2113e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:25.522695Z","signature_b64":"z6zUokS0Q2B8yGEc+oTYowmX9t34xUgmf0Vq8bVOtwV7VQRUqF7WbSJ0KZy8dn4hSp6MNJqWREvq/H6wGbw+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"716cb91af5c0df3bb42478f5d11c5e9688f86ce8e75362df4de015e04d2113e2","last_reissued_at":"2026-05-17T23:51:25.522188Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:25.522188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04532","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-17T23:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKbS9PdGK+XHRCsWiC9WERu6CHannocjn6jXEEZC4I4mcbs5ibQVwe/lagGPbUzQw5fijO9izBW/vt9neu0RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:04:51.174833Z"},"content_sha256":"b4797d554a855d92d03e0df3ce2fee1978a3f189bd381028a7eded21b40659ea","schema_version":"1.0","event_id":"sha256:b4797d554a855d92d03e0df3ce2fee1978a3f189bd381028a7eded21b40659ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OFWLSGXVYDPTXNBEPD25CHC6S2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When can a link be obtained from another using crossing exchanges and smoothings?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Carolina Medina, Gelasio Salazar","submitted_at":"2019-03-11T18:37:43Z","abstract_excerpt":"Let $L$ be a fixed link. Given a link diagram $D$, is there a sequence of crossing exchanges and smoothings on $D$ that yields a diagram of $L$? We approach this problem from the computational complexity point of view. It follows from work by Endo, Itoh, and Taniyama that if $L$ is a prime link with crossing number at most $5$, then there is an algorithm that answers this question in polynomial time. We show that the same holds for all torus links $T_{2,m}$ and all twist knots."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04532","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-17T23:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z33AvGMyQAHyJKdHflViVOf3P6z5e3rdSs6lF0+YMAnn1m4teZZ/2rbCMFyFKOWt0424r9FleB/YeCXf3hMxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:04:51.175622Z"},"content_sha256":"923e71fcd3339e20362bf9ee002fabb3f7206113173a38ffecc094258b2e3d8d","schema_version":"1.0","event_id":"sha256:923e71fcd3339e20362bf9ee002fabb3f7206113173a38ffecc094258b2e3d8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/bundle.json","state_url":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/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-06T15:04:51Z","links":{"resolver":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2","bundle":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/bundle.json","state":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OFWLSGXVYDPTXNBEPD25CHC6S2","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":"d7e47ee592f61009f02a1a56c99a86acb26ec91ca12c68475fd088e1f3214b03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-03-11T18:37:43Z","title_canon_sha256":"9ee39c5caeb44e5b687ee556662290a896ef036829f9ed923b35e46fd11f85ed"},"schema_version":"1.0","source":{"id":"1903.04532","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04532","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04532v2","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04532","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"OFWLSGXVYDPT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OFWLSGXVYDPTXNBE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OFWLSGXV","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:923e71fcd3339e20362bf9ee002fabb3f7206113173a38ffecc094258b2e3d8d","target":"graph","created_at":"2026-05-17T23:51:25Z","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":"Let $L$ be a fixed link. Given a link diagram $D$, is there a sequence of crossing exchanges and smoothings on $D$ that yields a diagram of $L$? We approach this problem from the computational complexity point of view. It follows from work by Endo, Itoh, and Taniyama that if $L$ is a prime link with crossing number at most $5$, then there is an algorithm that answers this question in polynomial time. We show that the same holds for all torus links $T_{2,m}$ and all twist knots.","authors_text":"Carolina Medina, Gelasio Salazar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-03-11T18:37:43Z","title":"When can a link be obtained from another using crossing exchanges and smoothings?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04532","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:b4797d554a855d92d03e0df3ce2fee1978a3f189bd381028a7eded21b40659ea","target":"record","created_at":"2026-05-17T23:51:25Z","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":"d7e47ee592f61009f02a1a56c99a86acb26ec91ca12c68475fd088e1f3214b03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-03-11T18:37:43Z","title_canon_sha256":"9ee39c5caeb44e5b687ee556662290a896ef036829f9ed923b35e46fd11f85ed"},"schema_version":"1.0","source":{"id":"1903.04532","kind":"arxiv","version":2}},"canonical_sha256":"716cb91af5c0df3bb42478f5d11c5e9688f86ce8e75362df4de015e04d2113e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"716cb91af5c0df3bb42478f5d11c5e9688f86ce8e75362df4de015e04d2113e2","first_computed_at":"2026-05-17T23:51:25.522188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:25.522188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z6zUokS0Q2B8yGEc+oTYowmX9t34xUgmf0Vq8bVOtwV7VQRUqF7WbSJ0KZy8dn4hSp6MNJqWREvq/H6wGbw+Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:25.522695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04532","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4797d554a855d92d03e0df3ce2fee1978a3f189bd381028a7eded21b40659ea","sha256:923e71fcd3339e20362bf9ee002fabb3f7206113173a38ffecc094258b2e3d8d"],"state_sha256":"dc96e1691431e878e92ab1009c0c5325fbff1b2c0479e93e8d70f099648311f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CP3o33sbPKIOsZLOpGZqhMnfo+PMUI47D9JjzM/QCGdq8OQrwZ8uc9kPv3JtazDRvKoB1ALfgW/ZTYAXLgz8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:04:51.179970Z","bundle_sha256":"1eec460b31473699b29722bdf3a3e4258efa78489b6cdab1482498d1ea5580fc"}}