{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TFIBJ2LFRRNM6GVLT57CMCHP5I","short_pith_number":"pith:TFIBJ2LF","schema_version":"1.0","canonical_sha256":"995014e9658c5acf1aab9f7e2608efea34b0c7962e4a2cfa0d4966fcd2f17b30","source":{"kind":"arxiv","id":"1109.5325","version":2},"attestation_state":"computed","paper":{"title":"Online Sum-Radii Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitris Fotakis, Paraschos Koutris","submitted_at":"2011-09-25T06:08:37Z","abstract_excerpt":"In Online Sum-Radii Clustering, n demand points arrive online and must be irrevocably assigned to a cluster upon arrival. The cost of each cluster is the sum of a fixed opening cost and its radius, and the objective is to minimize the total cost of the clusters opened by the algorithm. We show that the deterministic competitive ratio of Online Sum-Radii Clustering for general metric spaces is \\Theta(\\log n), where the upper bound follows from a primal-dual algorithm and holds for general metric spaces, and the lower bound is valid for ternary Hierarchically Well-Separated Trees (HSTs) and for "},"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":"1109.5325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-25T06:08:37Z","cross_cats_sorted":[],"title_canon_sha256":"e7607b5ff9f08ddc2002841ae2db61f3d466e261cb3016b59396a75defd35b38","abstract_canon_sha256":"7c2d9e5f0cf03a1af8dbf0b1ba029370ddfc1cb4ba97a32a199a314d93a2ffa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.304924Z","signature_b64":"LmXSTTPiX4vk7rjA/XNrJ6NVl97bmYLEG0wnhYlwPpFn3Vu0vma9lmoTVQ+EpuCPeTJlnj2NrpdvY/9mT2v3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"995014e9658c5acf1aab9f7e2608efea34b0c7962e4a2cfa0d4966fcd2f17b30","last_reissued_at":"2026-05-18T02:21:36.304327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.304327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Sum-Radii Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitris Fotakis, Paraschos Koutris","submitted_at":"2011-09-25T06:08:37Z","abstract_excerpt":"In Online Sum-Radii Clustering, n demand points arrive online and must be irrevocably assigned to a cluster upon arrival. The cost of each cluster is the sum of a fixed opening cost and its radius, and the objective is to minimize the total cost of the clusters opened by the algorithm. We show that the deterministic competitive ratio of Online Sum-Radii Clustering for general metric spaces is \\Theta(\\log n), where the upper bound follows from a primal-dual algorithm and holds for general metric spaces, and the lower bound is valid for ternary Hierarchically Well-Separated Trees (HSTs) and for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5325","kind":"arxiv","version":2},"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":"1109.5325","created_at":"2026-05-18T02:21:36.304410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5325v2","created_at":"2026-05-18T02:21:36.304410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5325","created_at":"2026-05-18T02:21:36.304410+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFIBJ2LFRRNM","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFIBJ2LFRRNM6GVL","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFIBJ2LF","created_at":"2026-05-18T12:26:42.757692+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/TFIBJ2LFRRNM6GVLT57CMCHP5I","json":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I.json","graph_json":"https://pith.science/api/pith-number/TFIBJ2LFRRNM6GVLT57CMCHP5I/graph.json","events_json":"https://pith.science/api/pith-number/TFIBJ2LFRRNM6GVLT57CMCHP5I/events.json","paper":"https://pith.science/paper/TFIBJ2LF"},"agent_actions":{"view_html":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I","download_json":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I.json","view_paper":"https://pith.science/paper/TFIBJ2LF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5325&json=true","fetch_graph":"https://pith.science/api/pith-number/TFIBJ2LFRRNM6GVLT57CMCHP5I/graph.json","fetch_events":"https://pith.science/api/pith-number/TFIBJ2LFRRNM6GVLT57CMCHP5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I/action/storage_attestation","attest_author":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I/action/author_attestation","sign_citation":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I/action/citation_signature","submit_replication":"https://pith.science/pith/TFIBJ2LFRRNM6GVLT57CMCHP5I/action/replication_record"}},"created_at":"2026-05-18T02:21:36.304410+00:00","updated_at":"2026-05-18T02:21:36.304410+00:00"}