{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QAXIFSRS2SS6TG5I66NG5W66KJ","short_pith_number":"pith:QAXIFSRS","schema_version":"1.0","canonical_sha256":"802e82ca32d4a5e99ba8f79a6edbde52466610ed0e01bc965c83b2b8b71f9a60","source":{"kind":"arxiv","id":"1602.07277","version":2},"attestation_state":"computed","paper":{"title":"A Simple Approach to Sparse Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ery Arias-Castro, Xiao Pu","submitted_at":"2016-02-23T19:49:16Z","abstract_excerpt":"Consider the problem of sparse clustering, where it is assumed that only a subset of the features are useful for clustering purposes. In the framework of the COSA method of Friedman and Meulman, subsequently improved in the form of the Sparse K-means method of Witten and Tibshirani, a natural and simpler hill-climbing approach is introduced. The new method is shown to be competitive with these two methods and others."},"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":"1602.07277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-23T19:49:16Z","cross_cats_sorted":[],"title_canon_sha256":"75a7e8d78353fe9b4a0ea6cba6f96049d24f54b8d8387ec8b545b42b8584455e","abstract_canon_sha256":"d9241932b0f8f4ae9537efbff2d06e6b1b0e2068f4483a015c8893e4cab7b385"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.409593Z","signature_b64":"LGdxXb5d6H+aqrwxQ+Np7zFpaTr+0wWWyhoDFcPZQdsUItftaoSchfQaWeSPwlr33PMZss31h/e5DZ8YsLXODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"802e82ca32d4a5e99ba8f79a6edbde52466610ed0e01bc965c83b2b8b71f9a60","last_reissued_at":"2026-05-18T00:49:52.409147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.409147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Approach to Sparse Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ery Arias-Castro, Xiao Pu","submitted_at":"2016-02-23T19:49:16Z","abstract_excerpt":"Consider the problem of sparse clustering, where it is assumed that only a subset of the features are useful for clustering purposes. In the framework of the COSA method of Friedman and Meulman, subsequently improved in the form of the Sparse K-means method of Witten and Tibshirani, a natural and simpler hill-climbing approach is introduced. The new method is shown to be competitive with these two methods and others."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07277","kind":"arxiv","version":2},"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":"1602.07277","created_at":"2026-05-18T00:49:52.409210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07277v2","created_at":"2026-05-18T00:49:52.409210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07277","created_at":"2026-05-18T00:49:52.409210+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAXIFSRS2SS6","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAXIFSRS2SS6TG5I","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAXIFSRS","created_at":"2026-05-18T12:30:39.010887+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/QAXIFSRS2SS6TG5I66NG5W66KJ","json":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ.json","graph_json":"https://pith.science/api/pith-number/QAXIFSRS2SS6TG5I66NG5W66KJ/graph.json","events_json":"https://pith.science/api/pith-number/QAXIFSRS2SS6TG5I66NG5W66KJ/events.json","paper":"https://pith.science/paper/QAXIFSRS"},"agent_actions":{"view_html":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ","download_json":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ.json","view_paper":"https://pith.science/paper/QAXIFSRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07277&json=true","fetch_graph":"https://pith.science/api/pith-number/QAXIFSRS2SS6TG5I66NG5W66KJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QAXIFSRS2SS6TG5I66NG5W66KJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ/action/storage_attestation","attest_author":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ/action/author_attestation","sign_citation":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ/action/citation_signature","submit_replication":"https://pith.science/pith/QAXIFSRS2SS6TG5I66NG5W66KJ/action/replication_record"}},"created_at":"2026-05-18T00:49:52.409210+00:00","updated_at":"2026-05-18T00:49:52.409210+00:00"}