{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TQEKJTSPCU7N527AXRCXOBH6XC","short_pith_number":"pith:TQEKJTSP","schema_version":"1.0","canonical_sha256":"9c08a4ce4f153edeebe0bc457704feb894529f114d97a06e358486b2de48a750","source":{"kind":"arxiv","id":"1905.01830","version":1},"attestation_state":"computed","paper":{"title":"Well-quasi-order of plane minors and an application to link diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Bojan Mohar, Carolina Medina, Gelasio Salazar","submitted_at":"2019-05-06T06:01:58Z","abstract_excerpt":"A plane graph $H$ is a {\\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmative. We also prove an additional application to knot theory. If $L$ is a link and $D$ is a link diagram, write $D\\leadsto L$ if there is a sequence of crossing exchanges and smoothings that takes $D$ to a diagram of $L$. We show that, for each fixed link $L$, there is a polynomial-"},"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":"1905.01830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-05-06T06:01:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"59f6b125478bc594ef748b5a5f4cb9a71dc900c2ade2f2e7cfc2aaf2cf38f381","abstract_canon_sha256":"c15f1408169ad53c7870e44387f369a283ca6657d327f12746e55bda99c9d5b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.289483Z","signature_b64":"jNr+guoBRpXmvjXQE6mgR1wHPALHEm9WGmyQ/8jzXemLvg1HB3ptxv+nH7iEp3ZNiovShGuL6K2tzd3hkCXAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c08a4ce4f153edeebe0bc457704feb894529f114d97a06e358486b2de48a750","last_reissued_at":"2026-05-17T23:46:57.288893Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.288893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well-quasi-order of plane minors and an application to link diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Bojan Mohar, Carolina Medina, Gelasio Salazar","submitted_at":"2019-05-06T06:01:58Z","abstract_excerpt":"A plane graph $H$ is a {\\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmative. We also prove an additional application to knot theory. If $L$ is a link and $D$ is a link diagram, write $D\\leadsto L$ if there is a sequence of crossing exchanges and smoothings that takes $D$ to a diagram of $L$. We show that, for each fixed link $L$, there is a polynomial-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01830","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.01830","created_at":"2026-05-17T23:46:57.288996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01830v1","created_at":"2026-05-17T23:46:57.288996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01830","created_at":"2026-05-17T23:46:57.288996+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQEKJTSPCU7N","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQEKJTSPCU7N527A","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQEKJTSP","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07468","citing_title":"Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC","json":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC.json","graph_json":"https://pith.science/api/pith-number/TQEKJTSPCU7N527AXRCXOBH6XC/graph.json","events_json":"https://pith.science/api/pith-number/TQEKJTSPCU7N527AXRCXOBH6XC/events.json","paper":"https://pith.science/paper/TQEKJTSP"},"agent_actions":{"view_html":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC","download_json":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC.json","view_paper":"https://pith.science/paper/TQEKJTSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01830&json=true","fetch_graph":"https://pith.science/api/pith-number/TQEKJTSPCU7N527AXRCXOBH6XC/graph.json","fetch_events":"https://pith.science/api/pith-number/TQEKJTSPCU7N527AXRCXOBH6XC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC/action/storage_attestation","attest_author":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC/action/author_attestation","sign_citation":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC/action/citation_signature","submit_replication":"https://pith.science/pith/TQEKJTSPCU7N527AXRCXOBH6XC/action/replication_record"}},"created_at":"2026-05-17T23:46:57.288996+00:00","updated_at":"2026-05-17T23:46:57.288996+00:00"}