{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G7CN2GVGDBYI6AASLK7YFVYRYX","short_pith_number":"pith:G7CN2GVG","schema_version":"1.0","canonical_sha256":"37c4dd1aa618708f00125abf82d711c5d412aa46ae28b453d1178e5474d3a9f6","source":{"kind":"arxiv","id":"1612.07925","version":2},"attestation_state":"computed","paper":{"title":"Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashkan Norouzi-Fard, Justin Ward, Ola Svensson, Sara Ahmadian","submitted_at":"2016-12-23T10:34:53Z","abstract_excerpt":"Clustering is a classic topic in optimization with $k$-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best known algorithm for $k$-means with a provable guarantee is a simple local search heuristic yielding an approximation guarantee of $9+\\epsilon$, a ratio that is known to be tight with respect to such methods.\n  We overcome this barrier by presenting a new primal-dual approach that allows us to (1) exploit the geometric structure of $k$-means and (2) to satisfy the hard constraint that at most $k$ clusters are selected without det"},"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":"1612.07925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T10:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"1de77d9abe71eeda38039a7167ff80c01c36037ddc4f5ee1d129c324b1467e1b","abstract_canon_sha256":"147f169472e1d672fd65dac1f85875450ab8671bb6e7dc4793eec2c806d8d9d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:48.620078Z","signature_b64":"1h3tgYna47z5i0u1/RBrP8LwoZCj6P0udw43FUdapljjU62/2GbyoBlRagsugtXXQ3EMTpZqNpepWn0GRj9qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c4dd1aa618708f00125abf82d711c5d412aa46ae28b453d1178e5474d3a9f6","last_reissued_at":"2026-05-18T00:46:48.619382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:48.619382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashkan Norouzi-Fard, Justin Ward, Ola Svensson, Sara Ahmadian","submitted_at":"2016-12-23T10:34:53Z","abstract_excerpt":"Clustering is a classic topic in optimization with $k$-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best known algorithm for $k$-means with a provable guarantee is a simple local search heuristic yielding an approximation guarantee of $9+\\epsilon$, a ratio that is known to be tight with respect to such methods.\n  We overcome this barrier by presenting a new primal-dual approach that allows us to (1) exploit the geometric structure of $k$-means and (2) to satisfy the hard constraint that at most $k$ clusters are selected without det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07925","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":"1612.07925","created_at":"2026-05-18T00:46:48.619526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07925v2","created_at":"2026-05-18T00:46:48.619526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07925","created_at":"2026-05-18T00:46:48.619526+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7CN2GVGDBYI","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7CN2GVGDBYI6AAS","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7CN2GVG","created_at":"2026-05-18T12:30:15.759754+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/G7CN2GVGDBYI6AASLK7YFVYRYX","json":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX.json","graph_json":"https://pith.science/api/pith-number/G7CN2GVGDBYI6AASLK7YFVYRYX/graph.json","events_json":"https://pith.science/api/pith-number/G7CN2GVGDBYI6AASLK7YFVYRYX/events.json","paper":"https://pith.science/paper/G7CN2GVG"},"agent_actions":{"view_html":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX","download_json":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX.json","view_paper":"https://pith.science/paper/G7CN2GVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07925&json=true","fetch_graph":"https://pith.science/api/pith-number/G7CN2GVGDBYI6AASLK7YFVYRYX/graph.json","fetch_events":"https://pith.science/api/pith-number/G7CN2GVGDBYI6AASLK7YFVYRYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/action/storage_attestation","attest_author":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/action/author_attestation","sign_citation":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/action/citation_signature","submit_replication":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/action/replication_record"}},"created_at":"2026-05-18T00:46:48.619526+00:00","updated_at":"2026-05-18T00:46:48.619526+00:00"}