{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ELPXTPGM4SXISTN6JVTHLE3UWX","short_pith_number":"pith:ELPXTPGM","canonical_record":{"source":{"id":"1506.01367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-03T19:55:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"eddcecc4ff2768bf53cee19b2f973fc4fd81c2d320c1ca34b12d31c3c51351e2","abstract_canon_sha256":"5e8c49be9a5851b4431abb4bccaf25e9ac657e107e2e84c48b411aa53f2c02aa"},"schema_version":"1.0"},"canonical_sha256":"22df79bccce4ae894dbe4d66759374b5ffc9fb46264dbc4303ba870b295f2a88","source":{"kind":"arxiv","id":"1506.01367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01367","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01367v1","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01367","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"ELPXTPGM4SXI","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ELPXTPGM4SXISTN6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ELPXTPGM","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ELPXTPGM4SXISTN6JVTHLE3UWX","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-03T19:55:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"eddcecc4ff2768bf53cee19b2f973fc4fd81c2d320c1ca34b12d31c3c51351e2","abstract_canon_sha256":"5e8c49be9a5851b4431abb4bccaf25e9ac657e107e2e84c48b411aa53f2c02aa"},"schema_version":"1.0"},"canonical_sha256":"22df79bccce4ae894dbe4d66759374b5ffc9fb46264dbc4303ba870b295f2a88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:24.487859Z","signature_b64":"oJaLsvf8Ln3oZnkKejRglIVt5jU3Br0Q+ybUSnTDv3DFlekQ0lSzq2ZiyHRJYYgB9VMTU+SJlJvjbnYSZ2BlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22df79bccce4ae894dbe4d66759374b5ffc9fb46264dbc4303ba870b295f2a88","last_reissued_at":"2026-05-18T01:58:24.487428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:24.487428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01367","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UsK/r7kafqIl/QdWshCLHn5WBHmFZ8HgnsxF7hzJdw/y937KcnvRCZYeEomTCp9cJTpbtB7V1W95PULTWP7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:20:35.281209Z"},"content_sha256":"d22d861bd0fec0850745acd9f375e31aa1739b7d02df5f351ea4493d9c7c8e18","schema_version":"1.0","event_id":"sha256:d22d861bd0fec0850745acd9f375e31aa1739b7d02df5f351ea4493d9c7c8e18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ELPXTPGM4SXISTN6JVTHLE3UWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Jerry Li, Ludwig Schmidt","submitted_at":"2015-06-03T19:55:10Z","abstract_excerpt":"Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics. One notion of learning a GMM is proper learning: here, the goal is to find a mixture of $k$ Gaussians $\\mathcal{M}$ that is close to the density $f$ of the unknown distribution from which we draw samples. The distance between $\\mathcal{M}$ and $f$ is typically measured in the total variation or $L_1$-norm.\n  We give an algorithm for learning a mixture of $k$ univariate Gaussians that is nearly optimal for any fixed $k$. The sample complexity of our algorithm is $\\tilde{O}(\\fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01367","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgRuMTRU8TE7URheVTgkijCLDRMubplz2MMBLZfPzC3lU2yjxDY5eHfNFVepiaB7RJB8tzSVj39SSH6SmD6gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:20:35.281937Z"},"content_sha256":"b48eb8d5b7a22cada7c2b721ebacc50f55a7aa2a9c2df2967b00457b1b431e5c","schema_version":"1.0","event_id":"sha256:b48eb8d5b7a22cada7c2b721ebacc50f55a7aa2a9c2df2967b00457b1b431e5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/bundle.json","state_url":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T08:20:35Z","links":{"resolver":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX","bundle":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/bundle.json","state":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ELPXTPGM4SXISTN6JVTHLE3UWX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5e8c49be9a5851b4431abb4bccaf25e9ac657e107e2e84c48b411aa53f2c02aa","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-03T19:55:10Z","title_canon_sha256":"eddcecc4ff2768bf53cee19b2f973fc4fd81c2d320c1ca34b12d31c3c51351e2"},"schema_version":"1.0","source":{"id":"1506.01367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01367","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01367v1","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01367","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"ELPXTPGM4SXI","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ELPXTPGM4SXISTN6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ELPXTPGM","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:b48eb8d5b7a22cada7c2b721ebacc50f55a7aa2a9c2df2967b00457b1b431e5c","target":"graph","created_at":"2026-05-18T01:58:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics. One notion of learning a GMM is proper learning: here, the goal is to find a mixture of $k$ Gaussians $\\mathcal{M}$ that is close to the density $f$ of the unknown distribution from which we draw samples. The distance between $\\mathcal{M}$ and $f$ is typically measured in the total variation or $L_1$-norm.\n  We give an algorithm for learning a mixture of $k$ univariate Gaussians that is nearly optimal for any fixed $k$. The sample complexity of our algorithm is $\\tilde{O}(\\fra","authors_text":"Jerry Li, Ludwig Schmidt","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-03T19:55:10Z","title":"A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01367","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d22d861bd0fec0850745acd9f375e31aa1739b7d02df5f351ea4493d9c7c8e18","target":"record","created_at":"2026-05-18T01:58:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5e8c49be9a5851b4431abb4bccaf25e9ac657e107e2e84c48b411aa53f2c02aa","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-03T19:55:10Z","title_canon_sha256":"eddcecc4ff2768bf53cee19b2f973fc4fd81c2d320c1ca34b12d31c3c51351e2"},"schema_version":"1.0","source":{"id":"1506.01367","kind":"arxiv","version":1}},"canonical_sha256":"22df79bccce4ae894dbe4d66759374b5ffc9fb46264dbc4303ba870b295f2a88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22df79bccce4ae894dbe4d66759374b5ffc9fb46264dbc4303ba870b295f2a88","first_computed_at":"2026-05-18T01:58:24.487428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:24.487428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oJaLsvf8Ln3oZnkKejRglIVt5jU3Br0Q+ybUSnTDv3DFlekQ0lSzq2ZiyHRJYYgB9VMTU+SJlJvjbnYSZ2BlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:24.487859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d22d861bd0fec0850745acd9f375e31aa1739b7d02df5f351ea4493d9c7c8e18","sha256:b48eb8d5b7a22cada7c2b721ebacc50f55a7aa2a9c2df2967b00457b1b431e5c"],"state_sha256":"da2c17ffab6e66773c516d45653328965c9fec859f93f45abace355364759438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYQobu4TjK3pSlEUl7MonLEiDz9jxHawIC+GAd2bedPlhW5e4IwcImhOWSzCvrWVGGfJTq9L2ZV42INPjpgiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:20:35.285385Z","bundle_sha256":"0c2c882b787e86cd30c4881454750b9616f09b1ddc33169cc787541d96ebbb59"}}