{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:CGPFE7HOLZGROM6SCAG43AR65G","short_pith_number":"pith:CGPFE7HO","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"},"canonical_sha256":"119e527cee5e4d1733d2100dcd823ee98ed743b80d8b5f3b405bbd060a311a7a","source":{"kind":"arxiv","id":"2112.07050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.07050","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"2112.07050v1","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07050","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"CGPFE7HOLZGR","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"pith_short_16","alias_value":"CGPFE7HOLZGROM6S","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"pith_short_8","alias_value":"CGPFE7HO","created_at":"2026-07-05T03:40:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:CGPFE7HOLZGROM6SCAG43AR65G","target":"record","payload":{"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"},"canonical_sha256":"119e527cee5e4d1733d2100dcd823ee98ed743b80d8b5f3b405bbd060a311a7a","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"},"source_kind":"arxiv","source_id":"2112.07050","source_version":1,"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-07-05T03:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HRWJN30tao4a3IDCJ4ZvePNbTvlos8IDNy/8rj1WVB97IlsPz61mwCiXQ90p9yYpcKDf0+U9Op27KJflMGDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:19:22.254847Z"},"content_sha256":"3f32c31bf8f72bbe82bd6ebf7bb74076a3e7d870cf1ab235dc3a81097c4b4a7c","schema_version":"1.0","event_id":"sha256:3f32c31bf8f72bbe82bd6ebf7bb74076a3e7d870cf1ab235dc3a81097c4b4a7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:CGPFE7HOLZGROM6SCAG43AR65G","target":"graph","payload":{"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"},"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-07-05T03:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ByFwMs2h0880m3SRluD0ta9j94CtOvATKMR8pTMoDv+fCflbKWJD/93D1FzwPp+XD0oUYu7bY7s0LC0HujhlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:19:22.255218Z"},"content_sha256":"483eefcc0db90f044427b1a83339592202845ce9df6beaaae13778d072a6b263","schema_version":"1.0","event_id":"sha256:483eefcc0db90f044427b1a83339592202845ce9df6beaaae13778d072a6b263"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/bundle.json","state_url":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGPFE7HOLZGROM6SCAG43AR65G/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-07-07T03:19:22Z","links":{"resolver":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G","bundle":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/bundle.json","state":"https://pith.science/pith/CGPFE7HOLZGROM6SCAG43AR65G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGPFE7HOLZGROM6SCAG43AR65G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:CGPFE7HOLZGROM6SCAG43AR65G","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":"7476fca94cbef6de8062f266e098f57da041209e7832efe861ba58097a71185b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-13T22:29:23Z","title_canon_sha256":"068779bde2fe9c0e0c29fc6e0e3df5a11449e12a5746187ddd6de876f7fc5c4a"},"schema_version":"1.0","source":{"id":"2112.07050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.07050","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"2112.07050v1","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07050","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"CGPFE7HOLZGR","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"pith_short_16","alias_value":"CGPFE7HOLZGROM6S","created_at":"2026-07-05T03:40:20Z"},{"alias_kind":"pith_short_8","alias_value":"CGPFE7HO","created_at":"2026-07-05T03:40:20Z"}],"graph_snapshots":[{"event_id":"sha256:483eefcc0db90f044427b1a83339592202845ce9df6beaaae13778d072a6b263","target":"graph","created_at":"2026-07-05T03:40:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.07050/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Hossein Esfandiari, MohammadHossein Bateni, Rajesh Jayaram, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-13T22:29:23Z","title":"Optimal Fully Dynamic $k$-Centers Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07050","kind":"arxiv","version":1},"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:3f32c31bf8f72bbe82bd6ebf7bb74076a3e7d870cf1ab235dc3a81097c4b4a7c","target":"record","created_at":"2026-07-05T03:40:20Z","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":"7476fca94cbef6de8062f266e098f57da041209e7832efe861ba58097a71185b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-13T22:29:23Z","title_canon_sha256":"068779bde2fe9c0e0c29fc6e0e3df5a11449e12a5746187ddd6de876f7fc5c4a"},"schema_version":"1.0","source":{"id":"2112.07050","kind":"arxiv","version":1}},"canonical_sha256":"119e527cee5e4d1733d2100dcd823ee98ed743b80d8b5f3b405bbd060a311a7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"119e527cee5e4d1733d2100dcd823ee98ed743b80d8b5f3b405bbd060a311a7a","first_computed_at":"2026-07-05T03:40:20.436932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:40:20.436932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+7XoM2JNUUIRXQraIAG7n5TU5l3vc/OnLKucTLVXQXQl2r+BUQrx6/ccE3DxIzkL2QLqGubYXU8GmzfMpkYDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:40:20.437302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.07050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f32c31bf8f72bbe82bd6ebf7bb74076a3e7d870cf1ab235dc3a81097c4b4a7c","sha256:483eefcc0db90f044427b1a83339592202845ce9df6beaaae13778d072a6b263"],"state_sha256":"0f0fb0febf88113395617fbc5e0d510d13c149a099ed02814d090cd0b48f13c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGfSpD4npUIJltftJ3vXVkHdcvYgwV8TysUsN2Y/0PenZV3t+fwSRowlMHHDJzYEvgdyG1mjtMgpjh2VHVEABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:19:22.257481Z","bundle_sha256":"999e19598487881120bc0bb63fec6ea9ba6dc240ac9306d816db9cdecf876756"}}