{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WDELZHDTAQTIKMXYF7WDOUAJFN","short_pith_number":"pith:WDELZHDT","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"},"canonical_sha256":"b0c8bc9c7304268532f82fec3750092b548b84ad9106f6816cd4ef688401f3e5","source":{"kind":"arxiv","id":"1207.0835","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0835","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0835v2","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0835","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"WDELZHDTAQTI","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WDELZHDTAQTIKMXY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WDELZHDT","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WDELZHDTAQTIKMXYF7WDOUAJFN","target":"record","payload":{"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"},"canonical_sha256":"b0c8bc9c7304268532f82fec3750092b548b84ad9106f6816cd4ef688401f3e5","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"},"source_kind":"arxiv","source_id":"1207.0835","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/j8LDCRYGOCYy1GZJFVhQvsIvMyMG2BlxzUbPxrKsn1nDlPtfrOWtm9XeaCPq72OuxHZMI6+7i6lfjAp91JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:29:23.909847Z"},"content_sha256":"59ef767a0788af28ccc492dfa526b16b996413f659e0fb90abdb1ff51aa63669","schema_version":"1.0","event_id":"sha256:59ef767a0788af28ccc492dfa526b16b996413f659e0fb90abdb1ff51aa63669"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WDELZHDTAQTIKMXYF7WDOUAJFN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gU9HHP6ODZRP9pbJOroSWpbR6HsnJk5b+C+/V84LfvN8xPX8dsSquFe7ZSTpm1qKBAi4Y8Z8sZfmaNj7MzpnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:29:23.910395Z"},"content_sha256":"90aa261384fe1d27c1a717110fc69b7783ef0b3078cab31b6e63aeb9ecafaf9f","schema_version":"1.0","event_id":"sha256:90aa261384fe1d27c1a717110fc69b7783ef0b3078cab31b6e63aeb9ecafaf9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/bundle.json","state_url":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T23:29:23Z","links":{"resolver":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN","bundle":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/bundle.json","state":"https://pith.science/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDELZHDTAQTIKMXYF7WDOUAJFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WDELZHDTAQTIKMXYF7WDOUAJFN","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":"3981c25090546886102839399603b28a011ff82aff286c9a2d646c9861781b80","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-03T20:55:53Z","title_canon_sha256":"7b695a52e616444ce812da80acab310b7fd9101214fcba750ad118e37234ec58"},"schema_version":"1.0","source":{"id":"1207.0835","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0835","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0835v2","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0835","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"WDELZHDTAQTI","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WDELZHDTAQTIKMXY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WDELZHDT","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:90aa261384fe1d27c1a717110fc69b7783ef0b3078cab31b6e63aeb9ecafaf9f","target":"graph","created_at":"2026-05-18T03:49:45Z","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"},"paper":{"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","authors_text":"Alexander Langer, Christophe Paul, Eun Jung Kim, Felix Reidl, Ignasi Sau, Peter Rossmanith, Somnath Sikdar","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-03T20:55:53Z","title":"Linear kernels and single-exponential algorithms via protrusion decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0835","kind":"arxiv","version":2},"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:59ef767a0788af28ccc492dfa526b16b996413f659e0fb90abdb1ff51aa63669","target":"record","created_at":"2026-05-18T03:49:45Z","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":"3981c25090546886102839399603b28a011ff82aff286c9a2d646c9861781b80","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-03T20:55:53Z","title_canon_sha256":"7b695a52e616444ce812da80acab310b7fd9101214fcba750ad118e37234ec58"},"schema_version":"1.0","source":{"id":"1207.0835","kind":"arxiv","version":2}},"canonical_sha256":"b0c8bc9c7304268532f82fec3750092b548b84ad9106f6816cd4ef688401f3e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0c8bc9c7304268532f82fec3750092b548b84ad9106f6816cd4ef688401f3e5","first_computed_at":"2026-05-18T03:49:45.334983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:45.334983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kqdP0IPxxBMh9gOsnNNQEwoGVX6ym4if1iTIbbFKD6ncCiMr58YK5b76nSeZkt/bYstZWhgEiuoqLuSQ10DQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:45.335808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0835","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59ef767a0788af28ccc492dfa526b16b996413f659e0fb90abdb1ff51aa63669","sha256:90aa261384fe1d27c1a717110fc69b7783ef0b3078cab31b6e63aeb9ecafaf9f"],"state_sha256":"db980ee447edab51ebe069ec1954752014aa5a6185d830299115c53a91d41045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16Bjo9uwDVh8MwytlEV08RuQu5ex/YEWqWqmow9vH+0rC9aFRYGKbdKMafV2ihWE2inGN7H1oOv9Ze4VQmdHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:29:23.912959Z","bundle_sha256":"fef93e2d34cd6e7bf56e6332f184f9a620434e497dd93e9763d0a5a0473e400f"}}