{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JOV5JCDGTYFJ22IESLQFU2SZLA","short_pith_number":"pith:JOV5JCDG","schema_version":"1.0","canonical_sha256":"4babd488669e0a9d690492e05a6a5958226f6b2bce03f533250647a2b96adc55","source":{"kind":"arxiv","id":"1110.2897","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.2897","created_at":"2026-05-18T02:21:35.348632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2897v3","created_at":"2026-05-18T02:21:35.348632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2897","created_at":"2026-05-18T02:21:35.348632+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOV5JCDGTYFJ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOV5JCDGTYFJ22IE","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOV5JCDG","created_at":"2026-05-18T12:26:32.869790+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/JOV5JCDGTYFJ22IESLQFU2SZLA","json":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA.json","graph_json":"https://pith.science/api/pith-number/JOV5JCDGTYFJ22IESLQFU2SZLA/graph.json","events_json":"https://pith.science/api/pith-number/JOV5JCDGTYFJ22IESLQFU2SZLA/events.json","paper":"https://pith.science/paper/JOV5JCDG"},"agent_actions":{"view_html":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA","download_json":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA.json","view_paper":"https://pith.science/paper/JOV5JCDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2897&json=true","fetch_graph":"https://pith.science/api/pith-number/JOV5JCDGTYFJ22IESLQFU2SZLA/graph.json","fetch_events":"https://pith.science/api/pith-number/JOV5JCDGTYFJ22IESLQFU2SZLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/action/storage_attestation","attest_author":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/action/author_attestation","sign_citation":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/action/citation_signature","submit_replication":"https://pith.science/pith/JOV5JCDGTYFJ22IESLQFU2SZLA/action/replication_record"}},"created_at":"2026-05-18T02:21:35.348632+00:00","updated_at":"2026-05-18T02:21:35.348632+00:00"}