{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HMIZLUK6LRMWD5HZZWLPYBJCGV","short_pith_number":"pith:HMIZLUK6","schema_version":"1.0","canonical_sha256":"3b1195d15e5c5961f4f9cd96fc05223557538097530b627ef6ec34babe87607b","source":{"kind":"arxiv","id":"2203.15150","version":3},"attestation_state":"computed","paper":{"title":"Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Bryon Aragam, Wai Ming Tai","submitted_at":"2022-03-28T23:53:48Z","abstract_excerpt":"We study the problem of learning nonparametric distributions in a finite mixture, and establish tight bounds on the sample complexity for learning the component distributions in such models. Namely, we are given i.i.d. samples from a pdf $f$ where $$ f=w_1f_1+w_2f_2, \\quad w_1+w_2=1, \\quad w_1,w_2>0 $$ and we are interested in learning each component $f_i$. Without any assumptions on $f_i$, this problem is ill-posed. In order to identify the components $f_i$, we assume that each $f_i$ can be written as a convolution of a Gaussian and a compactly supported density $\\nu_i$ with $\\text{supp}(\\nu_"},"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":"2203.15150","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-28T23:53:48Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"0e0b514f15e43dd5736d06f6e37e499b088ae80731b6408f246a13235cf537b4","abstract_canon_sha256":"13c5ac805d6eb61cbe70009fc00cba7c254fcbbf851abdbb9a466c1712016ce4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:39.291284Z","signature_b64":"0j7YKvnNDawx2CN1Sxx7oKJCKYJbzzAxBvHyxRFyrx11C39TndlgjrVcf2Xo4anJH7oDBmqingE6QnyzkHZ+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b1195d15e5c5961f4f9cd96fc05223557538097530b627ef6ec34babe87607b","last_reissued_at":"2026-07-05T06:27:39.290718Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:39.290718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Bryon Aragam, Wai Ming Tai","submitted_at":"2022-03-28T23:53:48Z","abstract_excerpt":"We study the problem of learning nonparametric distributions in a finite mixture, and establish tight bounds on the sample complexity for learning the component distributions in such models. Namely, we are given i.i.d. samples from a pdf $f$ where $$ f=w_1f_1+w_2f_2, \\quad w_1+w_2=1, \\quad w_1,w_2>0 $$ and we are interested in learning each component $f_i$. Without any assumptions on $f_i$, this problem is ill-posed. In order to identify the components $f_i$, we assume that each $f_i$ can be written as a convolution of a Gaussian and a compactly supported density $\\nu_i$ with $\\text{supp}(\\nu_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15150","kind":"arxiv","version":3},"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/2203.15150/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":"2203.15150","created_at":"2026-07-05T06:27:39.290772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.15150v3","created_at":"2026-07-05T06:27:39.290772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15150","created_at":"2026-07-05T06:27:39.290772+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMIZLUK6LRMW","created_at":"2026-07-05T06:27:39.290772+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMIZLUK6LRMWD5HZ","created_at":"2026-07-05T06:27:39.290772+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMIZLUK6","created_at":"2026-07-05T06:27:39.290772+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21396","citing_title":"PMODE: Theoretically Grounded and Modular Mixture Modeling","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV","json":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV.json","graph_json":"https://pith.science/api/pith-number/HMIZLUK6LRMWD5HZZWLPYBJCGV/graph.json","events_json":"https://pith.science/api/pith-number/HMIZLUK6LRMWD5HZZWLPYBJCGV/events.json","paper":"https://pith.science/paper/HMIZLUK6"},"agent_actions":{"view_html":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV","download_json":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV.json","view_paper":"https://pith.science/paper/HMIZLUK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.15150&json=true","fetch_graph":"https://pith.science/api/pith-number/HMIZLUK6LRMWD5HZZWLPYBJCGV/graph.json","fetch_events":"https://pith.science/api/pith-number/HMIZLUK6LRMWD5HZZWLPYBJCGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV/action/storage_attestation","attest_author":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV/action/author_attestation","sign_citation":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV/action/citation_signature","submit_replication":"https://pith.science/pith/HMIZLUK6LRMWD5HZZWLPYBJCGV/action/replication_record"}},"created_at":"2026-07-05T06:27:39.290772+00:00","updated_at":"2026-07-05T06:27:39.290772+00:00"}