{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q7DKR7UDCPS7Q2JG3Y2JYHSCUO","short_pith_number":"pith:Q7DKR7UD","schema_version":"1.0","canonical_sha256":"87c6a8fe8313e5f86926de349c1e42a396cb0bf99fa7a975f873df78beded363","source":{"kind":"arxiv","id":"1811.05654","version":2},"attestation_state":"computed","paper":{"title":"Sample complexity of partition identification using multi-armed bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Sandeep Juneja, Subhashini Krishnasamy","submitted_at":"2018-11-14T05:41:08Z","abstract_excerpt":"Given a vector of probability distributions, or arms, each of which can be sampled independently, we consider the problem of identifying the partition to which this vector belongs from a finitely partitioned universe of such vector of distributions. We study this as a pure exploration problem in multi armed bandit settings and develop sample complexity bounds on the total mean number of samples required for identifying the correct partition with high probability. This framework subsumes well studied problems such as finding the best arm or the best few arms. We consider distributions belonging"},"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":"1811.05654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T05:41:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"34071f555942805743b672d4e95c2a4f6a8990a38e6abd62ba523bb9af2d1554","abstract_canon_sha256":"410db11a97b518c0b739c9a858598ecf7a335be2037360fee19253224cd7d15e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:48.008785Z","signature_b64":"xOY8stnvLvf8L1lWJ0IdrBNHn0TIhPShEYMBi6CSvr6LvaoRK6tEKpHs89MN5m1GT+OJ/68YNNBc27sA+ZRyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87c6a8fe8313e5f86926de349c1e42a396cb0bf99fa7a975f873df78beded363","last_reissued_at":"2026-05-17T23:54:48.008163Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:48.008163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample complexity of partition identification using multi-armed bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Sandeep Juneja, Subhashini Krishnasamy","submitted_at":"2018-11-14T05:41:08Z","abstract_excerpt":"Given a vector of probability distributions, or arms, each of which can be sampled independently, we consider the problem of identifying the partition to which this vector belongs from a finitely partitioned universe of such vector of distributions. We study this as a pure exploration problem in multi armed bandit settings and develop sample complexity bounds on the total mean number of samples required for identifying the correct partition with high probability. This framework subsumes well studied problems such as finding the best arm or the best few arms. We consider distributions belonging"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05654","kind":"arxiv","version":2},"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":"1811.05654","created_at":"2026-05-17T23:54:48.008265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05654v2","created_at":"2026-05-17T23:54:48.008265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05654","created_at":"2026-05-17T23:54:48.008265+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7DKR7UDCPS7","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7DKR7UDCPS7Q2JG","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7DKR7UD","created_at":"2026-05-18T12:32:46.962924+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/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO","json":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO.json","graph_json":"https://pith.science/api/pith-number/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/graph.json","events_json":"https://pith.science/api/pith-number/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/events.json","paper":"https://pith.science/paper/Q7DKR7UD"},"agent_actions":{"view_html":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO","download_json":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO.json","view_paper":"https://pith.science/paper/Q7DKR7UD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05654&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/action/storage_attestation","attest_author":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/action/author_attestation","sign_citation":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/action/citation_signature","submit_replication":"https://pith.science/pith/Q7DKR7UDCPS7Q2JG3Y2JYHSCUO/action/replication_record"}},"created_at":"2026-05-17T23:54:48.008265+00:00","updated_at":"2026-05-17T23:54:48.008265+00:00"}