{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7QJCI4MSWWEFL37KCIFCS7GSIO","short_pith_number":"pith:7QJCI4MS","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"},"canonical_sha256":"fc12247192b58855efea120a297cd243b2522788d80920a7ce48ab5b10b5c403","source":{"kind":"arxiv","id":"1605.04986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04986","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04986v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04986","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"7QJCI4MSWWEF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QJCI4MSWWEFL37K","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QJCI4MS","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7QJCI4MSWWEFL37KCIFCS7GSIO","target":"record","payload":{"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"},"canonical_sha256":"fc12247192b58855efea120a297cd243b2522788d80920a7ce48ab5b10b5c403","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"},"source_kind":"arxiv","source_id":"1605.04986","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-05-18T01:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVp5eMJyVcbdneiG5aVEadfdvnYdMmrIg5QkdzkWbfgJQUHYUjiQAZsGf1DRgjVVqn9iEO/FN9abVGbgSlKPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:06:07.502471Z"},"content_sha256":"e76d09b7866c4b7fc7165304ae9896c996827096dd93c6de782fb3bbe1867985","schema_version":"1.0","event_id":"sha256:e76d09b7866c4b7fc7165304ae9896c996827096dd93c6de782fb3bbe1867985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7QJCI4MSWWEFL37KCIFCS7GSIO","target":"graph","payload":{"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"},"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-05-18T01:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZBpDFSka+kT2AXl7VKvSw1zx+T6ntUhAk/qVaaF/VV2Xso04sJoaz/rou0WctT3z6WWsl2mF2QBnU+qfbykDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:06:07.503201Z"},"content_sha256":"3111750417150293925268160d2f96378eae4b0914930f71064133070be82183","schema_version":"1.0","event_id":"sha256:3111750417150293925268160d2f96378eae4b0914930f71064133070be82183"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/bundle.json","state_url":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/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-06-07T19:06:07Z","links":{"resolver":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO","bundle":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/bundle.json","state":"https://pith.science/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QJCI4MSWWEFL37KCIFCS7GSIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7QJCI4MSWWEFL37KCIFCS7GSIO","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":"9ac40cc1177b180a68405d062451e57611463bf195e64a60edee9185f8ac1bd0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T23:41:55Z","title_canon_sha256":"c1b979c37211407a8d4a996254219ce6ee37bf1db9ab1cdddda07437e2f66545"},"schema_version":"1.0","source":{"id":"1605.04986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04986","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04986v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04986","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"7QJCI4MSWWEF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QJCI4MSWWEFL37K","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QJCI4MS","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:3111750417150293925268160d2f96378eae4b0914930f71064133070be82183","target":"graph","created_at":"2026-05-18T01:14:37Z","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"},"paper":{"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","authors_text":"Dennis Wei","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T23:41:55Z","title":"A Constant-Factor Bi-Criteria Approximation Guarantee for $k$-means++"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04986","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:e76d09b7866c4b7fc7165304ae9896c996827096dd93c6de782fb3bbe1867985","target":"record","created_at":"2026-05-18T01:14:37Z","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":"9ac40cc1177b180a68405d062451e57611463bf195e64a60edee9185f8ac1bd0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T23:41:55Z","title_canon_sha256":"c1b979c37211407a8d4a996254219ce6ee37bf1db9ab1cdddda07437e2f66545"},"schema_version":"1.0","source":{"id":"1605.04986","kind":"arxiv","version":1}},"canonical_sha256":"fc12247192b58855efea120a297cd243b2522788d80920a7ce48ab5b10b5c403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc12247192b58855efea120a297cd243b2522788d80920a7ce48ab5b10b5c403","first_computed_at":"2026-05-18T01:14:37.776498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:37.776498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IWllnPpXdhGYA+2ZlIY0KpMMr71WdE5o1rMdv2133AVjdSxkbugXat927tk+rHLCqslJvEBkDKe5UpVwUMZQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:37.777162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e76d09b7866c4b7fc7165304ae9896c996827096dd93c6de782fb3bbe1867985","sha256:3111750417150293925268160d2f96378eae4b0914930f71064133070be82183"],"state_sha256":"5d0b07866c738e9e07fb178b255afda18d543c0f6bfd76c1bc74be0ec6ef10dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3hZXX+yiUB2I24saQV9SmZwytDkr0gOJHIUC30gKMZjQekALPDGOhBJUVMjREZfsWcGCpyanoAMFCdpp3yVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T19:06:07.507131Z","bundle_sha256":"197f7ea9fae20c56e7819f1050af4bc59582b603725d14314386657fd2cecdd8"}}