{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ORIQRLAXS6NSOTS5KBEJVXFE3Q","short_pith_number":"pith:ORIQRLAX","schema_version":"1.0","canonical_sha256":"745108ac17979b274e5d50489adca4dc2d061a4bb5a7c9da942b48d920fa0d67","source":{"kind":"arxiv","id":"2504.15251","version":1},"attestation_state":"computed","paper":{"title":"On Learning Parallel Pancakes with Mostly Uniform Weights","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, Jasper C.H. Lee, Sushrut Karmalkar, Thanasis Pittas","submitted_at":"2025-04-21T17:31:55Z","abstract_excerpt":"We study the complexity of learning $k$-mixtures of Gaussians ($k$-GMMs) on $\\mathbb{R}^d$. This task is known to have complexity $d^{\\Omega(k)}$ in full generality. To circumvent this exponential lower bound on the number of components, research has focused on learning families of GMMs satisfying additional structural properties. A natural assumption posits that the component weights are not exponentially small and that the components have the same unknown covariance. Recent work gave a $d^{O(\\log(1/w_{\\min}))}$-time algorithm for this class of GMMs, where $w_{\\min}$ is the minimum weight. Ou"},"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":"2504.15251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T17:31:55Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"0fc131fdab6ee4cdbefc1c649cc3424a3f8fdb90dd3c0aa37e1c19f2bfecf8d6","abstract_canon_sha256":"247bd898c1a73db1659b4b76c7b157ca9fa124ac90bdd856376f1789e35a7d63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:58.800461Z","signature_b64":"hgQtvp87Na0YNsvWsfmnQ+5d8oHqmTbIIrBs0pHPq+x3cshEQNams1EukZngJqIiASaopcSXEfn7HXOLM0wdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"745108ac17979b274e5d50489adca4dc2d061a4bb5a7c9da942b48d920fa0d67","last_reissued_at":"2026-07-05T10:51:58.799976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:58.799976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Learning Parallel Pancakes with Mostly Uniform Weights","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, Jasper C.H. Lee, Sushrut Karmalkar, Thanasis Pittas","submitted_at":"2025-04-21T17:31:55Z","abstract_excerpt":"We study the complexity of learning $k$-mixtures of Gaussians ($k$-GMMs) on $\\mathbb{R}^d$. This task is known to have complexity $d^{\\Omega(k)}$ in full generality. To circumvent this exponential lower bound on the number of components, research has focused on learning families of GMMs satisfying additional structural properties. A natural assumption posits that the component weights are not exponentially small and that the components have the same unknown covariance. Recent work gave a $d^{O(\\log(1/w_{\\min}))}$-time algorithm for this class of GMMs, where $w_{\\min}$ is the minimum weight. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15251","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/2504.15251/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":"2504.15251","created_at":"2026-07-05T10:51:58.800031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15251v1","created_at":"2026-07-05T10:51:58.800031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15251","created_at":"2026-07-05T10:51:58.800031+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORIQRLAXS6NS","created_at":"2026-07-05T10:51:58.800031+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORIQRLAXS6NSOTS5","created_at":"2026-07-05T10:51:58.800031+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORIQRLAX","created_at":"2026-07-05T10:51:58.800031+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/ORIQRLAXS6NSOTS5KBEJVXFE3Q","json":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q.json","graph_json":"https://pith.science/api/pith-number/ORIQRLAXS6NSOTS5KBEJVXFE3Q/graph.json","events_json":"https://pith.science/api/pith-number/ORIQRLAXS6NSOTS5KBEJVXFE3Q/events.json","paper":"https://pith.science/paper/ORIQRLAX"},"agent_actions":{"view_html":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q","download_json":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q.json","view_paper":"https://pith.science/paper/ORIQRLAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15251&json=true","fetch_graph":"https://pith.science/api/pith-number/ORIQRLAXS6NSOTS5KBEJVXFE3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ORIQRLAXS6NSOTS5KBEJVXFE3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q/action/storage_attestation","attest_author":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q/action/author_attestation","sign_citation":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q/action/citation_signature","submit_replication":"https://pith.science/pith/ORIQRLAXS6NSOTS5KBEJVXFE3Q/action/replication_record"}},"created_at":"2026-07-05T10:51:58.800031+00:00","updated_at":"2026-07-05T10:51:58.800031+00:00"}