{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OUAMQOMKXMC2U4BQYN6UP4HTWD","short_pith_number":"pith:OUAMQOMK","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"},"canonical_sha256":"7500c8398abb05aa7030c37d47f0f3b0c31d7b3987a75a674bd2ca78ca8b2970","source":{"kind":"arxiv","id":"1710.00954","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00954","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00954v3","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00954","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"OUAMQOMKXMC2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUAMQOMKXMC2U4BQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUAMQOMK","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OUAMQOMKXMC2U4BQYN6UP4HTWD","target":"record","payload":{"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"},"canonical_sha256":"7500c8398abb05aa7030c37d47f0f3b0c31d7b3987a75a674bd2ca78ca8b2970","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"},"source_kind":"arxiv","source_id":"1710.00954","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HqTmfVizwzvvzzZ5P8/++XkTScA1IIPB2Rq4wa1DXKJ6CYtDbIJ/zX/Cdt4F4jJ20mwG/MXT0dmSevRGq4GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:58:05.792366Z"},"content_sha256":"39dc8ad2d669ef84f2a146ee5e82e0d131a13b856d164656705fff12d5176103","schema_version":"1.0","event_id":"sha256:39dc8ad2d669ef84f2a146ee5e82e0d131a13b856d164656705fff12d5176103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OUAMQOMKXMC2U4BQYN6UP4HTWD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7unjj6S6iMivkacwT7FwF1lgLR1uRU/LUPoxYCwPdUIJhWJMR4pwgapR2yXjeA4vg2HUrOVn8X5YMPKvhJ6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:58:05.792760Z"},"content_sha256":"49733aced65f4527754841678e88407113847b8cba448a30e626688ef4067d4c","schema_version":"1.0","event_id":"sha256:49733aced65f4527754841678e88407113847b8cba448a30e626688ef4067d4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/bundle.json","state_url":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T12:58:05Z","links":{"resolver":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD","bundle":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/bundle.json","state":"https://pith.science/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUAMQOMKXMC2U4BQYN6UP4HTWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OUAMQOMKXMC2U4BQYN6UP4HTWD","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":"5d72e1145e1c871f4927608300abc7dd366ea8bcdd844e7c6eb3c7def6409975","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-10-03T01:40:43Z","title_canon_sha256":"88457837d535c423ecefc0bfd6b9d70d6d1cc70e1d692de4441362c972ee5230"},"schema_version":"1.0","source":{"id":"1710.00954","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00954","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00954v3","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00954","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"OUAMQOMKXMC2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUAMQOMKXMC2U4BQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUAMQOMK","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:49733aced65f4527754841678e88407113847b8cba448a30e626688ef4067d4c","target":"graph","created_at":"2026-05-18T00:07:11Z","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":"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","authors_text":"Adrian Dumitrescu, Anirban Ghosh, Csaba D. T\\'oth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-10-03T01:40:43Z","title":"Online Unit Covering in Euclidean Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00954","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:39dc8ad2d669ef84f2a146ee5e82e0d131a13b856d164656705fff12d5176103","target":"record","created_at":"2026-05-18T00:07:11Z","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":"5d72e1145e1c871f4927608300abc7dd366ea8bcdd844e7c6eb3c7def6409975","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-10-03T01:40:43Z","title_canon_sha256":"88457837d535c423ecefc0bfd6b9d70d6d1cc70e1d692de4441362c972ee5230"},"schema_version":"1.0","source":{"id":"1710.00954","kind":"arxiv","version":3}},"canonical_sha256":"7500c8398abb05aa7030c37d47f0f3b0c31d7b3987a75a674bd2ca78ca8b2970","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7500c8398abb05aa7030c37d47f0f3b0c31d7b3987a75a674bd2ca78ca8b2970","first_computed_at":"2026-05-18T00:07:11.849691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:11.849691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j+rOOKSMgzXYSdBj9/V5rkkv8VYqTKEyy7zE+rO1tGO0t33bGbhI3vMrWukbuGS6mut8wglI6aEroKbdgbyhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:11.850409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00954","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39dc8ad2d669ef84f2a146ee5e82e0d131a13b856d164656705fff12d5176103","sha256:49733aced65f4527754841678e88407113847b8cba448a30e626688ef4067d4c"],"state_sha256":"d1f0ef951204f2e8e2f818532377f78e629904564ecd9432ee8c13ae99f643c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3gbVA8G3+aiMe8Xwe69sYhC5dd+xc3wL+uX6oquWS/3rlZDdHK3bjnQLipGxhaM7By2fXFYGjfpMqToBYiPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:58:05.795034Z","bundle_sha256":"9cf174df411f86b3aeabab9b8c57bce67990005a435a7255e6804f4a7569938b"}}