{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RJCBTSRCYQLP4F3MBJWWXZWOBC","short_pith_number":"pith:RJCBTSRC","schema_version":"1.0","canonical_sha256":"8a4419ca22c416fe176c0a6d6be6ce089b929d6d50b591827a05b1b6ea995ec7","source":{"kind":"arxiv","id":"1907.02919","version":4},"attestation_state":"computed","paper":{"title":"Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Giannos Stamoulis, Petr A. Golovach","submitted_at":"2019-07-05T16:39:22Z","abstract_excerpt":"For a finite collection of graphs ${\\cal F}$, the \\textsc{${\\cal F}$-TM-Deletion} problem has as input an $n$-vertex graph $G$ and an integer $k$ and asks whether there exists a set $S \\subseteq V(G)$ with $|S| \\leq k$ such that $G \\setminus S$ does not contain any of the graphs in ${\\cal F}$ as a topological minor. We prove that for every such ${\\cal F}$, \\textsc{${\\cal F}$-TM-Deletion} is fixed parameter tractable on planar graphs. Our algorithm runs in a $2^{\\mathcal{O}(k^2)}\\cdot n^{2}$ time or, alternatively in $2^{\\mathcal{O}(k)}\\cdot n^{4}$ time. Our techniques can easily be extended to"},"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":"1907.02919","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T16:39:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"35a42cf2b809c07adb8943f8cdbab85a8beb304d0b69c8c623f4fd7ecf4c8f15","abstract_canon_sha256":"79d8c5e0f45995693845de7633b3e9e25039bc35e0fbf94409649747882104f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:33.140175Z","signature_b64":"aT1PIEVeMmjTP2lpg9GZVL3en0kfPCopiSY+ZD4DlCuZ3vmT4bFtR+Hu794AZIk3+LcUcW35MRw9DJVq41M9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a4419ca22c416fe176c0a6d6be6ce089b929d6d50b591827a05b1b6ea995ec7","last_reissued_at":"2026-07-05T05:11:33.139764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:33.139764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Giannos Stamoulis, Petr A. Golovach","submitted_at":"2019-07-05T16:39:22Z","abstract_excerpt":"For a finite collection of graphs ${\\cal F}$, the \\textsc{${\\cal F}$-TM-Deletion} problem has as input an $n$-vertex graph $G$ and an integer $k$ and asks whether there exists a set $S \\subseteq V(G)$ with $|S| \\leq k$ such that $G \\setminus S$ does not contain any of the graphs in ${\\cal F}$ as a topological minor. We prove that for every such ${\\cal F}$, \\textsc{${\\cal F}$-TM-Deletion} is fixed parameter tractable on planar graphs. Our algorithm runs in a $2^{\\mathcal{O}(k^2)}\\cdot n^{2}$ time or, alternatively in $2^{\\mathcal{O}(k)}\\cdot n^{4}$ time. Our techniques can easily be extended to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02919","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.02919/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.02919","created_at":"2026-07-05T05:11:33.139819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02919v4","created_at":"2026-07-05T05:11:33.139819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02919","created_at":"2026-07-05T05:11:33.139819+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJCBTSRCYQLP","created_at":"2026-07-05T05:11:33.139819+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJCBTSRCYQLP4F3M","created_at":"2026-07-05T05:11:33.139819+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJCBTSRC","created_at":"2026-07-05T05:11:33.139819+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/RJCBTSRCYQLP4F3MBJWWXZWOBC","json":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC.json","graph_json":"https://pith.science/api/pith-number/RJCBTSRCYQLP4F3MBJWWXZWOBC/graph.json","events_json":"https://pith.science/api/pith-number/RJCBTSRCYQLP4F3MBJWWXZWOBC/events.json","paper":"https://pith.science/paper/RJCBTSRC"},"agent_actions":{"view_html":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC","download_json":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC.json","view_paper":"https://pith.science/paper/RJCBTSRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02919&json=true","fetch_graph":"https://pith.science/api/pith-number/RJCBTSRCYQLP4F3MBJWWXZWOBC/graph.json","fetch_events":"https://pith.science/api/pith-number/RJCBTSRCYQLP4F3MBJWWXZWOBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC/action/storage_attestation","attest_author":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC/action/author_attestation","sign_citation":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC/action/citation_signature","submit_replication":"https://pith.science/pith/RJCBTSRCYQLP4F3MBJWWXZWOBC/action/replication_record"}},"created_at":"2026-07-05T05:11:33.139819+00:00","updated_at":"2026-07-05T05:11:33.139819+00:00"}