{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZJN4OQIQVXJBTA5JIRTU72IJFY","short_pith_number":"pith:ZJN4OQIQ","schema_version":"1.0","canonical_sha256":"ca5bc74110add21983a944674fe9092e19b705c5e953f5025d544bd7e0db15a3","source":{"kind":"arxiv","id":"1403.7890","version":1},"attestation_state":"computed","paper":{"title":"Sparse K-Means with $\\ell_{\\infty}/\\ell_0$ Penalty for High-Dimensional Data Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Rongjian Li, Xiangyu Chang, Yu Wang, Zongben Xu","submitted_at":"2014-03-31T07:18:55Z","abstract_excerpt":"Sparse clustering, which aims to find a proper partition of an extremely high-dimensional data set with redundant noise features, has been attracted more and more interests in recent years. The existing studies commonly solve the problem in a framework of maximizing the weighted feature contributions subject to a $\\ell_2/\\ell_1$ penalty. Nevertheless, this framework has two serious drawbacks: One is that the solution of the framework unavoidably involves a considerable portion of redundant noise features in many situations, and the other is that the framework neither offers intuitive explanati"},"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":"1403.7890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-31T07:18:55Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"6c190432bfc32f60f3f56529d854ffaf66f8b58f2ddd417ce81edf4df5a3c0d3","abstract_canon_sha256":"5352a192f07fb590f1683f0f2bfbbdb4fed34c799a547a79f118253ef7b63d7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:01.796427Z","signature_b64":"+gppP1BUAUadIDjuu9Ctle5GWmNhngMw3ZbyTXPtIeB09jQNkxXW8lggt2JnIe329z2iMMPV3mk2Y1/8NPsgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca5bc74110add21983a944674fe9092e19b705c5e953f5025d544bd7e0db15a3","last_reissued_at":"2026-05-17T23:53:01.795784Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:01.795784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse K-Means with $\\ell_{\\infty}/\\ell_0$ Penalty for High-Dimensional Data Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Rongjian Li, Xiangyu Chang, Yu Wang, Zongben Xu","submitted_at":"2014-03-31T07:18:55Z","abstract_excerpt":"Sparse clustering, which aims to find a proper partition of an extremely high-dimensional data set with redundant noise features, has been attracted more and more interests in recent years. The existing studies commonly solve the problem in a framework of maximizing the weighted feature contributions subject to a $\\ell_2/\\ell_1$ penalty. Nevertheless, this framework has two serious drawbacks: One is that the solution of the framework unavoidably involves a considerable portion of redundant noise features in many situations, and the other is that the framework neither offers intuitive explanati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7890","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":"1403.7890","created_at":"2026-05-17T23:53:01.795881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7890v1","created_at":"2026-05-17T23:53:01.795881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7890","created_at":"2026-05-17T23:53:01.795881+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJN4OQIQVXJB","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJN4OQIQVXJBTA5J","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJN4OQIQ","created_at":"2026-05-18T12:28:59.999130+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/ZJN4OQIQVXJBTA5JIRTU72IJFY","json":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY.json","graph_json":"https://pith.science/api/pith-number/ZJN4OQIQVXJBTA5JIRTU72IJFY/graph.json","events_json":"https://pith.science/api/pith-number/ZJN4OQIQVXJBTA5JIRTU72IJFY/events.json","paper":"https://pith.science/paper/ZJN4OQIQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY","download_json":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY.json","view_paper":"https://pith.science/paper/ZJN4OQIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7890&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJN4OQIQVXJBTA5JIRTU72IJFY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJN4OQIQVXJBTA5JIRTU72IJFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY/action/storage_attestation","attest_author":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY/action/author_attestation","sign_citation":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY/action/citation_signature","submit_replication":"https://pith.science/pith/ZJN4OQIQVXJBTA5JIRTU72IJFY/action/replication_record"}},"created_at":"2026-05-17T23:53:01.795881+00:00","updated_at":"2026-05-17T23:53:01.795881+00:00"}