{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JOV5JCDGTYFJ22IESLQFU2SZLA","short_pith_number":"pith:JOV5JCDG","canonical_record":{"source":{"id":"1110.2897","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:24:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b724d4bf7f3fb862c879d3ad71a921be7509301ef2e6d4f73286c35e33685828","abstract_canon_sha256":"c260a8c4385e13c88ebc95c0b26c237385c01e87273bfc161a9fec410f846971"},"schema_version":"1.0"},"canonical_sha256":"4babd488669e0a9d690492e05a6a5958226f6b2bce03f533250647a2b96adc55","source":{"kind":"arxiv","id":"1110.2897","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2897","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2897v3","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2897","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"JOV5JCDGTYFJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JOV5JCDGTYFJ22IE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JOV5JCDG","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JOV5JCDGTYFJ22IESLQFU2SZLA","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2897","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:24:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b724d4bf7f3fb862c879d3ad71a921be7509301ef2e6d4f73286c35e33685828","abstract_canon_sha256":"c260a8c4385e13c88ebc95c0b26c237385c01e87273bfc161a9fec410f846971"},"schema_version":"1.0"},"canonical_sha256":"4babd488669e0a9d690492e05a6a5958226f6b2bce03f533250647a2b96adc55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.349103Z","signature_b64":"UoWZt9cFvLVmrlGl7LP+5maHqYr7akiCzlM81VFD8jnUBircxS5QIz4DUK3v1di3tAQYKLZA07ORqzaF2F/vAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4babd488669e0a9d690492e05a6a5958226f6b2bce03f533250647a2b96adc55","last_reissued_at":"2026-05-18T02:21:35.348548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.348548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2897","source_version":3,"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-18T02:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ChGN5scs7Cwk63ghoZb2L+ymzL5x5lF9cmfAcxrVfkRYeSLxzSl4OJlufpSnjJNENkzBSLc7xAlh9DguzLgKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:41:11.745979Z"},"content_sha256":"1e33e5340d5a3ad66e3f2c916549e89223ab385f109f75d8316c489ced21d063","schema_version":"1.0","event_id":"sha256:1e33e5340d5a3ad66e3f2c916549e89223ab385f109f75d8316c489ced21d063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JOV5JCDGTYFJ22IESLQFU2SZLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Dimensionality Reduction for k-means Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Anastasios Zouzias, Christos Boutsidis, Michael W. Mahoney, Petros Drineas","submitted_at":"2011-10-13T11:24:59Z","abstract_excerpt":"We study the topic of dimensionality reduction for $k$-means clustering. Dimensionality reduction encompasses the union of two approaches: \\emph{feature selection} and \\emph{feature extraction}. A feature selection based algorithm for $k$-means clustering selects a small subset of the input features and then applies $k$-means clustering on the selected features. A feature extraction based algorithm for $k$-means clustering constructs a small set of new artificial features and then applies $k$-means clustering on the constructed features. Despite the significance of $k$-means clustering as well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2897","kind":"arxiv","version":3},"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-18T02:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rj6fbGaP+1QtiBsnLqsXvnjtEehTesL5Vf1He/4DDf85zUvG518KfpKM6NVY64NqCYC77WBQ1UjkRTA5L5qwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:41:11.746331Z"},"content_sha256":"2de57d7b129abd0e235c87f21a0d66f62cd5eb9644a43d95b935e4363961d369","schema_version":"1.0","event_id":"sha256:2de57d7b129abd0e235c87f21a0d66f62cd5eb9644a43d95b935e4363961d369"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/bundle.json","state_url":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/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-05T10:41:11Z","links":{"resolver":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA","bundle":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/bundle.json","state":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JOV5JCDGTYFJ22IESLQFU2SZLA","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":"c260a8c4385e13c88ebc95c0b26c237385c01e87273bfc161a9fec410f846971","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:24:59Z","title_canon_sha256":"b724d4bf7f3fb862c879d3ad71a921be7509301ef2e6d4f73286c35e33685828"},"schema_version":"1.0","source":{"id":"1110.2897","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2897","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2897v3","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2897","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"JOV5JCDGTYFJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JOV5JCDGTYFJ22IE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JOV5JCDG","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:2de57d7b129abd0e235c87f21a0d66f62cd5eb9644a43d95b935e4363961d369","target":"graph","created_at":"2026-05-18T02:21:35Z","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":"We study the topic of dimensionality reduction for $k$-means clustering. Dimensionality reduction encompasses the union of two approaches: \\emph{feature selection} and \\emph{feature extraction}. A feature selection based algorithm for $k$-means clustering selects a small subset of the input features and then applies $k$-means clustering on the selected features. A feature extraction based algorithm for $k$-means clustering constructs a small set of new artificial features and then applies $k$-means clustering on the constructed features. Despite the significance of $k$-means clustering as well","authors_text":"Anastasios Zouzias, Christos Boutsidis, Michael W. Mahoney, Petros Drineas","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:24:59Z","title":"Randomized Dimensionality Reduction for k-means Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2897","kind":"arxiv","version":3},"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:1e33e5340d5a3ad66e3f2c916549e89223ab385f109f75d8316c489ced21d063","target":"record","created_at":"2026-05-18T02:21:35Z","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":"c260a8c4385e13c88ebc95c0b26c237385c01e87273bfc161a9fec410f846971","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:24:59Z","title_canon_sha256":"b724d4bf7f3fb862c879d3ad71a921be7509301ef2e6d4f73286c35e33685828"},"schema_version":"1.0","source":{"id":"1110.2897","kind":"arxiv","version":3}},"canonical_sha256":"4babd488669e0a9d690492e05a6a5958226f6b2bce03f533250647a2b96adc55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4babd488669e0a9d690492e05a6a5958226f6b2bce03f533250647a2b96adc55","first_computed_at":"2026-05-18T02:21:35.348548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:35.348548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UoWZt9cFvLVmrlGl7LP+5maHqYr7akiCzlM81VFD8jnUBircxS5QIz4DUK3v1di3tAQYKLZA07ORqzaF2F/vAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:35.349103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2897","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e33e5340d5a3ad66e3f2c916549e89223ab385f109f75d8316c489ced21d063","sha256:2de57d7b129abd0e235c87f21a0d66f62cd5eb9644a43d95b935e4363961d369"],"state_sha256":"7cc17a995e6642b1dfd579b3e5af0949ce9a51851866d7375468c609deb12bc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVM4bkOS53nVOab++dNELQChb/HtAPJHW4s118pqDZ08sdxi9Hmu3TpaYwZ5d/YgBwu0tsS8OaMksyoWuYVdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:41:11.748273Z","bundle_sha256":"e4209d62288ae5ed5095ae695d7785b260a5021e0e32717479b3d6147f599b2d"}}