{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EXGUUJ6KXVJVJLFKDDSMT7SWQ7","short_pith_number":"pith:EXGUUJ6K","schema_version":"1.0","canonical_sha256":"25cd4a27cabd5354acaa18e4c9fe5687c5b261d3891af67f8b123aafc93fade3","source":{"kind":"arxiv","id":"1502.03316","version":1},"attestation_state":"computed","paper":{"title":"The Hardness of Approximation of Euclidean k-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ali Kemal Sinop, Moses Charikar, Pranjal Awasthi, Ravishankar Krishnaswamy","submitted_at":"2015-02-11T14:38:45Z","abstract_excerpt":"The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in Euclidean space $R^d$, and the goal is to choose $k$ centers in $R^d$ so that the sum of squared distances of each point to its nearest center is minimized. The best approximation algorithms for this problem include a polynomial time constant factor approximation for general $k$ and a $(1+\\epsilon)$-approximation which runs in time $poly(n) 2^{O(k/\\epsilon)}"},"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":"1502.03316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-11T14:38:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e046cada523ce13e88dcfb8aceff9e6d244a746f086403c67dd2bdcbeae49d6f","abstract_canon_sha256":"d03405ee697b222d9f8f53195462f573e7567a3125549105df792688a87c13b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:19.752408Z","signature_b64":"3cJTQ6xFnUyHm19GxxTwZnvAj/KcWW5zurOzAD32kC8GvmAoJVmsKZweeEA4/suSOpsoLS6HfCUpZWvXSfBMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25cd4a27cabd5354acaa18e4c9fe5687c5b261d3891af67f8b123aafc93fade3","last_reissued_at":"2026-05-18T02:27:19.751530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:19.751530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hardness of Approximation of Euclidean k-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ali Kemal Sinop, Moses Charikar, Pranjal Awasthi, Ravishankar Krishnaswamy","submitted_at":"2015-02-11T14:38:45Z","abstract_excerpt":"The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in Euclidean space $R^d$, and the goal is to choose $k$ centers in $R^d$ so that the sum of squared distances of each point to its nearest center is minimized. The best approximation algorithms for this problem include a polynomial time constant factor approximation for general $k$ and a $(1+\\epsilon)$-approximation which runs in time $poly(n) 2^{O(k/\\epsilon)}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03316","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":"1502.03316","created_at":"2026-05-18T02:27:19.751664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03316v1","created_at":"2026-05-18T02:27:19.751664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03316","created_at":"2026-05-18T02:27:19.751664+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXGUUJ6KXVJV","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXGUUJ6KXVJVJLFK","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXGUUJ6K","created_at":"2026-05-18T12:29:19.899920+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/EXGUUJ6KXVJVJLFKDDSMT7SWQ7","json":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7.json","graph_json":"https://pith.science/api/pith-number/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/graph.json","events_json":"https://pith.science/api/pith-number/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/events.json","paper":"https://pith.science/paper/EXGUUJ6K"},"agent_actions":{"view_html":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7","download_json":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7.json","view_paper":"https://pith.science/paper/EXGUUJ6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03316&json=true","fetch_graph":"https://pith.science/api/pith-number/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/action/storage_attestation","attest_author":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/action/author_attestation","sign_citation":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/action/citation_signature","submit_replication":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/action/replication_record"}},"created_at":"2026-05-18T02:27:19.751664+00:00","updated_at":"2026-05-18T02:27:19.751664+00:00"}