{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Q3NLCP5QGV76W6YYWOVCY7Y2UA","short_pith_number":"pith:Q3NLCP5Q","schema_version":"1.0","canonical_sha256":"86dab13fb0357feb7b18b3aa2c7f1aa02a66c4de3c831b6f4a01d275b6bd41b2","source":{"kind":"arxiv","id":"1901.03582","version":1},"attestation_state":"computed","paper":{"title":"On Kernelization for Edge Dominating Set under Structural Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Eva-Maria C. Hols, Stefan Kratsch","submitted_at":"2019-01-11T13:57:33Z","abstract_excerpt":"In the NP-hard Edge Dominating Set problem (EDS) we are given a graph $G=(V,E)$ and an integer $k$, and need to determine whether there is a set $F\\subseteq E$ of at most $k$ edges that are incident with all (other) edges of $G$. It is known that this problem is fixed-parameter tractable and admits a polynomial kernel when parameterized by $k$. A caveat for this parameter is that it needs to be large, i.e., at least equal to half the size of a maximum matching of $G$, for instances not to be trivially negative. Motivated by this, we study the existence of polynomial kernels for EDS when parame"},"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":"1901.03582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T13:57:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"98bbd403ead6887cfa5c0f0cdb8b70e9b4c3b9cc9c8c322a00da414f35733c89","abstract_canon_sha256":"a279e2fbbd9a9da9d681afc77d3880b139bd2ec15f5df5d0b3f6c9f339990d87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.875386Z","signature_b64":"iwNYkWk4DNFvo4DVfnE09/sPsPHqF4I5n+KNyiYe2M+nN2TWKiUXfRaikP5s0la+R/mpIf70al65TWddxxieDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86dab13fb0357feb7b18b3aa2c7f1aa02a66c4de3c831b6f4a01d275b6bd41b2","last_reissued_at":"2026-05-17T23:56:30.874978Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.874978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Kernelization for Edge Dominating Set under Structural Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Eva-Maria C. Hols, Stefan Kratsch","submitted_at":"2019-01-11T13:57:33Z","abstract_excerpt":"In the NP-hard Edge Dominating Set problem (EDS) we are given a graph $G=(V,E)$ and an integer $k$, and need to determine whether there is a set $F\\subseteq E$ of at most $k$ edges that are incident with all (other) edges of $G$. It is known that this problem is fixed-parameter tractable and admits a polynomial kernel when parameterized by $k$. A caveat for this parameter is that it needs to be large, i.e., at least equal to half the size of a maximum matching of $G$, for instances not to be trivially negative. Motivated by this, we study the existence of polynomial kernels for EDS when parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03582","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":"1901.03582","created_at":"2026-05-17T23:56:30.875046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03582v1","created_at":"2026-05-17T23:56:30.875046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03582","created_at":"2026-05-17T23:56:30.875046+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3NLCP5QGV76","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3NLCP5QGV76W6YY","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3NLCP5Q","created_at":"2026-05-18T12:33:24.271573+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/Q3NLCP5QGV76W6YYWOVCY7Y2UA","json":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA.json","graph_json":"https://pith.science/api/pith-number/Q3NLCP5QGV76W6YYWOVCY7Y2UA/graph.json","events_json":"https://pith.science/api/pith-number/Q3NLCP5QGV76W6YYWOVCY7Y2UA/events.json","paper":"https://pith.science/paper/Q3NLCP5Q"},"agent_actions":{"view_html":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA","download_json":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA.json","view_paper":"https://pith.science/paper/Q3NLCP5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03582&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3NLCP5QGV76W6YYWOVCY7Y2UA/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3NLCP5QGV76W6YYWOVCY7Y2UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA/action/storage_attestation","attest_author":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA/action/author_attestation","sign_citation":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA/action/citation_signature","submit_replication":"https://pith.science/pith/Q3NLCP5QGV76W6YYWOVCY7Y2UA/action/replication_record"}},"created_at":"2026-05-17T23:56:30.875046+00:00","updated_at":"2026-05-17T23:56:30.875046+00:00"}