{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WQUPMKWYZSH5SAX2Y3O7WT4J2A","short_pith_number":"pith:WQUPMKWY","schema_version":"1.0","canonical_sha256":"b428f62ad8cc8fd902fac6ddfb4f89d022618a6d91372340c69d7b4625706313","source":{"kind":"arxiv","id":"1707.02577","version":1},"attestation_state":"computed","paper":{"title":"Dynamic clustering to minimize the sum of radii","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Dariusz Leniowski, Monika Henzinger","submitted_at":"2017-07-09T13:16:15Z","abstract_excerpt":"In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem.\n  We present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose"},"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":"1707.02577","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-07-09T13:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"d2b6f46fa2c50b9d57d9359729931608825cfcf0a0b40f5fd2449d218fbde931","abstract_canon_sha256":"d8c603636302f7325a1bb5d0af37a5e4be7f9cc13243df03189bce1cc90b4a38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:36.434783Z","signature_b64":"CrMeY74SRpRSLvJyUOfcVXGrbsXWtB4ko3/eXyO/hU0ANzHtLxAQw3Kl0YCjY2mEzGGUp+tvTc6oX7ZgxsopAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b428f62ad8cc8fd902fac6ddfb4f89d022618a6d91372340c69d7b4625706313","last_reissued_at":"2026-05-18T00:40:36.434044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:36.434044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic clustering to minimize the sum of radii","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Dariusz Leniowski, Monika Henzinger","submitted_at":"2017-07-09T13:16:15Z","abstract_excerpt":"In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem.\n  We present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02577","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":""},"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":"1707.02577","created_at":"2026-05-18T00:40:36.434167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02577v1","created_at":"2026-05-18T00:40:36.434167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02577","created_at":"2026-05-18T00:40:36.434167+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQUPMKWYZSH5","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQUPMKWYZSH5SAX2","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQUPMKWY","created_at":"2026-05-18T12:31:53.515858+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/WQUPMKWYZSH5SAX2Y3O7WT4J2A","json":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A.json","graph_json":"https://pith.science/api/pith-number/WQUPMKWYZSH5SAX2Y3O7WT4J2A/graph.json","events_json":"https://pith.science/api/pith-number/WQUPMKWYZSH5SAX2Y3O7WT4J2A/events.json","paper":"https://pith.science/paper/WQUPMKWY"},"agent_actions":{"view_html":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A","download_json":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A.json","view_paper":"https://pith.science/paper/WQUPMKWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02577&json=true","fetch_graph":"https://pith.science/api/pith-number/WQUPMKWYZSH5SAX2Y3O7WT4J2A/graph.json","fetch_events":"https://pith.science/api/pith-number/WQUPMKWYZSH5SAX2Y3O7WT4J2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A/action/storage_attestation","attest_author":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A/action/author_attestation","sign_citation":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A/action/citation_signature","submit_replication":"https://pith.science/pith/WQUPMKWYZSH5SAX2Y3O7WT4J2A/action/replication_record"}},"created_at":"2026-05-18T00:40:36.434167+00:00","updated_at":"2026-05-18T00:40:36.434167+00:00"}