{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:U2RTC25RYD5CED64RMUBF64SDE","short_pith_number":"pith:U2RTC25R","schema_version":"1.0","canonical_sha256":"a6a3316bb1c0fa220fdc8b2812fb9219361ec1f5039aafad6a4fcac37b87ede3","source":{"kind":"arxiv","id":"2303.16841","version":1},"attestation_state":"computed","paper":{"title":"Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Defeng Sun, Jiaming Ma, Tieyong Zeng, Yancheng Yuan, Ziwen Wang","submitted_at":"2023-03-29T16:47:25Z","abstract_excerpt":"In this paper, we propose a randomly projected convex clustering model for clustering a collection of $n$ high dimensional data points in $\\mathbb{R}^d$ with $K$ hidden clusters. Compared to the convex clustering model for clustering original data with dimension $d$, we prove that, under some mild conditions, the perfect recovery of the cluster membership assignments of the convex clustering model, if exists, can be preserved by the randomly projected convex clustering model with embedding dimension $m = O(\\epsilon^{-2}\\log(n))$, where $0 < \\epsilon < 1$ is some given parameter. We further pro"},"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":"2303.16841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-29T16:47:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"650a9b0751299ae61e2b54c897acde59c031454680532533d2b7bf55598f7d8f","abstract_canon_sha256":"ea85a037f48ca477a013c23f003697f71802cdc426edb42ffb5edacaf9567232"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:10.855425Z","signature_b64":"dG89egg2aeL1lR+Kx7hL9a0YTLEDR8CqupCDqwCzwgIJXdN+nydJfVin+5zBnYk3/LOpIGUEQ2ia2b+T280PDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6a3316bb1c0fa220fdc8b2812fb9219361ec1f5039aafad6a4fcac37b87ede3","last_reissued_at":"2026-07-05T05:56:10.855030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:10.855030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Defeng Sun, Jiaming Ma, Tieyong Zeng, Yancheng Yuan, Ziwen Wang","submitted_at":"2023-03-29T16:47:25Z","abstract_excerpt":"In this paper, we propose a randomly projected convex clustering model for clustering a collection of $n$ high dimensional data points in $\\mathbb{R}^d$ with $K$ hidden clusters. Compared to the convex clustering model for clustering original data with dimension $d$, we prove that, under some mild conditions, the perfect recovery of the cluster membership assignments of the convex clustering model, if exists, can be preserved by the randomly projected convex clustering model with embedding dimension $m = O(\\epsilon^{-2}\\log(n))$, where $0 < \\epsilon < 1$ is some given parameter. We further pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16841","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.16841/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.16841","created_at":"2026-07-05T05:56:10.855086+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16841v1","created_at":"2026-07-05T05:56:10.855086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16841","created_at":"2026-07-05T05:56:10.855086+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2RTC25RYD5C","created_at":"2026-07-05T05:56:10.855086+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2RTC25RYD5CED64","created_at":"2026-07-05T05:56:10.855086+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2RTC25R","created_at":"2026-07-05T05:56:10.855086+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15964","citing_title":"PyClustrPath: An efficient Python package for generating clustering paths with GPU acceleration","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE","json":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE.json","graph_json":"https://pith.science/api/pith-number/U2RTC25RYD5CED64RMUBF64SDE/graph.json","events_json":"https://pith.science/api/pith-number/U2RTC25RYD5CED64RMUBF64SDE/events.json","paper":"https://pith.science/paper/U2RTC25R"},"agent_actions":{"view_html":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE","download_json":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE.json","view_paper":"https://pith.science/paper/U2RTC25R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16841&json=true","fetch_graph":"https://pith.science/api/pith-number/U2RTC25RYD5CED64RMUBF64SDE/graph.json","fetch_events":"https://pith.science/api/pith-number/U2RTC25RYD5CED64RMUBF64SDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE/action/storage_attestation","attest_author":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE/action/author_attestation","sign_citation":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE/action/citation_signature","submit_replication":"https://pith.science/pith/U2RTC25RYD5CED64RMUBF64SDE/action/replication_record"}},"created_at":"2026-07-05T05:56:10.855086+00:00","updated_at":"2026-07-05T05:56:10.855086+00:00"}