{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L7COWRJY4TVTZMYBN2NCASNEV7","short_pith_number":"pith:L7COWRJY","schema_version":"1.0","canonical_sha256":"5fc4eb4538e4eb3cb3016e9a2049a4afc0da1857922d0341b0efcf902e3054a7","source":{"kind":"arxiv","id":"1801.04593","version":1},"attestation_state":"computed","paper":{"title":"On Identifying a Massive Number of Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","submitted_at":"2018-01-14T18:18:04Z","abstract_excerpt":"Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of observed sequences, are let to grow with the observation blocklength $n$. Asymptotically matching upper and lower bounds on the probability of error are derived."},"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":"1801.04593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-14T18:18:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca38cfd8876402d5eb68f511a9649f5e551817486d7484cd71ee6de99ef44a54","abstract_canon_sha256":"dc12e9786ca344aef13e4abcb7db5f1d8a288b31e1da20e297f1ed85d2231d79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:24.736388Z","signature_b64":"RZA1KAtwnWIzWZTomViqk7lnzNVFTdC/xGjsoKDDmJzJFeShuxTCzgKrZJxrdvtoVz56diELJV8OIv3Qx54zAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc4eb4538e4eb3cb3016e9a2049a4afc0da1857922d0341b0efcf902e3054a7","last_reissued_at":"2026-05-18T00:03:24.735819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:24.735819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Identifying a Massive Number of Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","submitted_at":"2018-01-14T18:18:04Z","abstract_excerpt":"Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of observed sequences, are let to grow with the observation blocklength $n$. Asymptotically matching upper and lower bounds on the probability of error are derived."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04593","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":"1801.04593","created_at":"2026-05-18T00:03:24.735913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04593v1","created_at":"2026-05-18T00:03:24.735913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04593","created_at":"2026-05-18T00:03:24.735913+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7COWRJY4TVT","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7COWRJY4TVTZMYB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7COWRJY","created_at":"2026-05-18T12:32:33.847187+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/L7COWRJY4TVTZMYBN2NCASNEV7","json":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7.json","graph_json":"https://pith.science/api/pith-number/L7COWRJY4TVTZMYBN2NCASNEV7/graph.json","events_json":"https://pith.science/api/pith-number/L7COWRJY4TVTZMYBN2NCASNEV7/events.json","paper":"https://pith.science/paper/L7COWRJY"},"agent_actions":{"view_html":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7","download_json":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7.json","view_paper":"https://pith.science/paper/L7COWRJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04593&json=true","fetch_graph":"https://pith.science/api/pith-number/L7COWRJY4TVTZMYBN2NCASNEV7/graph.json","fetch_events":"https://pith.science/api/pith-number/L7COWRJY4TVTZMYBN2NCASNEV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7/action/storage_attestation","attest_author":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7/action/author_attestation","sign_citation":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7/action/citation_signature","submit_replication":"https://pith.science/pith/L7COWRJY4TVTZMYBN2NCASNEV7/action/replication_record"}},"created_at":"2026-05-18T00:03:24.735913+00:00","updated_at":"2026-05-18T00:03:24.735913+00:00"}