{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7CFTWKSQYKPZS2CQOVJ4HNQCAN","short_pith_number":"pith:7CFTWKSQ","schema_version":"1.0","canonical_sha256":"f88b3b2a50c29f9968507553c3b602037362c423670446ef44cc36f9150e0920","source":{"kind":"arxiv","id":"2210.02415","version":2},"attestation_state":"computed","paper":{"title":"A Fourier Approach to Mixture Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankit Singh Rawat, Avinava Dubey, Guru Guruganesh, Manzil Zaheer, Mingda Qiao","submitted_at":"2022-10-05T17:35:46Z","abstract_excerpt":"We revisit the problem of learning mixtures of spherical Gaussians. Given samples from mixture $\\frac{1}{k}\\sum_{j=1}^{k}\\mathcal{N}(\\mu_j, I_d)$, the goal is to estimate the means $\\mu_1, \\mu_2, \\ldots, \\mu_k \\in \\mathbb{R}^d$ up to a small error. The hardness of this learning problem can be measured by the separation $\\Delta$ defined as the minimum distance between all pairs of means. Regev and Vijayaraghavan (2017) showed that with $\\Delta = \\Omega(\\sqrt{\\log k})$ separation, the means can be learned using $\\mathrm{poly}(k, d)$ samples, whereas super-polynomially many samples are required i"},"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":"2210.02415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-05T17:35:46Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"633bbe6ebf8d21d74ad0bf80ba4c428cfa24b47ed5668f66be406e571386f962","abstract_canon_sha256":"6d4a58ce277e9d9dca699b48733990079c65b1c62b88e44fd02c111706993d50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:52.815945Z","signature_b64":"eFwJaJHxy/1JWatVy1p30nyZ2DMprT+Khu0+0YZVKL10S3rkS1t0+EihI76ieIFZ5xaEn55Nt9R+PtAu4w3MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f88b3b2a50c29f9968507553c3b602037362c423670446ef44cc36f9150e0920","last_reissued_at":"2026-07-05T05:03:52.815510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:52.815510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fourier Approach to Mixture Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankit Singh Rawat, Avinava Dubey, Guru Guruganesh, Manzil Zaheer, Mingda Qiao","submitted_at":"2022-10-05T17:35:46Z","abstract_excerpt":"We revisit the problem of learning mixtures of spherical Gaussians. Given samples from mixture $\\frac{1}{k}\\sum_{j=1}^{k}\\mathcal{N}(\\mu_j, I_d)$, the goal is to estimate the means $\\mu_1, \\mu_2, \\ldots, \\mu_k \\in \\mathbb{R}^d$ up to a small error. The hardness of this learning problem can be measured by the separation $\\Delta$ defined as the minimum distance between all pairs of means. Regev and Vijayaraghavan (2017) showed that with $\\Delta = \\Omega(\\sqrt{\\log k})$ separation, the means can be learned using $\\mathrm{poly}(k, d)$ samples, whereas super-polynomially many samples are required i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02415","kind":"arxiv","version":2},"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/2210.02415/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":"2210.02415","created_at":"2026-07-05T05:03:52.815564+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.02415v2","created_at":"2026-07-05T05:03:52.815564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02415","created_at":"2026-07-05T05:03:52.815564+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CFTWKSQYKPZ","created_at":"2026-07-05T05:03:52.815564+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CFTWKSQYKPZS2CQ","created_at":"2026-07-05T05:03:52.815564+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CFTWKSQ","created_at":"2026-07-05T05:03:52.815564+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/7CFTWKSQYKPZS2CQOVJ4HNQCAN","json":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN.json","graph_json":"https://pith.science/api/pith-number/7CFTWKSQYKPZS2CQOVJ4HNQCAN/graph.json","events_json":"https://pith.science/api/pith-number/7CFTWKSQYKPZS2CQOVJ4HNQCAN/events.json","paper":"https://pith.science/paper/7CFTWKSQ"},"agent_actions":{"view_html":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN","download_json":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN.json","view_paper":"https://pith.science/paper/7CFTWKSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.02415&json=true","fetch_graph":"https://pith.science/api/pith-number/7CFTWKSQYKPZS2CQOVJ4HNQCAN/graph.json","fetch_events":"https://pith.science/api/pith-number/7CFTWKSQYKPZS2CQOVJ4HNQCAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN/action/storage_attestation","attest_author":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN/action/author_attestation","sign_citation":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN/action/citation_signature","submit_replication":"https://pith.science/pith/7CFTWKSQYKPZS2CQOVJ4HNQCAN/action/replication_record"}},"created_at":"2026-07-05T05:03:52.815564+00:00","updated_at":"2026-07-05T05:03:52.815564+00:00"}