{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2HJZJZ7HLZA6GTFBHE6FIMTKLC","short_pith_number":"pith:2HJZJZ7H","schema_version":"1.0","canonical_sha256":"d1d394e7e75e41e34ca1393c54326a5894dab0c73772cf8cadf546f1cbffca78","source":{"kind":"arxiv","id":"1711.07454","version":1},"attestation_state":"computed","paper":{"title":"Mixture Models, Robustness, and Sum of Squares Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jerry Li, Samuel B. Hopkins","submitted_at":"2017-11-20T18:33:23Z","abstract_excerpt":"We use the Sum of Squares method to develop new efficient algorithms for learning well-separated mixtures of Gaussians and robust mean estimation, both in high dimensions, that substantially improve upon the statistical guarantees achieved by previous efficient algorithms.\n  Firstly, we study mixtures of $k$ distributions in $d$ dimensions, where the means of every pair of distributions are separated by at least $k^{\\varepsilon}$. In the special case of spherical Gaussian mixtures, we give a $(dk)^{O(1/\\varepsilon^2)}$-time algorithm that learns the means assuming separation at least $k^{\\vare"},"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":"1711.07454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-20T18:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"09a85197ee8f48f36440a9230cbea8dd49fa6fdd9f4e70e9772b067ffab7503c","abstract_canon_sha256":"d7a3f523c72c2f714afbb609e2095a77356671c4bf972f9ca3241ada9babb452"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:10.124327Z","signature_b64":"slXbeTv66/Ym8ozTxTVS/9xCOCVXeXqF4x3bKufNev7j4ic0pq39X7y08UmIl/Bc5xnvefHTYqM2klvMpxWDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d394e7e75e41e34ca1393c54326a5894dab0c73772cf8cadf546f1cbffca78","last_reissued_at":"2026-05-18T00:30:10.123608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:10.123608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixture Models, Robustness, and Sum of Squares Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jerry Li, Samuel B. Hopkins","submitted_at":"2017-11-20T18:33:23Z","abstract_excerpt":"We use the Sum of Squares method to develop new efficient algorithms for learning well-separated mixtures of Gaussians and robust mean estimation, both in high dimensions, that substantially improve upon the statistical guarantees achieved by previous efficient algorithms.\n  Firstly, we study mixtures of $k$ distributions in $d$ dimensions, where the means of every pair of distributions are separated by at least $k^{\\varepsilon}$. In the special case of spherical Gaussian mixtures, we give a $(dk)^{O(1/\\varepsilon^2)}$-time algorithm that learns the means assuming separation at least $k^{\\vare"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07454","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":"1711.07454","created_at":"2026-05-18T00:30:10.123730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07454v1","created_at":"2026-05-18T00:30:10.123730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07454","created_at":"2026-05-18T00:30:10.123730+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HJZJZ7HLZA6","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HJZJZ7HLZA6GTFB","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HJZJZ7H","created_at":"2026-05-18T12:30:55.937587+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/2HJZJZ7HLZA6GTFBHE6FIMTKLC","json":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC.json","graph_json":"https://pith.science/api/pith-number/2HJZJZ7HLZA6GTFBHE6FIMTKLC/graph.json","events_json":"https://pith.science/api/pith-number/2HJZJZ7HLZA6GTFBHE6FIMTKLC/events.json","paper":"https://pith.science/paper/2HJZJZ7H"},"agent_actions":{"view_html":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC","download_json":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC.json","view_paper":"https://pith.science/paper/2HJZJZ7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07454&json=true","fetch_graph":"https://pith.science/api/pith-number/2HJZJZ7HLZA6GTFBHE6FIMTKLC/graph.json","fetch_events":"https://pith.science/api/pith-number/2HJZJZ7HLZA6GTFBHE6FIMTKLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC/action/storage_attestation","attest_author":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC/action/author_attestation","sign_citation":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC/action/citation_signature","submit_replication":"https://pith.science/pith/2HJZJZ7HLZA6GTFBHE6FIMTKLC/action/replication_record"}},"created_at":"2026-05-18T00:30:10.123730+00:00","updated_at":"2026-05-18T00:30:10.123730+00:00"}