{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SHTTY6PY5GHLCMFSVQN2UHRWXJ","short_pith_number":"pith:SHTTY6PY","schema_version":"1.0","canonical_sha256":"91e73c79f8e98eb130b2ac1baa1e36ba524326841d419afed18d73dc6a2e744a","source":{"kind":"arxiv","id":"1507.04227","version":2},"attestation_state":"computed","paper":{"title":"A bi-criteria approximation algorithm for $k$ Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Ward, Konstantin Makarychev, Maxim Sviridenko, Yury Makarychev","submitted_at":"2015-07-15T14:15:01Z","abstract_excerpt":"We consider the classical $k$-means clustering problem in the setting bi-criteria approximation, in which an algoithm is allowed to output $\\beta k > k$ clusters, and must produce a clustering with cost at most $\\alpha$ times the to the cost of the optimal set of $k$ clusters. We argue that this approach is natural in many settings, for which the exact number of clusters is a priori unknown, or unimportant up to a constant factor. We give new bi-criteria approximation algorithms, based on linear programming and local search, respectively, which attain a guarantee $\\alpha(\\beta)$ depending on t"},"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":"1507.04227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-15T14:15:01Z","cross_cats_sorted":[],"title_canon_sha256":"9251bb53ce748fdf8fb942295b8bc361df4d05fb7286096648480fc2af69096c","abstract_canon_sha256":"34b365310886195b6049c0287b390adb52dc21ba8aceeff1512e495f6e152702"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:59.426487Z","signature_b64":"ilDtP5EHLhv0cc/3sW//otXWwSp82VKnJ5JyJMJOLcoPwRKWbr60zVyy9aZEScbVkmfaj8eD2kjQ+XbbSWP1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91e73c79f8e98eb130b2ac1baa1e36ba524326841d419afed18d73dc6a2e744a","last_reissued_at":"2026-05-18T01:35:59.425842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:59.425842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bi-criteria approximation algorithm for $k$ Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Ward, Konstantin Makarychev, Maxim Sviridenko, Yury Makarychev","submitted_at":"2015-07-15T14:15:01Z","abstract_excerpt":"We consider the classical $k$-means clustering problem in the setting bi-criteria approximation, in which an algoithm is allowed to output $\\beta k > k$ clusters, and must produce a clustering with cost at most $\\alpha$ times the to the cost of the optimal set of $k$ clusters. We argue that this approach is natural in many settings, for which the exact number of clusters is a priori unknown, or unimportant up to a constant factor. We give new bi-criteria approximation algorithms, based on linear programming and local search, respectively, which attain a guarantee $\\alpha(\\beta)$ depending on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04227","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":"1507.04227","created_at":"2026-05-18T01:35:59.425920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04227v2","created_at":"2026-05-18T01:35:59.425920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04227","created_at":"2026-05-18T01:35:59.425920+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHTTY6PY5GHL","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHTTY6PY5GHLCMFS","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHTTY6PY","created_at":"2026-05-18T12:29:42.218222+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/SHTTY6PY5GHLCMFSVQN2UHRWXJ","json":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ.json","graph_json":"https://pith.science/api/pith-number/SHTTY6PY5GHLCMFSVQN2UHRWXJ/graph.json","events_json":"https://pith.science/api/pith-number/SHTTY6PY5GHLCMFSVQN2UHRWXJ/events.json","paper":"https://pith.science/paper/SHTTY6PY"},"agent_actions":{"view_html":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ","download_json":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ.json","view_paper":"https://pith.science/paper/SHTTY6PY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04227&json=true","fetch_graph":"https://pith.science/api/pith-number/SHTTY6PY5GHLCMFSVQN2UHRWXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SHTTY6PY5GHLCMFSVQN2UHRWXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/action/storage_attestation","attest_author":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/action/author_attestation","sign_citation":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/action/citation_signature","submit_replication":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/action/replication_record"}},"created_at":"2026-05-18T01:35:59.425920+00:00","updated_at":"2026-05-18T01:35:59.425920+00:00"}