{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CGPFE7HOLZGROM6SCAG43AR65G","short_pith_number":"pith:CGPFE7HO","schema_version":"1.0","canonical_sha256":"119e527cee5e4d1733d2100dcd823ee98ed743b80d8b5f3b405bbd060a311a7a","source":{"kind":"arxiv","id":"2112.07050","version":1},"attestation_state":"computed","paper":{"title":"Optimal Fully Dynamic $k$-Centers Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, MohammadHossein Bateni, Rajesh Jayaram, Vahab Mirrokni","submitted_at":"2021-12-13T22:29:23Z","abstract_excerpt":"We present the first algorithm for fully dynamic $k$-centers clustering in an arbitrary metric space that maintains an optimal $2+\\epsilon$ approximation in $O(k \\cdot \\operatorname{polylog}(n,\\Delta))$ amortized update time. Here, $n$ is an upper bound on the number of active points at any time, and $\\Delta$ is the aspect ratio of the data. Previously, the best known amortized update time was $O(k^2\\cdot \\operatorname{polylog}(n,\\Delta))$, and is due to Chan, Gourqin, and Sozio. We demonstrate that the runtime of our algorithm is optimal up to $\\operatorname{polylog}(n,\\Delta)$ factors, even "},"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":"2112.07050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-13T22:29:23Z","cross_cats_sorted":[],"title_canon_sha256":"068779bde2fe9c0e0c29fc6e0e3df5a11449e12a5746187ddd6de876f7fc5c4a","abstract_canon_sha256":"7476fca94cbef6de8062f266e098f57da041209e7832efe861ba58097a71185b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:20.437302Z","signature_b64":"t+7XoM2JNUUIRXQraIAG7n5TU5l3vc/OnLKucTLVXQXQl2r+BUQrx6/ccE3DxIzkL2QLqGubYXU8GmzfMpkYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119e527cee5e4d1733d2100dcd823ee98ed743b80d8b5f3b405bbd060a311a7a","last_reissued_at":"2026-07-05T03:40:20.436932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:20.436932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Fully Dynamic $k$-Centers Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, MohammadHossein Bateni, Rajesh Jayaram, Vahab Mirrokni","submitted_at":"2021-12-13T22:29:23Z","abstract_excerpt":"We present the first algorithm for fully dynamic $k$-centers clustering in an arbitrary metric space that maintains an optimal $2+\\epsilon$ approximation in $O(k \\cdot \\operatorname{polylog}(n,\\Delta))$ amortized update time. Here, $n$ is an upper bound on the number of active points at any time, and $\\Delta$ is the aspect ratio of the data. Previously, the best known amortized update time was $O(k^2\\cdot \\operatorname{polylog}(n,\\Delta))$, and is due to Chan, Gourqin, and Sozio. We demonstrate that the runtime of our algorithm is optimal up to $\\operatorname{polylog}(n,\\Delta)$ factors, even "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07050","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.07050/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.07050","created_at":"2026-07-05T03:40:20.436982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.07050v1","created_at":"2026-07-05T03:40:20.436982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07050","created_at":"2026-07-05T03:40:20.436982+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGPFE7HOLZGR","created_at":"2026-07-05T03:40:20.436982+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGPFE7HOLZGROM6S","created_at":"2026-07-05T03:40:20.436982+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGPFE7HO","created_at":"2026-07-05T03:40:20.436982+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/CGPFE7HOLZGROM6SCAG43AR65G","json":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G.json","graph_json":"https://pith.science/api/pith-number/CGPFE7HOLZGROM6SCAG43AR65G/graph.json","events_json":"https://pith.science/api/pith-number/CGPFE7HOLZGROM6SCAG43AR65G/events.json","paper":"https://pith.science/paper/CGPFE7HO"},"agent_actions":{"view_html":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G","download_json":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G.json","view_paper":"https://pith.science/paper/CGPFE7HO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.07050&json=true","fetch_graph":"https://pith.science/api/pith-number/CGPFE7HOLZGROM6SCAG43AR65G/graph.json","fetch_events":"https://pith.science/api/pith-number/CGPFE7HOLZGROM6SCAG43AR65G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/action/storage_attestation","attest_author":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/action/author_attestation","sign_citation":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/action/citation_signature","submit_replication":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/action/replication_record"}},"created_at":"2026-07-05T03:40:20.436982+00:00","updated_at":"2026-07-05T03:40:20.436982+00:00"}