{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EG6E4HFB4M4SFDUKLKWC6AL6QI","short_pith_number":"pith:EG6E4HFB","schema_version":"1.0","canonical_sha256":"21bc4e1ca1e339228e8a5aac2f017e8225adc35b7491222ebabf874fb2708a44","source":{"kind":"arxiv","id":"1210.0864","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.0864","created_at":"2026-05-18T03:44:14.070030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0864v1","created_at":"2026-05-18T03:44:14.070030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0864","created_at":"2026-05-18T03:44:14.070030+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG6E4HFB4M4S","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG6E4HFB4M4SFDUK","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG6E4HFB","created_at":"2026-05-18T12:27:04.183437+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/EG6E4HFB4M4SFDUKLKWC6AL6QI","json":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI.json","graph_json":"https://pith.science/api/pith-number/EG6E4HFB4M4SFDUKLKWC6AL6QI/graph.json","events_json":"https://pith.science/api/pith-number/EG6E4HFB4M4SFDUKLKWC6AL6QI/events.json","paper":"https://pith.science/paper/EG6E4HFB"},"agent_actions":{"view_html":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI","download_json":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI.json","view_paper":"https://pith.science/paper/EG6E4HFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0864&json=true","fetch_graph":"https://pith.science/api/pith-number/EG6E4HFB4M4SFDUKLKWC6AL6QI/graph.json","fetch_events":"https://pith.science/api/pith-number/EG6E4HFB4M4SFDUKLKWC6AL6QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/action/storage_attestation","attest_author":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/action/author_attestation","sign_citation":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/action/citation_signature","submit_replication":"https://pith.science/pith/EG6E4HFB4M4SFDUKLKWC6AL6QI/action/replication_record"}},"created_at":"2026-05-18T03:44:14.070030+00:00","updated_at":"2026-05-18T03:44:14.070030+00:00"}