{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:MUETSEORS64QBXJTLDQGPG4BPR","short_pith_number":"pith:MUETSEOR","schema_version":"1.0","canonical_sha256":"65093911d197b900dd3358e0679b817c6d86eaa4af316e33b48863d2e3f409ff","source":{"kind":"arxiv","id":"1011.1827","version":1},"attestation_state":"computed","paper":{"title":"Finding topological subgraphs is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Ken-ichi Kawarabayashi, Martin Grohe, Paul Wollan","submitted_at":"2010-11-08T15:23:20Z","abstract_excerpt":"We show that for every fixed undirected graph $H$, there is a $O(|V(G)|^3)$ time algorithm that tests, given a graph $G$, if $G$ contains $H$ as a topological subgraph (that is, a subdivision of $H$ is subgraph of $G$). This shows that topological subgraph testing is fixed-parameter tractable, resolving a longstanding open question of Downey and Fellows from 1992. As a corollary, for every $H$ we obtain an $O(|V(G)|^3)$ time algorithm that tests if there is an immersion of $H$ into a given graph $G$. This answers another open question raised by Downey and Fellows in 1992."},"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":"1011.1827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-08T15:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"aad462edb4ba398ff324789ae1a1140e3b90e5a52b4cf7ef7caa77f20bdaf737","abstract_canon_sha256":"8db0c265eca57bd2514cf53b696303329a30d0fe035f408d24171f3d9938d966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.356305Z","signature_b64":"DTzJDOH/8CyYCd7sobHKLloMRNzAqnzhPlhB9Q/WZeAZ5nG0DZKaQw5VTIp1bNwiZgJImw9XrpWq+CcpM1FDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65093911d197b900dd3358e0679b817c6d86eaa4af316e33b48863d2e3f409ff","last_reissued_at":"2026-05-18T02:23:37.355805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.355805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding topological subgraphs is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Ken-ichi Kawarabayashi, Martin Grohe, Paul Wollan","submitted_at":"2010-11-08T15:23:20Z","abstract_excerpt":"We show that for every fixed undirected graph $H$, there is a $O(|V(G)|^3)$ time algorithm that tests, given a graph $G$, if $G$ contains $H$ as a topological subgraph (that is, a subdivision of $H$ is subgraph of $G$). This shows that topological subgraph testing is fixed-parameter tractable, resolving a longstanding open question of Downey and Fellows from 1992. As a corollary, for every $H$ we obtain an $O(|V(G)|^3)$ time algorithm that tests if there is an immersion of $H$ into a given graph $G$. This answers another open question raised by Downey and Fellows in 1992."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1827","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":"1011.1827","created_at":"2026-05-18T02:23:37.355878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1827v1","created_at":"2026-05-18T02:23:37.355878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1827","created_at":"2026-05-18T02:23:37.355878+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUETSEORS64Q","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUETSEORS64QBXJT","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUETSEOR","created_at":"2026-05-18T12:26:10.704358+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/MUETSEORS64QBXJTLDQGPG4BPR","json":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR.json","graph_json":"https://pith.science/api/pith-number/MUETSEORS64QBXJTLDQGPG4BPR/graph.json","events_json":"https://pith.science/api/pith-number/MUETSEORS64QBXJTLDQGPG4BPR/events.json","paper":"https://pith.science/paper/MUETSEOR"},"agent_actions":{"view_html":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR","download_json":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR.json","view_paper":"https://pith.science/paper/MUETSEOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1827&json=true","fetch_graph":"https://pith.science/api/pith-number/MUETSEORS64QBXJTLDQGPG4BPR/graph.json","fetch_events":"https://pith.science/api/pith-number/MUETSEORS64QBXJTLDQGPG4BPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR/action/storage_attestation","attest_author":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR/action/author_attestation","sign_citation":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR/action/citation_signature","submit_replication":"https://pith.science/pith/MUETSEORS64QBXJTLDQGPG4BPR/action/replication_record"}},"created_at":"2026-05-18T02:23:37.355878+00:00","updated_at":"2026-05-18T02:23:37.355878+00:00"}