{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Y54O6K34YIUTL32F7JVSEQ6AIW","short_pith_number":"pith:Y54O6K34","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"},"canonical_sha256":"c778ef2b7cc22935ef45fa6b2243c045919f209a443c0200508e0159887809b4","source":{"kind":"arxiv","id":"1011.4632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4632","created_at":"2026-05-18T04:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4632v1","created_at":"2026-05-18T04:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4632","created_at":"2026-05-18T04:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y54O6K34YIUT","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y54O6K34YIUTL32F","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y54O6K34","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Y54O6K34YIUTL32F7JVSEQ6AIW","target":"record","payload":{"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"},"canonical_sha256":"c778ef2b7cc22935ef45fa6b2243c045919f209a443c0200508e0159887809b4","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"},"source_kind":"arxiv","source_id":"1011.4632","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0ZeW6PGGcEB+yWtZ2HVUDtoBGpTJpewBqtXA/8mlaMUVx74yEOJYx3sX8SSPVw8i77iVhN5oWfQ7zrwI7U1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:28:07.948741Z"},"content_sha256":"e6973b841e56ca86b2f893376d6cadf1671a5f44efffc06fb2eb57e7632037a7","schema_version":"1.0","event_id":"sha256:e6973b841e56ca86b2f893376d6cadf1671a5f44efffc06fb2eb57e7632037a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Y54O6K34YIUTL32F7JVSEQ6AIW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFoWK4iMUbGGnqGzl7sDpWXMhlY2akvwCWGU11jNa500LYDnfGgOOWhGWow37Qxgt4CM/m2uFzGTm6tNUuX5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:28:07.949086Z"},"content_sha256":"320248c6890ffd3124596a71622063c69ce2be5a80cae768f0bbbf6b90626ef2","schema_version":"1.0","event_id":"sha256:320248c6890ffd3124596a71622063c69ce2be5a80cae768f0bbbf6b90626ef2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/bundle.json","state_url":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T08:28:07Z","links":{"resolver":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW","bundle":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/bundle.json","state":"https://pith.science/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y54O6K34YIUTL32F7JVSEQ6AIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Y54O6K34YIUTL32F7JVSEQ6AIW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"319b931cb6a4b2fd45f06e21c0a6259901df3118d38a4e82dc7f3b8331b7f831","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-11-21T02:37:10Z","title_canon_sha256":"006d0224e57cd0b3987eb6e1ee2dc807020588016c529fd119d0c5287369aa38"},"schema_version":"1.0","source":{"id":"1011.4632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4632","created_at":"2026-05-18T04:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4632v1","created_at":"2026-05-18T04:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4632","created_at":"2026-05-18T04:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y54O6K34YIUT","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y54O6K34YIUTL32F","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y54O6K34","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:320248c6890ffd3124596a71622063c69ce2be5a80cae768f0bbbf6b90626ef2","target":"graph","created_at":"2026-05-18T04:23:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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. ","authors_text":"Anastasios Zouzias, Christos Boutsidis, Petros Drineas","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-11-21T02:37:10Z","title":"Random Projections for $k$-means Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4632","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e6973b841e56ca86b2f893376d6cadf1671a5f44efffc06fb2eb57e7632037a7","target":"record","created_at":"2026-05-18T04:23:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"319b931cb6a4b2fd45f06e21c0a6259901df3118d38a4e82dc7f3b8331b7f831","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-11-21T02:37:10Z","title_canon_sha256":"006d0224e57cd0b3987eb6e1ee2dc807020588016c529fd119d0c5287369aa38"},"schema_version":"1.0","source":{"id":"1011.4632","kind":"arxiv","version":1}},"canonical_sha256":"c778ef2b7cc22935ef45fa6b2243c045919f209a443c0200508e0159887809b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c778ef2b7cc22935ef45fa6b2243c045919f209a443c0200508e0159887809b4","first_computed_at":"2026-05-18T04:23:02.681371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:02.681371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"InevOGS9erNcKXQsw3+8OwFJAp/iKw4NfTl5Qq6747kBJ7wbNN5XsxUz9jqx50J8And1Z0YHI/fJEFiWh91XBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:02.681990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6973b841e56ca86b2f893376d6cadf1671a5f44efffc06fb2eb57e7632037a7","sha256:320248c6890ffd3124596a71622063c69ce2be5a80cae768f0bbbf6b90626ef2"],"state_sha256":"e4573b7b461692a6823eeff5665e9915bcac9eda2810a59bf0090551ce0d752a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1CD+VR2+v8H5YuTQc8+gmmC3M/Z1FFuLvmNKRXW8w8xbe6JvqDHNzy9wYLlHV0KpqMVYutG7Yyf0G7R1XROCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:28:07.951054Z","bundle_sha256":"3d7711e8475e5758904e1b3e0a08b6b093218f17053ac09b55e84915da8ac091"}}