{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:76LP57LS3KFNM5D6VCOIQMDSES","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":"bc1d774f26c0364ad0305b2d1c357121e6d35002ca34927106240fbde58a1514","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-16T13:59:38Z","title_canon_sha256":"ed49b05eecea27a0a6a89b68e95dcb69ae37b28835137401091b23efb8e5d725"},"schema_version":"1.0","source":{"id":"1204.3488","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3488","created_at":"2026-05-18T03:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3488v3","created_at":"2026-05-18T03:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3488","created_at":"2026-05-18T03:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"76LP57LS3KFN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"76LP57LS3KFNM5D6","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"76LP57LS","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ed653029c192752a68c09197268e0f3fd73bceed77ad65ee32491b7f1a430b10","target":"graph","created_at":"2026-05-18T03:00:01Z","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":"A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their application in wireless ad-hoc networks. Because the minimum dominating set problem for unit disk graphs is NP-hard, numerous approximation algorithms have been proposed in the literature, including some PTAS. However, since the proposal of a linear-time 5-approximation algorithm in 1995, the lack of efficient algorithms attaining better approximation factors has aroused attention. We introduce a linear-time O(n+m) approximation algorithm that takes","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Raphael Machado, Vin\\'icius G. P. de S\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-16T13:59:38Z","title":"Efficient sub-5 approximations for minimum dominating sets in unit disk graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3488","kind":"arxiv","version":3},"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:e5f7ecbcd7f42b4b2ea2494cad52a88a0d9e46b7f151edd7fb3106ea4825e651","target":"record","created_at":"2026-05-18T03:00:01Z","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":"bc1d774f26c0364ad0305b2d1c357121e6d35002ca34927106240fbde58a1514","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-16T13:59:38Z","title_canon_sha256":"ed49b05eecea27a0a6a89b68e95dcb69ae37b28835137401091b23efb8e5d725"},"schema_version":"1.0","source":{"id":"1204.3488","kind":"arxiv","version":3}},"canonical_sha256":"ff96fefd72da8ad6747ea89c88307224b25c7d17ab698ef421bbfdc806881b26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff96fefd72da8ad6747ea89c88307224b25c7d17ab698ef421bbfdc806881b26","first_computed_at":"2026-05-18T03:00:01.271795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:01.271795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxwHuKIAmF4EJzs8ieJUBq7I5kO+RfrQXrQ3O587+KT8BI0SQtvEZ6zWkQ6cBQsV/FPcrpYFphfu5Av0Vs2nDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:01.272607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3488","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5f7ecbcd7f42b4b2ea2494cad52a88a0d9e46b7f151edd7fb3106ea4825e651","sha256:ed653029c192752a68c09197268e0f3fd73bceed77ad65ee32491b7f1a430b10"],"state_sha256":"f08977761bff7a6e186d589e725ff02082bd4eeef0f79bbc2b35ba137ae2f90b"}