{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EHD2PUGJQXBTQGRWX5OEHK66XN","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":"48bd143a01f566df23b1628d4cb4e4fdf2ca350153591378b8d7fdaf09bcddac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-24T10:36:50Z","title_canon_sha256":"6218d5aa9f0516a0da175a6871e887b102598588422a1180fc905bbc22a3dda8"},"schema_version":"1.0","source":{"id":"1110.5190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5190","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5190v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5190","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"EHD2PUGJQXBT","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EHD2PUGJQXBTQGRW","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EHD2PUGJ","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:630dc957af4458a2037600da38b620bf8c82048d69d7c10bc25a36b80a1dffae","target":"graph","created_at":"2026-05-18T04:10:24Z","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":"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","authors_text":"Zdenek Dvorak","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-24T10:36:50Z","title":"Constant-factor approximation of domination number in sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5190","kind":"arxiv","version":1},"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:3972279be389c6739ca102bca45176ac198baf6e6e7484dcd39087557d44e214","target":"record","created_at":"2026-05-18T04:10:24Z","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":"48bd143a01f566df23b1628d4cb4e4fdf2ca350153591378b8d7fdaf09bcddac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-24T10:36:50Z","title_canon_sha256":"6218d5aa9f0516a0da175a6871e887b102598588422a1180fc905bbc22a3dda8"},"schema_version":"1.0","source":{"id":"1110.5190","kind":"arxiv","version":1}},"canonical_sha256":"21c7a7d0c985c3381a36bf5c43abdebb722ed6ef6ae650c461a89c52fd2b578a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21c7a7d0c985c3381a36bf5c43abdebb722ed6ef6ae650c461a89c52fd2b578a","first_computed_at":"2026-05-18T04:10:24.458298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:24.458298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xOVlO00nOlWg8WwYimG1271gHSJ5ZXqhekDDpZCQK69qMx6ArZONGfbbfCnpBDBYJ5GuqjbFY7j3PgRSxuvaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:24.458839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3972279be389c6739ca102bca45176ac198baf6e6e7484dcd39087557d44e214","sha256:630dc957af4458a2037600da38b620bf8c82048d69d7c10bc25a36b80a1dffae"],"state_sha256":"c609cc88f696ab1dde0dba10d0fd55799a38117c08d9dd4c44b344771cbef78d"}