{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MPOCK67HT3NMYR6U32FVBHOOIB","short_pith_number":"pith:MPOCK67H","schema_version":"1.0","canonical_sha256":"63dc257be79edacc47d4de8b509dce405c3e5a0efb117b98631db9dd8710ed14","source":{"kind":"arxiv","id":"1706.09339","version":2},"attestation_state":"computed","paper":{"title":"Lossy Kernels for Connected Dominating Set on Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Amer E. Mouawad, Eduard Eiben, Fahad Panolan, Mithilesh Kumar, Sebastian Siebertz","submitted_at":"2017-06-28T15:55:48Z","abstract_excerpt":"For $\\alpha > 1$, an $\\alpha$-approximate (bi-)kernel is a polynomial-time algorithm that takes as input an instance $(I, k)$ of a problem $\\mathcal{Q}$ and outputs an instance $(I',k')$ (of a problem $\\mathcal{Q}'$) of size bounded by a function of $k$ such that, for every $c\\geq 1$, a $c$-approximate solution for the new instance can be turned into a $(c\\cdot\\alpha)$-approximate solution of the original instance in polynomial time. This framework of lossy kernelization was recently introduced by Lokshtanov et al. We study Connected Dominating Set (and its distance-$r$ variant) parameterized "},"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":"1706.09339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T15:55:48Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"0b64f2d4227c724da46592492768b1d5151b2113d802428d532b1c4144bc35bf","abstract_canon_sha256":"518b154d99ab4c40f70550c39ad4fa8f6f44a7892741b867e62e3bcbea8ef847"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:46.378564Z","signature_b64":"JoQcdVkOmWnMhBHBHJBY+7AWUnh4GEjC7h6A29/csQI9NIxKPPBaAgD528YtbUQYEof16kmOF0iWzHxCsB3lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63dc257be79edacc47d4de8b509dce405c3e5a0efb117b98631db9dd8710ed14","last_reissued_at":"2026-05-18T00:22:46.378020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:46.378020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lossy Kernels for Connected Dominating Set on Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Amer E. Mouawad, Eduard Eiben, Fahad Panolan, Mithilesh Kumar, Sebastian Siebertz","submitted_at":"2017-06-28T15:55:48Z","abstract_excerpt":"For $\\alpha > 1$, an $\\alpha$-approximate (bi-)kernel is a polynomial-time algorithm that takes as input an instance $(I, k)$ of a problem $\\mathcal{Q}$ and outputs an instance $(I',k')$ (of a problem $\\mathcal{Q}'$) of size bounded by a function of $k$ such that, for every $c\\geq 1$, a $c$-approximate solution for the new instance can be turned into a $(c\\cdot\\alpha)$-approximate solution of the original instance in polynomial time. This framework of lossy kernelization was recently introduced by Lokshtanov et al. We study Connected Dominating Set (and its distance-$r$ variant) parameterized "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09339","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":"1706.09339","created_at":"2026-05-18T00:22:46.378109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09339v2","created_at":"2026-05-18T00:22:46.378109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09339","created_at":"2026-05-18T00:22:46.378109+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPOCK67HT3NM","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPOCK67HT3NMYR6U","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPOCK67H","created_at":"2026-05-18T12:31:31.346846+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/MPOCK67HT3NMYR6U32FVBHOOIB","json":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB.json","graph_json":"https://pith.science/api/pith-number/MPOCK67HT3NMYR6U32FVBHOOIB/graph.json","events_json":"https://pith.science/api/pith-number/MPOCK67HT3NMYR6U32FVBHOOIB/events.json","paper":"https://pith.science/paper/MPOCK67H"},"agent_actions":{"view_html":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB","download_json":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB.json","view_paper":"https://pith.science/paper/MPOCK67H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09339&json=true","fetch_graph":"https://pith.science/api/pith-number/MPOCK67HT3NMYR6U32FVBHOOIB/graph.json","fetch_events":"https://pith.science/api/pith-number/MPOCK67HT3NMYR6U32FVBHOOIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB/action/storage_attestation","attest_author":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB/action/author_attestation","sign_citation":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB/action/citation_signature","submit_replication":"https://pith.science/pith/MPOCK67HT3NMYR6U32FVBHOOIB/action/replication_record"}},"created_at":"2026-05-18T00:22:46.378109+00:00","updated_at":"2026-05-18T00:22:46.378109+00:00"}