{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EHX4NZJXZGENU6HLJZ4MMNARMV","short_pith_number":"pith:EHX4NZJX","schema_version":"1.0","canonical_sha256":"21efc6e537c988da78eb4e78c63411657786b750d472ae803c734eee4909bf0e","source":{"kind":"arxiv","id":"1603.08976","version":2},"attestation_state":"computed","paper":{"title":"Local Search Yields a PTAS for k-Means in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG"],"primary_cat":"cs.DS","authors_text":"Mohammad R. Salavatipour, Mohsen Rezapour, Zachary Friggstad","submitted_at":"2016-03-29T21:41:55Z","abstract_excerpt":"The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly $k$-means: given a set of data points and a parameter $k$, select $k$ centres and partition the data points into $k$ clusters around these centres so that the sum of squares of distances of the points to their cluster centre is minimized. Typically these data points lie $\\mathbb{R}^d$ for some $d\\geq 2$.\n $k$-means and the first algorithms for it were introduced in the 1950's. Since then, hundreds of papers have studied this problem and many algorithms have been proposed for it. 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":"1603.08976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T21:41:55Z","cross_cats_sorted":["cs.AI","cs.CG"],"title_canon_sha256":"6e8322f121ed3d67e5a437878da299f220fdba9e093c5a43211f8abd271397de","abstract_canon_sha256":"304998a2466d86653392ecd9943a48f99bc114f18edf63ff39e2b84be0eef208"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:08.400517Z","signature_b64":"LOwHLb0013wRTYg1mti+1ThkFxOgJRPrGgcvSK3zmyn3X5EVsXfZgzkS+AlClyWR0ivgkSfIFhPb1+CmOk6cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21efc6e537c988da78eb4e78c63411657786b750d472ae803c734eee4909bf0e","last_reissued_at":"2026-05-18T00:53:08.400119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:08.400119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Search Yields a PTAS for k-Means in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG"],"primary_cat":"cs.DS","authors_text":"Mohammad R. Salavatipour, Mohsen Rezapour, Zachary Friggstad","submitted_at":"2016-03-29T21:41:55Z","abstract_excerpt":"The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly $k$-means: given a set of data points and a parameter $k$, select $k$ centres and partition the data points into $k$ clusters around these centres so that the sum of squares of distances of the points to their cluster centre is minimized. Typically these data points lie $\\mathbb{R}^d$ for some $d\\geq 2$.\n $k$-means and the first algorithms for it were introduced in the 1950's. Since then, hundreds of papers have studied this problem and many algorithms have been proposed for it. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08976","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":"1603.08976","created_at":"2026-05-18T00:53:08.400174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08976v2","created_at":"2026-05-18T00:53:08.400174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08976","created_at":"2026-05-18T00:53:08.400174+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHX4NZJXZGEN","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHX4NZJXZGENU6HL","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHX4NZJX","created_at":"2026-05-18T12:30:12.583610+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/EHX4NZJXZGENU6HLJZ4MMNARMV","json":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV.json","graph_json":"https://pith.science/api/pith-number/EHX4NZJXZGENU6HLJZ4MMNARMV/graph.json","events_json":"https://pith.science/api/pith-number/EHX4NZJXZGENU6HLJZ4MMNARMV/events.json","paper":"https://pith.science/paper/EHX4NZJX"},"agent_actions":{"view_html":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV","download_json":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV.json","view_paper":"https://pith.science/paper/EHX4NZJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08976&json=true","fetch_graph":"https://pith.science/api/pith-number/EHX4NZJXZGENU6HLJZ4MMNARMV/graph.json","fetch_events":"https://pith.science/api/pith-number/EHX4NZJXZGENU6HLJZ4MMNARMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/action/storage_attestation","attest_author":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/action/author_attestation","sign_citation":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/action/citation_signature","submit_replication":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/action/replication_record"}},"created_at":"2026-05-18T00:53:08.400174+00:00","updated_at":"2026-05-18T00:53:08.400174+00:00"}