{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KSVQALG2ZFFAQTSTRMIP6DWYVQ","short_pith_number":"pith:KSVQALG2","schema_version":"1.0","canonical_sha256":"54ab002cdac94a084e538b10ff0ed8ac12eb1e348c5c2b01f0ed29f3e1afc226","source":{"kind":"arxiv","id":"1907.03190","version":1},"attestation_state":"computed","paper":{"title":"Testing Mixtures of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld","submitted_at":"2019-07-06T21:24:54Z","abstract_excerpt":"There has been significant study on the sample complexity of testing properties of distributions over large domains. For many properties, it is known that the sample complexity can be substantially smaller than the domain size. For example, over a domain of size $n$, distinguishing the uniform distribution from distributions that are far from uniform in $\\ell_1$-distance uses only $O(\\sqrt{n})$ samples.\n  However, the picture is very different in the presence of arbitrary noise, even when the amount of noise is quite small. In this case, one must distinguish if samples are coming from a distri"},"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":"1907.03190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-06T21:24:54Z","cross_cats_sorted":["cs.DS","stat.ML","stat.TH"],"title_canon_sha256":"0f8e782becd1c4e8d8f1b1e34edab13d2013daa6cb21aa7a144a680cc5338f13","abstract_canon_sha256":"9500b1a333c6a883c9062883d2b72497bcd1ab51dd6c40ffb58eb73470c20eec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.665954Z","signature_b64":"HDJrJmt/k57xnwn4aiuzTEXGFI1+HPlwaOXthN5adjhIFi1wbCEhbqgaq8WHQY+L/yXt+abpKSIz1sqcqMmZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ab002cdac94a084e538b10ff0ed8ac12eb1e348c5c2b01f0ed29f3e1afc226","last_reissued_at":"2026-05-17T23:41:18.665238Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.665238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Mixtures of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld","submitted_at":"2019-07-06T21:24:54Z","abstract_excerpt":"There has been significant study on the sample complexity of testing properties of distributions over large domains. For many properties, it is known that the sample complexity can be substantially smaller than the domain size. For example, over a domain of size $n$, distinguishing the uniform distribution from distributions that are far from uniform in $\\ell_1$-distance uses only $O(\\sqrt{n})$ samples.\n  However, the picture is very different in the presence of arbitrary noise, even when the amount of noise is quite small. In this case, one must distinguish if samples are coming from a distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03190","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":"1907.03190","created_at":"2026-05-17T23:41:18.665371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03190v1","created_at":"2026-05-17T23:41:18.665371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03190","created_at":"2026-05-17T23:41:18.665371+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSVQALG2ZFFA","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSVQALG2ZFFAQTST","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSVQALG2","created_at":"2026-05-18T12:33:21.387695+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/KSVQALG2ZFFAQTSTRMIP6DWYVQ","json":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ.json","graph_json":"https://pith.science/api/pith-number/KSVQALG2ZFFAQTSTRMIP6DWYVQ/graph.json","events_json":"https://pith.science/api/pith-number/KSVQALG2ZFFAQTSTRMIP6DWYVQ/events.json","paper":"https://pith.science/paper/KSVQALG2"},"agent_actions":{"view_html":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ","download_json":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ.json","view_paper":"https://pith.science/paper/KSVQALG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03190&json=true","fetch_graph":"https://pith.science/api/pith-number/KSVQALG2ZFFAQTSTRMIP6DWYVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KSVQALG2ZFFAQTSTRMIP6DWYVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ/action/storage_attestation","attest_author":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ/action/author_attestation","sign_citation":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ/action/citation_signature","submit_replication":"https://pith.science/pith/KSVQALG2ZFFAQTSTRMIP6DWYVQ/action/replication_record"}},"created_at":"2026-05-17T23:41:18.665371+00:00","updated_at":"2026-05-17T23:41:18.665371+00:00"}