{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SI75QE7AVKYFYJW6JVG6SV2Z7Z","short_pith_number":"pith:SI75QE7A","schema_version":"1.0","canonical_sha256":"923fd813e0aab05c26de4d4de95759fe7cd18a4621c52cd6d1b20ab9a6374b3b","source":{"kind":"arxiv","id":"1710.10010","version":1},"attestation_state":"computed","paper":{"title":"On distance r-dominating and 2r-independent sets in sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-10-27T07:19:22Z","abstract_excerpt":"Dvorak (2013) gave a bound on the minimum size of a distance r dominating set in the terms of the maximum size of a distance 2r independent set and generalized coloring numbers, thus obtaining a constant factor approximation algorithm for the parameters in any class of graphs with bounded expansion. We improve and clarify this dependence using an LP-based argument inspired by the work of Bansal and Umboh (2017)."},"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":"1710.10010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T07:19:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bd089149e6f3285380a723f49af08d74108189828058de1cb5c7a979817ed18f","abstract_canon_sha256":"ca6c552da5bfb4c85d8f3eb79516b1cac2ae5387f2a1990f005ce190ed516d28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:55.000627Z","signature_b64":"edqcfIrK0NWAsZ0jhOiUivvTVs1S0WkygZ+txRDZhqstqvEgMgeLwRaT4LLf5qNU4IJ1Mv8RDdtrh2i4vxd6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"923fd813e0aab05c26de4d4de95759fe7cd18a4621c52cd6d1b20ab9a6374b3b","last_reissued_at":"2026-05-18T00:31:55.000172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:55.000172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On distance r-dominating and 2r-independent sets in sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-10-27T07:19:22Z","abstract_excerpt":"Dvorak (2013) gave a bound on the minimum size of a distance r dominating set in the terms of the maximum size of a distance 2r independent set and generalized coloring numbers, thus obtaining a constant factor approximation algorithm for the parameters in any class of graphs with bounded expansion. We improve and clarify this dependence using an LP-based argument inspired by the work of Bansal and Umboh (2017)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10010","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":"1710.10010","created_at":"2026-05-18T00:31:55.000248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10010v1","created_at":"2026-05-18T00:31:55.000248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10010","created_at":"2026-05-18T00:31:55.000248+00:00"},{"alias_kind":"pith_short_12","alias_value":"SI75QE7AVKYF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SI75QE7AVKYFYJW6","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SI75QE7A","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09180","citing_title":"Domination above r-independence: does sparseness help?","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z","json":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z.json","graph_json":"https://pith.science/api/pith-number/SI75QE7AVKYFYJW6JVG6SV2Z7Z/graph.json","events_json":"https://pith.science/api/pith-number/SI75QE7AVKYFYJW6JVG6SV2Z7Z/events.json","paper":"https://pith.science/paper/SI75QE7A"},"agent_actions":{"view_html":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z","download_json":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z.json","view_paper":"https://pith.science/paper/SI75QE7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10010&json=true","fetch_graph":"https://pith.science/api/pith-number/SI75QE7AVKYFYJW6JVG6SV2Z7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/SI75QE7AVKYFYJW6JVG6SV2Z7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z/action/storage_attestation","attest_author":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z/action/author_attestation","sign_citation":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z/action/citation_signature","submit_replication":"https://pith.science/pith/SI75QE7AVKYFYJW6JVG6SV2Z7Z/action/replication_record"}},"created_at":"2026-05-18T00:31:55.000248+00:00","updated_at":"2026-05-18T00:31:55.000248+00:00"}