{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NLH7HOMOKIGF54J4S2ZYORA3WN","short_pith_number":"pith:NLH7HOMO","schema_version":"1.0","canonical_sha256":"6acff3b98e520c5ef13c96b387441bb36d9c141146859106be19d07d226985bc","source":{"kind":"arxiv","id":"2010.14487","version":1},"attestation_state":"computed","paper":{"title":"Improved Guarantees for k-means++ and k-means++ Parallel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aravind Reddy, Konstantin Makarychev, Liren Shan","submitted_at":"2020-10-27T17:46:00Z","abstract_excerpt":"In this paper, we study k-means++ and k-means++ parallel, the two most popular algorithms for the classic k-means clustering problem. We provide novel analyses and show improved approximation and bi-criteria approximation guarantees for k-means++ and k-means++ parallel. Our results give a better theoretical justification for why these algorithms perform extremely well in practice. We also propose a new variant of k-means++ parallel algorithm (Exponential Race k-means++) that has the same approximation guarantees as k-means++."},"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":"2010.14487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-27T17:46:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8ee8898c02789d3f1ab61bda218ab773ba3c0dc29cc137f82fcf6256f55e57ee","abstract_canon_sha256":"516affbc2c3ff6b4da7b027979c243e6b866ba4133aa7fb0b96eeaaf86148508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:46:35.083212Z","signature_b64":"Y17EtpS4/iEVT2NssqNQpCbANX/WJa3joibVWhtLuNH+3Nfd+xUhLtkIFEDmpw5ksWY31gOgtfv1Rsab3tX0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6acff3b98e520c5ef13c96b387441bb36d9c141146859106be19d07d226985bc","last_reissued_at":"2026-07-05T01:46:35.082828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:46:35.082828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Guarantees for k-means++ and k-means++ Parallel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aravind Reddy, Konstantin Makarychev, Liren Shan","submitted_at":"2020-10-27T17:46:00Z","abstract_excerpt":"In this paper, we study k-means++ and k-means++ parallel, the two most popular algorithms for the classic k-means clustering problem. We provide novel analyses and show improved approximation and bi-criteria approximation guarantees for k-means++ and k-means++ parallel. Our results give a better theoretical justification for why these algorithms perform extremely well in practice. We also propose a new variant of k-means++ parallel algorithm (Exponential Race k-means++) that has the same approximation guarantees as k-means++."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14487","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/2010.14487/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":"2010.14487","created_at":"2026-07-05T01:46:35.082889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.14487v1","created_at":"2026-07-05T01:46:35.082889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14487","created_at":"2026-07-05T01:46:35.082889+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLH7HOMOKIGF","created_at":"2026-07-05T01:46:35.082889+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLH7HOMOKIGF54J4","created_at":"2026-07-05T01:46:35.082889+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLH7HOMO","created_at":"2026-07-05T01:46:35.082889+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/NLH7HOMOKIGF54J4S2ZYORA3WN","json":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN.json","graph_json":"https://pith.science/api/pith-number/NLH7HOMOKIGF54J4S2ZYORA3WN/graph.json","events_json":"https://pith.science/api/pith-number/NLH7HOMOKIGF54J4S2ZYORA3WN/events.json","paper":"https://pith.science/paper/NLH7HOMO"},"agent_actions":{"view_html":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN","download_json":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN.json","view_paper":"https://pith.science/paper/NLH7HOMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.14487&json=true","fetch_graph":"https://pith.science/api/pith-number/NLH7HOMOKIGF54J4S2ZYORA3WN/graph.json","fetch_events":"https://pith.science/api/pith-number/NLH7HOMOKIGF54J4S2ZYORA3WN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN/action/storage_attestation","attest_author":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN/action/author_attestation","sign_citation":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN/action/citation_signature","submit_replication":"https://pith.science/pith/NLH7HOMOKIGF54J4S2ZYORA3WN/action/replication_record"}},"created_at":"2026-07-05T01:46:35.082889+00:00","updated_at":"2026-07-05T01:46:35.082889+00:00"}