{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GEBPJ5SSHZ5CMMMCPCUV7PAAXS","short_pith_number":"pith:GEBPJ5SS","schema_version":"1.0","canonical_sha256":"3102f4f6523e7a26318278a95fbc00bc983df0213b05ac64ddd778be4dc94c72","source":{"kind":"arxiv","id":"1707.09819","version":1},"attestation_state":"computed","paper":{"title":"Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Sebastian Siebertz","submitted_at":"2017-07-31T12:33:49Z","abstract_excerpt":"For $\\alpha\\colon\\mathbb{N}\\rightarrow\\mathbb{R}$, an $\\alpha$-approximate bi-kernel is a polynomial-time algorithm that takes as input an instance $(I, k)$ of a problem $Q$ and outputs an instance $(I',k')$ of a problem $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(k)$-approximate solution of the original instance in polynomial time. This framework of \\emph{lossy kernelization} was recently introduced by Lokshtanov et al. We prove that for every nowhere dense class of graphs, every $"},"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":"1707.09819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-31T12:33:49Z","cross_cats_sorted":[],"title_canon_sha256":"99cc295a38942e00c87f50751c5c58b071e5e4917142aa40d7c7f34e839088e4","abstract_canon_sha256":"6e4788a817ccfb7a1d02b8bcdb8d41c891127599f3fb1378ae76c3987fa02239"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:49.291351Z","signature_b64":"NYFyGiUqLbKj7zaKeNwfrvIo4O1WATy6oGH1cyA7DWkJnJMNqRcHFZyb2ZpMXIWllBmQvNm5yXxRB4077jSYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3102f4f6523e7a26318278a95fbc00bc983df0213b05ac64ddd778be4dc94c72","last_reissued_at":"2026-05-18T00:22:49.290922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:49.290922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Sebastian Siebertz","submitted_at":"2017-07-31T12:33:49Z","abstract_excerpt":"For $\\alpha\\colon\\mathbb{N}\\rightarrow\\mathbb{R}$, an $\\alpha$-approximate bi-kernel is a polynomial-time algorithm that takes as input an instance $(I, k)$ of a problem $Q$ and outputs an instance $(I',k')$ of a problem $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(k)$-approximate solution of the original instance in polynomial time. This framework of \\emph{lossy kernelization} was recently introduced by Lokshtanov et al. We prove that for every nowhere dense class of graphs, every $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09819","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":"1707.09819","created_at":"2026-05-18T00:22:49.290984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09819v1","created_at":"2026-05-18T00:22:49.290984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09819","created_at":"2026-05-18T00:22:49.290984+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEBPJ5SSHZ5C","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEBPJ5SSHZ5CMMMC","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEBPJ5SS","created_at":"2026-05-18T12:31:15.632608+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/GEBPJ5SSHZ5CMMMCPCUV7PAAXS","json":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS.json","graph_json":"https://pith.science/api/pith-number/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/graph.json","events_json":"https://pith.science/api/pith-number/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/events.json","paper":"https://pith.science/paper/GEBPJ5SS"},"agent_actions":{"view_html":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS","download_json":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS.json","view_paper":"https://pith.science/paper/GEBPJ5SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09819&json=true","fetch_graph":"https://pith.science/api/pith-number/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/graph.json","fetch_events":"https://pith.science/api/pith-number/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/action/storage_attestation","attest_author":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/action/author_attestation","sign_citation":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/action/citation_signature","submit_replication":"https://pith.science/pith/GEBPJ5SSHZ5CMMMCPCUV7PAAXS/action/replication_record"}},"created_at":"2026-05-18T00:22:49.290984+00:00","updated_at":"2026-05-18T00:22:49.290984+00:00"}