{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XDV7I2LPEH4F4NB3FOZABC7VZ5","short_pith_number":"pith:XDV7I2LP","schema_version":"1.0","canonical_sha256":"b8ebf4696f21f85e343b2bb2008bf5cf76f1d086191fd17a4087d703847fa48e","source":{"kind":"arxiv","id":"1601.04586","version":4},"attestation_state":"computed","paper":{"title":"Sparse Convex Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Binhuan Wang, Will Wei Sun, Yilong Zhang, Yixin Fang","submitted_at":"2016-01-18T16:03:35Z","abstract_excerpt":"Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex clustering has not yet been investigated in the high-dimensional clustering scenario, where the data contains a large number of features and many of them carry no information about the clustering structure. In this paper, we demonstrate that the performance of convex clustering co"},"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":"1601.04586","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-01-18T16:03:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2530c7296f9930b8e5b6073153da4af2d96e291195a93ec74fc52749b70c5260","abstract_canon_sha256":"ea5524df67488a2479cdd99cd6a9d20e084e9aacb1b30bbd3fe9dd15d5bbaa73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.023576Z","signature_b64":"5oyy40FA+suUFm9SPOzBZ95Fb2jIfyYd8w0CQqp9ut1orpZr1zJBh4YgJfh1Xu7jHUKLL4O9LCKGKxOXLTFJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ebf4696f21f85e343b2bb2008bf5cf76f1d086191fd17a4087d703847fa48e","last_reissued_at":"2026-05-17T23:57:16.023177Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.023177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Convex Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Binhuan Wang, Will Wei Sun, Yilong Zhang, Yixin Fang","submitted_at":"2016-01-18T16:03:35Z","abstract_excerpt":"Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex clustering has not yet been investigated in the high-dimensional clustering scenario, where the data contains a large number of features and many of them carry no information about the clustering structure. In this paper, we demonstrate that the performance of convex clustering co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04586","kind":"arxiv","version":4},"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":"1601.04586","created_at":"2026-05-17T23:57:16.023241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04586v4","created_at":"2026-05-17T23:57:16.023241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04586","created_at":"2026-05-17T23:57:16.023241+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDV7I2LPEH4F","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDV7I2LPEH4F4NB3","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDV7I2LP","created_at":"2026-05-18T12:30:51.357362+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/XDV7I2LPEH4F4NB3FOZABC7VZ5","json":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5.json","graph_json":"https://pith.science/api/pith-number/XDV7I2LPEH4F4NB3FOZABC7VZ5/graph.json","events_json":"https://pith.science/api/pith-number/XDV7I2LPEH4F4NB3FOZABC7VZ5/events.json","paper":"https://pith.science/paper/XDV7I2LP"},"agent_actions":{"view_html":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5","download_json":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5.json","view_paper":"https://pith.science/paper/XDV7I2LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04586&json=true","fetch_graph":"https://pith.science/api/pith-number/XDV7I2LPEH4F4NB3FOZABC7VZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/XDV7I2LPEH4F4NB3FOZABC7VZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5/action/storage_attestation","attest_author":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5/action/author_attestation","sign_citation":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5/action/citation_signature","submit_replication":"https://pith.science/pith/XDV7I2LPEH4F4NB3FOZABC7VZ5/action/replication_record"}},"created_at":"2026-05-17T23:57:16.023241+00:00","updated_at":"2026-05-17T23:57:16.023241+00:00"}