{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Y54O6K34YIUTL32F7JVSEQ6AIW","short_pith_number":"pith:Y54O6K34","schema_version":"1.0","canonical_sha256":"c778ef2b7cc22935ef45fa6b2243c045919f209a443c0200508e0159887809b4","source":{"kind":"arxiv","id":"1011.4632","version":1},"attestation_state":"computed","paper":{"title":"Random Projections for $k$-means Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Anastasios Zouzias, Christos Boutsidis, Petros Drineas","submitted_at":"2010-11-21T02:37:10Z","abstract_excerpt":"This paper discusses the topic of dimensionality reduction for $k$-means clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a matrix $A \\in \\RR^{n \\times d}$) can be projected into $t = \\Omega(k / \\eps^2)$ dimensions, for any $\\eps \\in (0,1/3)$, in $O(n d \\lceil \\eps^{-2} k/ \\log(d) \\rceil )$ time, such that with constant probability the optimal $k$-partition of the point set is preserved within a factor of $2+\\eps$. The projection is done by post-multiplying $A$ with a $d \\times t$ random matrix $R$ having entries $+1/\\sqrt{t}$ or $-1/\\sqrt{t}$ with equal probability. "},"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":"1011.4632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-11-21T02:37:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"006d0224e57cd0b3987eb6e1ee2dc807020588016c529fd119d0c5287369aa38","abstract_canon_sha256":"319b931cb6a4b2fd45f06e21c0a6259901df3118d38a4e82dc7f3b8331b7f831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:02.681990Z","signature_b64":"InevOGS9erNcKXQsw3+8OwFJAp/iKw4NfTl5Qq6747kBJ7wbNN5XsxUz9jqx50J8And1Z0YHI/fJEFiWh91XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c778ef2b7cc22935ef45fa6b2243c045919f209a443c0200508e0159887809b4","last_reissued_at":"2026-05-18T04:23:02.681371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:02.681371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Projections for $k$-means Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Anastasios Zouzias, Christos Boutsidis, Petros Drineas","submitted_at":"2010-11-21T02:37:10Z","abstract_excerpt":"This paper discusses the topic of dimensionality reduction for $k$-means clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a matrix $A \\in \\RR^{n \\times d}$) can be projected into $t = \\Omega(k / \\eps^2)$ dimensions, for any $\\eps \\in (0,1/3)$, in $O(n d \\lceil \\eps^{-2} k/ \\log(d) \\rceil )$ time, such that with constant probability the optimal $k$-partition of the point set is preserved within a factor of $2+\\eps$. The projection is done by post-multiplying $A$ with a $d \\times t$ random matrix $R$ having entries $+1/\\sqrt{t}$ or $-1/\\sqrt{t}$ with equal probability. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4632","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":"1011.4632","created_at":"2026-05-18T04:23:02.681473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4632v1","created_at":"2026-05-18T04:23:02.681473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4632","created_at":"2026-05-18T04:23:02.681473+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y54O6K34YIUT","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y54O6K34YIUTL32F","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y54O6K34","created_at":"2026-05-18T12:26:17.028572+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/Y54O6K34YIUTL32F7JVSEQ6AIW","json":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW.json","graph_json":"https://pith.science/api/pith-number/Y54O6K34YIUTL32F7JVSEQ6AIW/graph.json","events_json":"https://pith.science/api/pith-number/Y54O6K34YIUTL32F7JVSEQ6AIW/events.json","paper":"https://pith.science/paper/Y54O6K34"},"agent_actions":{"view_html":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW","download_json":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW.json","view_paper":"https://pith.science/paper/Y54O6K34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4632&json=true","fetch_graph":"https://pith.science/api/pith-number/Y54O6K34YIUTL32F7JVSEQ6AIW/graph.json","fetch_events":"https://pith.science/api/pith-number/Y54O6K34YIUTL32F7JVSEQ6AIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/action/storage_attestation","attest_author":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/action/author_attestation","sign_citation":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/action/citation_signature","submit_replication":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/action/replication_record"}},"created_at":"2026-05-18T04:23:02.681473+00:00","updated_at":"2026-05-18T04:23:02.681473+00:00"}