{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7QJCI4MSWWEFL37KCIFCS7GSIO","short_pith_number":"pith:7QJCI4MS","schema_version":"1.0","canonical_sha256":"fc12247192b58855efea120a297cd243b2522788d80920a7ce48ab5b10b5c403","source":{"kind":"arxiv","id":"1605.04986","version":1},"attestation_state":"computed","paper":{"title":"A Constant-Factor Bi-Criteria Approximation Guarantee for $k$-means++","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Dennis Wei","submitted_at":"2016-05-16T23:41:55Z","abstract_excerpt":"This paper studies the $k$-means++ algorithm for clustering as well as the class of $D^\\ell$ sampling algorithms to which $k$-means++ belongs. It is shown that for any constant factor $\\beta > 1$, selecting $\\beta k$ cluster centers by $D^\\ell$ sampling yields a constant-factor approximation to the optimal clustering with $k$ centers, in expectation and without conditions on the dataset. This result extends the previously known $O(\\log k)$ guarantee for the case $\\beta = 1$ to the constant-factor bi-criteria regime. It also improves upon an existing constant-factor bi-criteria result that hold"},"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":"1605.04986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T23:41:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"c1b979c37211407a8d4a996254219ce6ee37bf1db9ab1cdddda07437e2f66545","abstract_canon_sha256":"9ac40cc1177b180a68405d062451e57611463bf195e64a60edee9185f8ac1bd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.777162Z","signature_b64":"IWllnPpXdhGYA+2ZlIY0KpMMr71WdE5o1rMdv2133AVjdSxkbugXat927tk+rHLCqslJvEBkDKe5UpVwUMZQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc12247192b58855efea120a297cd243b2522788d80920a7ce48ab5b10b5c403","last_reissued_at":"2026-05-18T01:14:37.776498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.776498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constant-Factor Bi-Criteria Approximation Guarantee for $k$-means++","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Dennis Wei","submitted_at":"2016-05-16T23:41:55Z","abstract_excerpt":"This paper studies the $k$-means++ algorithm for clustering as well as the class of $D^\\ell$ sampling algorithms to which $k$-means++ belongs. It is shown that for any constant factor $\\beta > 1$, selecting $\\beta k$ cluster centers by $D^\\ell$ sampling yields a constant-factor approximation to the optimal clustering with $k$ centers, in expectation and without conditions on the dataset. This result extends the previously known $O(\\log k)$ guarantee for the case $\\beta = 1$ to the constant-factor bi-criteria regime. It also improves upon an existing constant-factor bi-criteria result that hold"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04986","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":"1605.04986","created_at":"2026-05-18T01:14:37.776598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04986v1","created_at":"2026-05-18T01:14:37.776598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04986","created_at":"2026-05-18T01:14:37.776598+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/7QJCI4MSWWEFL37KCIFCS7GSIO","json":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO.json","graph_json":"https://pith.science/api/pith-number/7QJCI4MSWWEFL37KCIFCS7GSIO/graph.json","events_json":"https://pith.science/api/pith-number/7QJCI4MSWWEFL37KCIFCS7GSIO/events.json","paper":"https://pith.science/paper/7QJCI4MS"},"agent_actions":{"view_html":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO","download_json":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO.json","view_paper":"https://pith.science/paper/7QJCI4MS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04986&json=true","fetch_graph":"https://pith.science/api/pith-number/7QJCI4MSWWEFL37KCIFCS7GSIO/graph.json","fetch_events":"https://pith.science/api/pith-number/7QJCI4MSWWEFL37KCIFCS7GSIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/action/storage_attestation","attest_author":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/action/author_attestation","sign_citation":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/action/citation_signature","submit_replication":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/action/replication_record"}},"created_at":"2026-05-18T01:14:37.776598+00:00","updated_at":"2026-05-18T01:14:37.776598+00:00"}