{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GJHK6NVEFCF56UUDU6WMBR2BOS","short_pith_number":"pith:GJHK6NVE","schema_version":"1.0","canonical_sha256":"324eaf36a4288bdf5283a7acc0c74174bd501357a67d97d480adde9b62f88915","source":{"kind":"arxiv","id":"1902.07137","version":1},"attestation_state":"computed","paper":{"title":"Recovery of a mixture of Gaussians by sum-of-norms clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Wen Zhai, Stephen Vavasis, Tao Jiang","submitted_at":"2019-02-19T16:49:02Z","abstract_excerpt":"Sum-of-norms clustering is a method for assigning $n$ points in $\\mathbb{R}^d$ to $K$ clusters, $1\\le K\\le n$, using convex optimization. Recently, Panahi et al.\\ proved that sum-of-norms clustering is guaranteed to recover a mixture of Gaussians under the restriction that the number of samples is not too large. The purpose of this note is to lift this restriction, i.e., show that sum-of-norms clustering with equal weights can recover a mixture of Gaussians even as the number of samples tends to infinity. Our proof relies on an interesting characterization of clusters computed by sum-of-norms "},"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":"1902.07137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T16:49:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"79a3b1867c4998757a90baee2117008afeb7b36f2c2b7bd1ae4c23f94b35a024","abstract_canon_sha256":"8490d69426b6d3a8bef5dded22eb7a59cf5bfb809ffc34b1398f1a861a4cdec0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:39.800451Z","signature_b64":"ko4SI6XsXolwGlvRqmuCvZd4GRLM1LstCidJ+suMM3JbEIuz2HfjioOXRp6RaivjGMlP5mC9oZjuOT9h2WXfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"324eaf36a4288bdf5283a7acc0c74174bd501357a67d97d480adde9b62f88915","last_reissued_at":"2026-05-17T23:53:39.799730Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:39.799730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery of a mixture of Gaussians by sum-of-norms clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Wen Zhai, Stephen Vavasis, Tao Jiang","submitted_at":"2019-02-19T16:49:02Z","abstract_excerpt":"Sum-of-norms clustering is a method for assigning $n$ points in $\\mathbb{R}^d$ to $K$ clusters, $1\\le K\\le n$, using convex optimization. Recently, Panahi et al.\\ proved that sum-of-norms clustering is guaranteed to recover a mixture of Gaussians under the restriction that the number of samples is not too large. The purpose of this note is to lift this restriction, i.e., show that sum-of-norms clustering with equal weights can recover a mixture of Gaussians even as the number of samples tends to infinity. Our proof relies on an interesting characterization of clusters computed by sum-of-norms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07137","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":"1902.07137","created_at":"2026-05-17T23:53:39.799842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07137v1","created_at":"2026-05-17T23:53:39.799842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07137","created_at":"2026-05-17T23:53:39.799842+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJHK6NVEFCF5","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJHK6NVEFCF56UUD","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJHK6NVE","created_at":"2026-05-18T12:33:18.533446+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/GJHK6NVEFCF56UUDU6WMBR2BOS","json":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS.json","graph_json":"https://pith.science/api/pith-number/GJHK6NVEFCF56UUDU6WMBR2BOS/graph.json","events_json":"https://pith.science/api/pith-number/GJHK6NVEFCF56UUDU6WMBR2BOS/events.json","paper":"https://pith.science/paper/GJHK6NVE"},"agent_actions":{"view_html":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS","download_json":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS.json","view_paper":"https://pith.science/paper/GJHK6NVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07137&json=true","fetch_graph":"https://pith.science/api/pith-number/GJHK6NVEFCF56UUDU6WMBR2BOS/graph.json","fetch_events":"https://pith.science/api/pith-number/GJHK6NVEFCF56UUDU6WMBR2BOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS/action/storage_attestation","attest_author":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS/action/author_attestation","sign_citation":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS/action/citation_signature","submit_replication":"https://pith.science/pith/GJHK6NVEFCF56UUDU6WMBR2BOS/action/replication_record"}},"created_at":"2026-05-17T23:53:39.799842+00:00","updated_at":"2026-05-17T23:53:39.799842+00:00"}