{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BD7UYABZ4OYPIYM2TLUDCIZ7IB","short_pith_number":"pith:BD7UYABZ","schema_version":"1.0","canonical_sha256":"08ff4c0039e3b0f4619a9ae831233f40753bdb40cc994716f20ce10a1af97618","source":{"kind":"arxiv","id":"2306.13057","version":1},"attestation_state":"computed","paper":{"title":"SQ Lower Bounds for Learning Bounded Covariance GMMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Nikos Zarifis, Thanasis Pittas","submitted_at":"2023-06-22T17:23:36Z","abstract_excerpt":"We study the complexity of learning mixtures of separated Gaussians with common unknown bounded covariance matrix. Specifically, we focus on learning Gaussian mixture models (GMMs) on $\\mathbb{R}^d$ of the form $P= \\sum_{i=1}^k w_i \\mathcal{N}(\\boldsymbol \\mu_i,\\mathbf \\Sigma_i)$, where $\\mathbf \\Sigma_i = \\mathbf \\Sigma \\preceq \\mathbf I$ and $\\min_{i \\neq j} \\| \\boldsymbol \\mu_i - \\boldsymbol \\mu_j\\|_2 \\geq k^\\epsilon$ for some $\\epsilon>0$. Known learning algorithms for this family of GMMs have complexity $(dk)^{O(1/\\epsilon)}$. In this work, we prove that any Statistical Query (SQ) algorit"},"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":"2306.13057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-22T17:23:36Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ffa10b1d1d4d3203c616704519dfda43c16332e36dc156574a7f1e2c4fb1eac5","abstract_canon_sha256":"9a8d83bd9ed27fb51e8bada84bfea1737508d5710b5dbd7be0feeb43975eef2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:51.686840Z","signature_b64":"4M+Il/EoZNi5o7RY+0wkmWOCd67KVwfe0IBIopBTHBwgQCauYdq/VwfAakQ+8cCwkkqg5o0gtDJO5PSa5XnHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08ff4c0039e3b0f4619a9ae831233f40753bdb40cc994716f20ce10a1af97618","last_reissued_at":"2026-07-05T06:23:51.686404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:51.686404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SQ Lower Bounds for Learning Bounded Covariance GMMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Nikos Zarifis, Thanasis Pittas","submitted_at":"2023-06-22T17:23:36Z","abstract_excerpt":"We study the complexity of learning mixtures of separated Gaussians with common unknown bounded covariance matrix. Specifically, we focus on learning Gaussian mixture models (GMMs) on $\\mathbb{R}^d$ of the form $P= \\sum_{i=1}^k w_i \\mathcal{N}(\\boldsymbol \\mu_i,\\mathbf \\Sigma_i)$, where $\\mathbf \\Sigma_i = \\mathbf \\Sigma \\preceq \\mathbf I$ and $\\min_{i \\neq j} \\| \\boldsymbol \\mu_i - \\boldsymbol \\mu_j\\|_2 \\geq k^\\epsilon$ for some $\\epsilon>0$. Known learning algorithms for this family of GMMs have complexity $(dk)^{O(1/\\epsilon)}$. In this work, we prove that any Statistical Query (SQ) algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13057","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/2306.13057/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":"2306.13057","created_at":"2026-07-05T06:23:51.686468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.13057v1","created_at":"2026-07-05T06:23:51.686468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13057","created_at":"2026-07-05T06:23:51.686468+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD7UYABZ4OYP","created_at":"2026-07-05T06:23:51.686468+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD7UYABZ4OYPIYM2","created_at":"2026-07-05T06:23:51.686468+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD7UYABZ","created_at":"2026-07-05T06:23:51.686468+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/BD7UYABZ4OYPIYM2TLUDCIZ7IB","json":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB.json","graph_json":"https://pith.science/api/pith-number/BD7UYABZ4OYPIYM2TLUDCIZ7IB/graph.json","events_json":"https://pith.science/api/pith-number/BD7UYABZ4OYPIYM2TLUDCIZ7IB/events.json","paper":"https://pith.science/paper/BD7UYABZ"},"agent_actions":{"view_html":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB","download_json":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB.json","view_paper":"https://pith.science/paper/BD7UYABZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.13057&json=true","fetch_graph":"https://pith.science/api/pith-number/BD7UYABZ4OYPIYM2TLUDCIZ7IB/graph.json","fetch_events":"https://pith.science/api/pith-number/BD7UYABZ4OYPIYM2TLUDCIZ7IB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB/action/storage_attestation","attest_author":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB/action/author_attestation","sign_citation":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB/action/citation_signature","submit_replication":"https://pith.science/pith/BD7UYABZ4OYPIYM2TLUDCIZ7IB/action/replication_record"}},"created_at":"2026-07-05T06:23:51.686468+00:00","updated_at":"2026-07-05T06:23:51.686468+00:00"}