{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OUAMQOMKXMC2U4BQYN6UP4HTWD","short_pith_number":"pith:OUAMQOMK","schema_version":"1.0","canonical_sha256":"7500c8398abb05aa7030c37d47f0f3b0c31d7b3987a75a674bd2ca78ca8b2970","source":{"kind":"arxiv","id":"1710.00954","version":3},"attestation_state":"computed","paper":{"title":"Online Unit Covering in Euclidean Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Anirban Ghosh, Csaba D. T\\'oth","submitted_at":"2017-10-03T01:40:43Z","abstract_excerpt":"We revisit the online Unit Covering problem in higher dimensions: Given a set of $n$ points in $\\mathbb{R}^d$, that arrive one by one, cover the points by balls of unit radius, so as to minimize the number of balls used. In this paper, we work in $\\mathbb{R}^d$ using Euclidean distance. The current best competitive ratio of an online algorithm, $O(2^d d \\log{d})$, is due to Charikar et al. (2004); their algorithm is deterministic.\n  (I) We give an online deterministic algorithm with competitive ratio $O(1.321^d)$, thereby sharply improving on the earlier record by a large exponential factor. I"},"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.00954","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-10-03T01:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"88457837d535c423ecefc0bfd6b9d70d6d1cc70e1d692de4441362c972ee5230","abstract_canon_sha256":"5d72e1145e1c871f4927608300abc7dd366ea8bcdd844e7c6eb3c7def6409975"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:11.850409Z","signature_b64":"j+rOOKSMgzXYSdBj9/V5rkkv8VYqTKEyy7zE+rO1tGO0t33bGbhI3vMrWukbuGS6mut8wglI6aEroKbdgbyhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7500c8398abb05aa7030c37d47f0f3b0c31d7b3987a75a674bd2ca78ca8b2970","last_reissued_at":"2026-05-18T00:07:11.849691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:11.849691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Unit Covering in Euclidean Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Anirban Ghosh, Csaba D. T\\'oth","submitted_at":"2017-10-03T01:40:43Z","abstract_excerpt":"We revisit the online Unit Covering problem in higher dimensions: Given a set of $n$ points in $\\mathbb{R}^d$, that arrive one by one, cover the points by balls of unit radius, so as to minimize the number of balls used. In this paper, we work in $\\mathbb{R}^d$ using Euclidean distance. The current best competitive ratio of an online algorithm, $O(2^d d \\log{d})$, is due to Charikar et al. (2004); their algorithm is deterministic.\n  (I) We give an online deterministic algorithm with competitive ratio $O(1.321^d)$, thereby sharply improving on the earlier record by a large exponential factor. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00954","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":"1710.00954","created_at":"2026-05-18T00:07:11.849832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00954v3","created_at":"2026-05-18T00:07:11.849832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00954","created_at":"2026-05-18T00:07:11.849832+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUAMQOMKXMC2","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUAMQOMKXMC2U4BQ","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUAMQOMK","created_at":"2026-05-18T12:31:34.259226+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/OUAMQOMKXMC2U4BQYN6UP4HTWD","json":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD.json","graph_json":"https://pith.science/api/pith-number/OUAMQOMKXMC2U4BQYN6UP4HTWD/graph.json","events_json":"https://pith.science/api/pith-number/OUAMQOMKXMC2U4BQYN6UP4HTWD/events.json","paper":"https://pith.science/paper/OUAMQOMK"},"agent_actions":{"view_html":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD","download_json":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD.json","view_paper":"https://pith.science/paper/OUAMQOMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00954&json=true","fetch_graph":"https://pith.science/api/pith-number/OUAMQOMKXMC2U4BQYN6UP4HTWD/graph.json","fetch_events":"https://pith.science/api/pith-number/OUAMQOMKXMC2U4BQYN6UP4HTWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/action/storage_attestation","attest_author":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/action/author_attestation","sign_citation":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/action/citation_signature","submit_replication":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/action/replication_record"}},"created_at":"2026-05-18T00:07:11.849832+00:00","updated_at":"2026-05-18T00:07:11.849832+00:00"}