{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:76LP57LS3KFNM5D6VCOIQMDSES","short_pith_number":"pith:76LP57LS","schema_version":"1.0","canonical_sha256":"ff96fefd72da8ad6747ea89c88307224b25c7d17ab698ef421bbfdc806881b26","source":{"kind":"arxiv","id":"1204.3488","version":3},"attestation_state":"computed","paper":{"title":"Efficient sub-5 approximations for minimum dominating sets in unit disk graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Raphael Machado, Vin\\'icius G. P. de S\\'a","submitted_at":"2012-04-16T13:59:38Z","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"},"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":"1204.3488","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-16T13:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"ed49b05eecea27a0a6a89b68e95dcb69ae37b28835137401091b23efb8e5d725","abstract_canon_sha256":"bc1d774f26c0364ad0305b2d1c357121e6d35002ca34927106240fbde58a1514"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:01.272607Z","signature_b64":"JxwHuKIAmF4EJzs8ieJUBq7I5kO+RfrQXrQ3O587+KT8BI0SQtvEZ6zWkQ6cBQsV/FPcrpYFphfu5Av0Vs2nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff96fefd72da8ad6747ea89c88307224b25c7d17ab698ef421bbfdc806881b26","last_reissued_at":"2026-05-18T03:00:01.271795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:01.271795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient sub-5 approximations for minimum dominating sets in unit disk graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Raphael Machado, Vin\\'icius G. P. de S\\'a","submitted_at":"2012-04-16T13:59:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3488","kind":"arxiv","version":3},"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":"1204.3488","created_at":"2026-05-18T03:00:01.271932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3488v3","created_at":"2026-05-18T03:00:01.271932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3488","created_at":"2026-05-18T03:00:01.271932+00:00"},{"alias_kind":"pith_short_12","alias_value":"76LP57LS3KFN","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"76LP57LS3KFNM5D6","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"76LP57LS","created_at":"2026-05-18T12:26:56.085431+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/76LP57LS3KFNM5D6VCOIQMDSES","json":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES.json","graph_json":"https://pith.science/api/pith-number/76LP57LS3KFNM5D6VCOIQMDSES/graph.json","events_json":"https://pith.science/api/pith-number/76LP57LS3KFNM5D6VCOIQMDSES/events.json","paper":"https://pith.science/paper/76LP57LS"},"agent_actions":{"view_html":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES","download_json":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES.json","view_paper":"https://pith.science/paper/76LP57LS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3488&json=true","fetch_graph":"https://pith.science/api/pith-number/76LP57LS3KFNM5D6VCOIQMDSES/graph.json","fetch_events":"https://pith.science/api/pith-number/76LP57LS3KFNM5D6VCOIQMDSES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES/action/storage_attestation","attest_author":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES/action/author_attestation","sign_citation":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES/action/citation_signature","submit_replication":"https://pith.science/pith/76LP57LS3KFNM5D6VCOIQMDSES/action/replication_record"}},"created_at":"2026-05-18T03:00:01.271932+00:00","updated_at":"2026-05-18T03:00:01.271932+00:00"}