{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EG6E4HFB4M4SFDUKLKWC6AL6QI","short_pith_number":"pith:EG6E4HFB","canonical_record":{"source":{"id":"1210.0864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-02T18:07:13Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"8f842a9529a611418d8846c4c5e7f5af9052166e519f16ffb4e113128d8c18c8","abstract_canon_sha256":"1e1ac7e7e2eda45a4833a8c0441f38232bbdc00dd337786cc3b23db40c9174ab"},"schema_version":"1.0"},"canonical_sha256":"21bc4e1ca1e339228e8a5aac2f017e8225adc35b7491222ebabf874fb2708a44","source":{"kind":"arxiv","id":"1210.0864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0864","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0864v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0864","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"EG6E4HFB4M4S","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EG6E4HFB4M4SFDUK","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EG6E4HFB","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EG6E4HFB4M4SFDUKLKWC6AL6QI","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-02T18:07:13Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"8f842a9529a611418d8846c4c5e7f5af9052166e519f16ffb4e113128d8c18c8","abstract_canon_sha256":"1e1ac7e7e2eda45a4833a8c0441f38232bbdc00dd337786cc3b23db40c9174ab"},"schema_version":"1.0"},"canonical_sha256":"21bc4e1ca1e339228e8a5aac2f017e8225adc35b7491222ebabf874fb2708a44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:14.070364Z","signature_b64":"pfWq63E8HorpcYx7wWLjSs4dryUSS6MycC8vuOPaRpUflkV2ZmjvXeVzp57XaNbTAAFfS5acRjGaoSmpH9yxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21bc4e1ca1e339228e8a5aac2f017e8225adc35b7491222ebabf874fb2708a44","last_reissued_at":"2026-05-18T03:44:14.069971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:14.069971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0864","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-18T03:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZ5cmgyQ7/n7yMgHNGPoQi96voWCyFUZVqBYfyqmD02onKb7hsXsm4M2IzERZCt/I825dAUgARDUWvvWuQxHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:05:06.637530Z"},"content_sha256":"f790e65f95c0ce0e5bb6fcb59485294cd738eb6ca0e7d6355fb60887d71b904d","schema_version":"1.0","event_id":"sha256:f790e65f95c0ce0e5bb6fcb59485294cd738eb6ca0e7d6355fb60887d71b904d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EG6E4HFB4M4SFDUKLKWC6AL6QI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning mixtures of structured distributions over discrete domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Rocco A. Servedio, Siu-on Chan, Xiaorui Sun","submitted_at":"2012-10-02T18:07:13Z","abstract_excerpt":"Let $\\mathfrak{C}$ be a class of probability distributions over the discrete domain $[n] = \\{1,...,n\\}.$ We show that if $\\mathfrak{C}$ satisfies a rather general condition -- essentially, that each distribution in $\\mathfrak{C}$ can be well-approximated by a variable-width histogram with few bins -- then there is a highly efficient (both in terms of running time and sample complexity) algorithm that can learn any mixture of $k$ unknown distributions from $\\mathfrak{C}.$\n  We analyze several natural types of distributions over $[n]$, including log-concave, monotone hazard rate and unimodal dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0864","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-18T03:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2fTneG+8d51WeiX0W3Ixkaq1JiocuiFO0gUDEn3660sGVu71O8XhQ0Rg7/xZ4fxQZLmfmt6N/eYcdcY6RX8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:05:06.638224Z"},"content_sha256":"80e72462e83bd9298853d6c438814b261447e47c54ba70b6bc0a4594cfbece8a","schema_version":"1.0","event_id":"sha256:80e72462e83bd9298853d6c438814b261447e47c54ba70b6bc0a4594cfbece8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/bundle.json","state_url":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/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-06-05T20:05:06Z","links":{"resolver":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI","bundle":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/bundle.json","state":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EG6E4HFB4M4SFDUKLKWC6AL6QI","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":"1e1ac7e7e2eda45a4833a8c0441f38232bbdc00dd337786cc3b23db40c9174ab","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-02T18:07:13Z","title_canon_sha256":"8f842a9529a611418d8846c4c5e7f5af9052166e519f16ffb4e113128d8c18c8"},"schema_version":"1.0","source":{"id":"1210.0864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0864","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0864v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0864","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"EG6E4HFB4M4S","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EG6E4HFB4M4SFDUK","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EG6E4HFB","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:80e72462e83bd9298853d6c438814b261447e47c54ba70b6bc0a4594cfbece8a","target":"graph","created_at":"2026-05-18T03:44:14Z","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":"Let $\\mathfrak{C}$ be a class of probability distributions over the discrete domain $[n] = \\{1,...,n\\}.$ We show that if $\\mathfrak{C}$ satisfies a rather general condition -- essentially, that each distribution in $\\mathfrak{C}$ can be well-approximated by a variable-width histogram with few bins -- then there is a highly efficient (both in terms of running time and sample complexity) algorithm that can learn any mixture of $k$ unknown distributions from $\\mathfrak{C}.$\n  We analyze several natural types of distributions over $[n]$, including log-concave, monotone hazard rate and unimodal dis","authors_text":"Ilias Diakonikolas, Rocco A. Servedio, Siu-on Chan, Xiaorui Sun","cross_cats":["cs.DS","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-02T18:07:13Z","title":"Learning mixtures of structured distributions over discrete domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0864","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:f790e65f95c0ce0e5bb6fcb59485294cd738eb6ca0e7d6355fb60887d71b904d","target":"record","created_at":"2026-05-18T03:44:14Z","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":"1e1ac7e7e2eda45a4833a8c0441f38232bbdc00dd337786cc3b23db40c9174ab","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-02T18:07:13Z","title_canon_sha256":"8f842a9529a611418d8846c4c5e7f5af9052166e519f16ffb4e113128d8c18c8"},"schema_version":"1.0","source":{"id":"1210.0864","kind":"arxiv","version":1}},"canonical_sha256":"21bc4e1ca1e339228e8a5aac2f017e8225adc35b7491222ebabf874fb2708a44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21bc4e1ca1e339228e8a5aac2f017e8225adc35b7491222ebabf874fb2708a44","first_computed_at":"2026-05-18T03:44:14.069971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:14.069971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pfWq63E8HorpcYx7wWLjSs4dryUSS6MycC8vuOPaRpUflkV2ZmjvXeVzp57XaNbTAAFfS5acRjGaoSmpH9yxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:14.070364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f790e65f95c0ce0e5bb6fcb59485294cd738eb6ca0e7d6355fb60887d71b904d","sha256:80e72462e83bd9298853d6c438814b261447e47c54ba70b6bc0a4594cfbece8a"],"state_sha256":"e0b5b63e13fdeddca24b6097f1d2f057a322bdb9603682784f689157013ec072"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2lqzRfo1EVh5sfoRFfDkEdOF3tY7Y6M3patrsqIa/r+yNCFBHY62a2NQ3l0XMiBUbEHZOx0pKPjPqheB5GKAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:05:06.642663Z","bundle_sha256":"4569e82dfa7ab2aa9af28f2046ba7dda11d3f7d4e823b9a754ed08f71da6d33e"}}