{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EHD2PUGJQXBTQGRWX5OEHK66XN","short_pith_number":"pith:EHD2PUGJ","schema_version":"1.0","canonical_sha256":"21c7a7d0c985c3381a36bf5c43abdebb722ed6ef6ae650c461a89c52fd2b578a","source":{"kind":"arxiv","id":"1110.5190","version":1},"attestation_state":"computed","paper":{"title":"Constant-factor approximation of domination number in sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Zdenek Dvorak","submitted_at":"2011-10-24T10:36:50Z","abstract_excerpt":"The k-domination number of a graph is the minimum size of a set X such that every vertex of G is in distance at most k from X. We give a linear time constant-factor approximation algorithm for k-domination number in classes of graphs with bounded expansion, which include e.g. proper minor-closed graph classes, classes closed on topological minors or classes of graphs that can be drawn on a fixed surface with bounded number of crossings on each edge.\n  The algorithm is based on the following approximate min-max characterization. A subset A of vertices of a graph G is d-independent if the distan"},"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":"1110.5190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-24T10:36:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6218d5aa9f0516a0da175a6871e887b102598588422a1180fc905bbc22a3dda8","abstract_canon_sha256":"48bd143a01f566df23b1628d4cb4e4fdf2ca350153591378b8d7fdaf09bcddac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.458839Z","signature_b64":"xOVlO00nOlWg8WwYimG1271gHSJ5ZXqhekDDpZCQK69qMx6ArZONGfbbfCnpBDBYJ5GuqjbFY7j3PgRSxuvaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21c7a7d0c985c3381a36bf5c43abdebb722ed6ef6ae650c461a89c52fd2b578a","last_reissued_at":"2026-05-18T04:10:24.458298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.458298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-factor approximation of domination number in sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Zdenek Dvorak","submitted_at":"2011-10-24T10:36:50Z","abstract_excerpt":"The k-domination number of a graph is the minimum size of a set X such that every vertex of G is in distance at most k from X. We give a linear time constant-factor approximation algorithm for k-domination number in classes of graphs with bounded expansion, which include e.g. proper minor-closed graph classes, classes closed on topological minors or classes of graphs that can be drawn on a fixed surface with bounded number of crossings on each edge.\n  The algorithm is based on the following approximate min-max characterization. A subset A of vertices of a graph G is d-independent if the distan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5190","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":"1110.5190","created_at":"2026-05-18T04:10:24.458392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5190v1","created_at":"2026-05-18T04:10:24.458392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5190","created_at":"2026-05-18T04:10:24.458392+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHD2PUGJQXBT","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHD2PUGJQXBTQGRW","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHD2PUGJ","created_at":"2026-05-18T12:26:28.662955+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/EHD2PUGJQXBTQGRWX5OEHK66XN","json":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN.json","graph_json":"https://pith.science/api/pith-number/EHD2PUGJQXBTQGRWX5OEHK66XN/graph.json","events_json":"https://pith.science/api/pith-number/EHD2PUGJQXBTQGRWX5OEHK66XN/events.json","paper":"https://pith.science/paper/EHD2PUGJ"},"agent_actions":{"view_html":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN","download_json":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN.json","view_paper":"https://pith.science/paper/EHD2PUGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5190&json=true","fetch_graph":"https://pith.science/api/pith-number/EHD2PUGJQXBTQGRWX5OEHK66XN/graph.json","fetch_events":"https://pith.science/api/pith-number/EHD2PUGJQXBTQGRWX5OEHK66XN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN/action/storage_attestation","attest_author":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN/action/author_attestation","sign_citation":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN/action/citation_signature","submit_replication":"https://pith.science/pith/EHD2PUGJQXBTQGRWX5OEHK66XN/action/replication_record"}},"created_at":"2026-05-18T04:10:24.458392+00:00","updated_at":"2026-05-18T04:10:24.458392+00:00"}