{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YDXXUM4LJN6GZRTXYPZJD4CZZ2","short_pith_number":"pith:YDXXUM4L","canonical_record":{"source":{"id":"1411.4575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T17:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"91ad47d48b461765f9634d482c65cb1681a4912e9dd3eec6a43afb2d87f26e75","abstract_canon_sha256":"f9441eb8955a1f7fe9e8c6b2f4d1b2856e30c94086a11c615f38e22e8323620f"},"schema_version":"1.0"},"canonical_sha256":"c0ef7a338b4b7c6cc677c3f291f059ce9ef26962f4b3bd3470c95a90c6c0b56f","source":{"kind":"arxiv","id":"1411.4575","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4575","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4575v2","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4575","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"YDXXUM4LJN6G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YDXXUM4LJN6GZRTX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YDXXUM4L","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YDXXUM4LJN6GZRTXYPZJD4CZZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T17:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"91ad47d48b461765f9634d482c65cb1681a4912e9dd3eec6a43afb2d87f26e75","abstract_canon_sha256":"f9441eb8955a1f7fe9e8c6b2f4d1b2856e30c94086a11c615f38e22e8323620f"},"schema_version":"1.0"},"canonical_sha256":"c0ef7a338b4b7c6cc677c3f291f059ce9ef26962f4b3bd3470c95a90c6c0b56f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.381741Z","signature_b64":"EH+NmH0Usx0FokzrUdP7/Z9yW5fRDoxAimOHgtip/ZLuPEgtWXy6yKNkLyhLvsAvN2YTjvng9QAFxreh/VriBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ef7a338b4b7c6cc677c3f291f059ce9ef26962f4b3bd3470c95a90c6c0b56f","last_reissued_at":"2026-05-18T01:32:42.381377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.381377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4575","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SfHhAgNuxukc+fynI92b4fu2qsj0052GBhakDDb4BNtETUKp1gulqUXHTCevycM5Q9cuedTb0OlrRgo0vO9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:01:49.211829Z"},"content_sha256":"3f137f3b0cddb5a49d481de83f8cc519fa06c6d931bf7cbb68c9bea448331bc0","schema_version":"1.0","event_id":"sha256:3f137f3b0cddb5a49d481de83f8cc519fa06c6d931bf7cbb68c9bea448331bc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YDXXUM4LJN6GZRTXYPZJD4CZZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kernelization and Sparseness: the case of Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Felix Reidl, Fernando S\\'anchez Villaamil, Marcin Pilipczuk, Markus S. Dregi, Micha{\\l} Pilipczuk, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar, Stephan Kreutzer","submitted_at":"2014-11-17T17:58:59Z","abstract_excerpt":"We prove that for every positive integer $r$ and for every graph class $\\mathcal G$ of bounded expansion, the $r$-Dominating Set problem admits a linear kernel on graphs from $\\mathcal G$. Moreover, when $\\mathcal G$ is only assumed to be nowhere dense, then we give an almost linear kernel on $\\mathcal G$ for the classic Dominating Set problem, i.e., for the case $r=1$. These results generalize a line of previous research on finding linear kernels for Dominating Set and $r$-Dominating Set. However, the approach taken in this work, which is based on the theory of sparse graphs, is radically dif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4575","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVgZ3zci6sliRK3PcMAW8w9EMXr17fgsG1kPmVr2eVn2kNf9NNpwXJGAvQszlgpgKfujSQgniV2EzPZ7WbrVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:01:49.212176Z"},"content_sha256":"a195fbdf60ec6c10d6efca85323c4ef840d6fdc2056df72020a03c7e5cf86b0e","schema_version":"1.0","event_id":"sha256:a195fbdf60ec6c10d6efca85323c4ef840d6fdc2056df72020a03c7e5cf86b0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDXXUM4LJN6GZRTXYPZJD4CZZ2/bundle.json","state_url":"https://pith.science/pith/YDXXUM4LJN6GZRTXYPZJD4CZZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDXXUM4LJN6GZRTXYPZJD4CZZ2/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-03T23:01:49Z","links":{"resolver":"https://pith.science/pith/YDXXUM4LJN6GZRTXYPZJD4CZZ2","bundle":"https://pith.science/pith/YDXXUM4LJN6GZRTXYPZJD4CZZ2/bundle.json","state":"https://pith.science/pith/YDXXUM4LJN6GZRTXYPZJD4CZZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDXXUM4LJN6GZRTXYPZJD4CZZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YDXXUM4LJN6GZRTXYPZJD4CZZ2","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":"f9441eb8955a1f7fe9e8c6b2f4d1b2856e30c94086a11c615f38e22e8323620f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T17:58:59Z","title_canon_sha256":"91ad47d48b461765f9634d482c65cb1681a4912e9dd3eec6a43afb2d87f26e75"},"schema_version":"1.0","source":{"id":"1411.4575","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4575","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4575v2","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4575","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"YDXXUM4LJN6G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YDXXUM4LJN6GZRTX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YDXXUM4L","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:a195fbdf60ec6c10d6efca85323c4ef840d6fdc2056df72020a03c7e5cf86b0e","target":"graph","created_at":"2026-05-18T01:32:42Z","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":"We prove that for every positive integer $r$ and for every graph class $\\mathcal G$ of bounded expansion, the $r$-Dominating Set problem admits a linear kernel on graphs from $\\mathcal G$. Moreover, when $\\mathcal G$ is only assumed to be nowhere dense, then we give an almost linear kernel on $\\mathcal G$ for the classic Dominating Set problem, i.e., for the case $r=1$. These results generalize a line of previous research on finding linear kernels for Dominating Set and $r$-Dominating Set. However, the approach taken in this work, which is based on the theory of sparse graphs, is radically dif","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Felix Reidl, Fernando S\\'anchez Villaamil, Marcin Pilipczuk, Markus S. Dregi, Micha{\\l} Pilipczuk, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar, Stephan Kreutzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T17:58:59Z","title":"Kernelization and Sparseness: the case of Dominating Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4575","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:3f137f3b0cddb5a49d481de83f8cc519fa06c6d931bf7cbb68c9bea448331bc0","target":"record","created_at":"2026-05-18T01:32:42Z","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":"f9441eb8955a1f7fe9e8c6b2f4d1b2856e30c94086a11c615f38e22e8323620f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T17:58:59Z","title_canon_sha256":"91ad47d48b461765f9634d482c65cb1681a4912e9dd3eec6a43afb2d87f26e75"},"schema_version":"1.0","source":{"id":"1411.4575","kind":"arxiv","version":2}},"canonical_sha256":"c0ef7a338b4b7c6cc677c3f291f059ce9ef26962f4b3bd3470c95a90c6c0b56f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0ef7a338b4b7c6cc677c3f291f059ce9ef26962f4b3bd3470c95a90c6c0b56f","first_computed_at":"2026-05-18T01:32:42.381377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.381377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EH+NmH0Usx0FokzrUdP7/Z9yW5fRDoxAimOHgtip/ZLuPEgtWXy6yKNkLyhLvsAvN2YTjvng9QAFxreh/VriBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.381741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4575","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f137f3b0cddb5a49d481de83f8cc519fa06c6d931bf7cbb68c9bea448331bc0","sha256:a195fbdf60ec6c10d6efca85323c4ef840d6fdc2056df72020a03c7e5cf86b0e"],"state_sha256":"66a8d18639f777bcc0e8ab5e4c9b5190ae8dab369862a1c082b55553db114258"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOcWQLsR+IWG7/Yxfjr9REsNt+G/eCTENXEc3cKdl1HCM1ImPwYOQCxFPU9WBNxtyolxD0JQd//pn3bXPi94DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:01:49.214043Z","bundle_sha256":"944859988125afd3e14ca787b98174cd0fd2aa2ab4b879dc759ec56bc28ba159"}}