{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OFWLSGXVYDPTXNBEPD25CHC6S2","short_pith_number":"pith:OFWLSGXV","schema_version":"1.0","canonical_sha256":"716cb91af5c0df3bb42478f5d11c5e9688f86ce8e75362df4de015e04d2113e2","source":{"kind":"arxiv","id":"1903.04532","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.04532","created_at":"2026-05-17T23:51:25.522257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04532v2","created_at":"2026-05-17T23:51:25.522257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04532","created_at":"2026-05-17T23:51:25.522257+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFWLSGXVYDPT","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFWLSGXVYDPTXNBE","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFWLSGXV","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2","json":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2.json","graph_json":"https://pith.science/api/pith-number/OFWLSGXVYDPTXNBEPD25CHC6S2/graph.json","events_json":"https://pith.science/api/pith-number/OFWLSGXVYDPTXNBEPD25CHC6S2/events.json","paper":"https://pith.science/paper/OFWLSGXV"},"agent_actions":{"view_html":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2","download_json":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2.json","view_paper":"https://pith.science/paper/OFWLSGXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04532&json=true","fetch_graph":"https://pith.science/api/pith-number/OFWLSGXVYDPTXNBEPD25CHC6S2/graph.json","fetch_events":"https://pith.science/api/pith-number/OFWLSGXVYDPTXNBEPD25CHC6S2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/action/storage_attestation","attest_author":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/action/author_attestation","sign_citation":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/action/citation_signature","submit_replication":"https://pith.science/pith/OFWLSGXVYDPTXNBEPD25CHC6S2/action/replication_record"}},"created_at":"2026-05-17T23:51:25.522257+00:00","updated_at":"2026-05-17T23:51:25.522257+00:00"}