{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WDELZHDTAQTIKMXYF7WDOUAJFN","short_pith_number":"pith:WDELZHDT","schema_version":"1.0","canonical_sha256":"b0c8bc9c7304268532f82fec3750092b548b84ad9106f6816cd4ef688401f3e5","source":{"kind":"arxiv","id":"1207.0835","version":2},"attestation_state":"computed","paper":{"title":"Linear kernels and single-exponential algorithms via protrusion decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Alexander Langer, Christophe Paul, Eun Jung Kim, Felix Reidl, Ignasi Sau, Peter Rossmanith, Somnath Sikdar","submitted_at":"2012-07-03T20:55:53Z","abstract_excerpt":"A \\emph{$t$-treewidth-modulator} of a graph $G$ is a set $X \\subseteq V(G)$ such that the treewidth of $G-X$ is at most some constant $t-1$. In this paper, we present a novel algorithm to compute a decomposition scheme for graphs $G$ that come equipped with a $t$-treewidth-modulator. This decomposition, called a \\emph{protrusion decomposition}, is the cornerstone in obtaining the following two main results.\n  We first show that any parameterized graph problem (with parameter $k$) that has \\emph{finite integer index} and is \\emph{treewidth-bounding} admits a linear kernel on $H$-topological-min"},"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":"1207.0835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-03T20:55:53Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7b695a52e616444ce812da80acab310b7fd9101214fcba750ad118e37234ec58","abstract_canon_sha256":"3981c25090546886102839399603b28a011ff82aff286c9a2d646c9861781b80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:45.335808Z","signature_b64":"kqdP0IPxxBMh9gOsnNNQEwoGVX6ym4if1iTIbbFKD6ncCiMr58YK5b76nSeZkt/bYstZWhgEiuoqLuSQ10DQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0c8bc9c7304268532f82fec3750092b548b84ad9106f6816cd4ef688401f3e5","last_reissued_at":"2026-05-18T03:49:45.334983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:45.334983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear kernels and single-exponential algorithms via protrusion decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Alexander Langer, Christophe Paul, Eun Jung Kim, Felix Reidl, Ignasi Sau, Peter Rossmanith, Somnath Sikdar","submitted_at":"2012-07-03T20:55:53Z","abstract_excerpt":"A \\emph{$t$-treewidth-modulator} of a graph $G$ is a set $X \\subseteq V(G)$ such that the treewidth of $G-X$ is at most some constant $t-1$. In this paper, we present a novel algorithm to compute a decomposition scheme for graphs $G$ that come equipped with a $t$-treewidth-modulator. This decomposition, called a \\emph{protrusion decomposition}, is the cornerstone in obtaining the following two main results.\n  We first show that any parameterized graph problem (with parameter $k$) that has \\emph{finite integer index} and is \\emph{treewidth-bounding} admits a linear kernel on $H$-topological-min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0835","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":"1207.0835","created_at":"2026-05-18T03:49:45.335123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0835v2","created_at":"2026-05-18T03:49:45.335123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0835","created_at":"2026-05-18T03:49:45.335123+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDELZHDTAQTI","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDELZHDTAQTIKMXY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDELZHDT","created_at":"2026-05-18T12:27:25.539911+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/WDELZHDTAQTIKMXYF7WDOUAJFN","json":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN.json","graph_json":"https://pith.science/api/pith-number/WDELZHDTAQTIKMXYF7WDOUAJFN/graph.json","events_json":"https://pith.science/api/pith-number/WDELZHDTAQTIKMXYF7WDOUAJFN/events.json","paper":"https://pith.science/paper/WDELZHDT"},"agent_actions":{"view_html":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN","download_json":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN.json","view_paper":"https://pith.science/paper/WDELZHDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0835&json=true","fetch_graph":"https://pith.science/api/pith-number/WDELZHDTAQTIKMXYF7WDOUAJFN/graph.json","fetch_events":"https://pith.science/api/pith-number/WDELZHDTAQTIKMXYF7WDOUAJFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/action/storage_attestation","attest_author":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/action/author_attestation","sign_citation":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/action/citation_signature","submit_replication":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/action/replication_record"}},"created_at":"2026-05-18T03:49:45.335123+00:00","updated_at":"2026-05-18T03:49:45.335123+00:00"}