{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RJCBTSRCYQLP4F3MBJWWXZWOBC","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":"79d8c5e0f45995693845de7633b3e9e25039bc35e0fbf94409649747882104f4","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T16:39:22Z","title_canon_sha256":"35a42cf2b809c07adb8943f8cdbab85a8beb304d0b69c8c623f4fd7ecf4c8f15"},"schema_version":"1.0","source":{"id":"1907.02919","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02919","created_at":"2026-07-05T05:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02919v4","created_at":"2026-07-05T05:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02919","created_at":"2026-07-05T05:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"RJCBTSRCYQLP","created_at":"2026-07-05T05:11:33Z"},{"alias_kind":"pith_short_16","alias_value":"RJCBTSRCYQLP4F3M","created_at":"2026-07-05T05:11:33Z"},{"alias_kind":"pith_short_8","alias_value":"RJCBTSRC","created_at":"2026-07-05T05:11:33Z"}],"graph_snapshots":[{"event_id":"sha256:8ce254e433186f31d95a75619bfb200ebd175a8fb5e84cf9a96304aa018199cc","target":"graph","created_at":"2026-07-05T05:11:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.02919/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dimitrios M. Thilikos, Giannos Stamoulis, Petr A. Golovach","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T16:39:22Z","title":"Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02919","kind":"arxiv","version":4},"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:16dc0edc584232a08b739fa7ac0e91c08633cc4edaab80a72f6f58ae8b2e67cf","target":"record","created_at":"2026-07-05T05:11:33Z","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":"79d8c5e0f45995693845de7633b3e9e25039bc35e0fbf94409649747882104f4","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T16:39:22Z","title_canon_sha256":"35a42cf2b809c07adb8943f8cdbab85a8beb304d0b69c8c623f4fd7ecf4c8f15"},"schema_version":"1.0","source":{"id":"1907.02919","kind":"arxiv","version":4}},"canonical_sha256":"8a4419ca22c416fe176c0a6d6be6ce089b929d6d50b591827a05b1b6ea995ec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a4419ca22c416fe176c0a6d6be6ce089b929d6d50b591827a05b1b6ea995ec7","first_computed_at":"2026-07-05T05:11:33.139764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:11:33.139764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aT1PIEVeMmjTP2lpg9GZVL3en0kfPCopiSY+ZD4DlCuZ3vmT4bFtR+Hu794AZIk3+LcUcW35MRw9DJVq41M9DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:11:33.140175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02919","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16dc0edc584232a08b739fa7ac0e91c08633cc4edaab80a72f6f58ae8b2e67cf","sha256:8ce254e433186f31d95a75619bfb200ebd175a8fb5e84cf9a96304aa018199cc"],"state_sha256":"f8bc30809112cf94ef514b6ff9a5abf458811bdfb7608aca36380caa1bca18ad"}