{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KVS3MURXTYFFSZGYIP44HLJ4TF","short_pith_number":"pith:KVS3MURX","schema_version":"1.0","canonical_sha256":"5565b652379e0a5964d843f9c3ad3c99470e724bf04380bef5d9bcf382f042e1","source":{"kind":"arxiv","id":"1609.02606","version":2},"attestation_state":"computed","paper":{"title":"On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Mohammad Noshad, Shahin Shahrampour, Vahid Tarokh","submitted_at":"2016-09-08T21:46:37Z","abstract_excerpt":"We consider the best-arm identification problem in multi-armed bandits, which focuses purely on exploration. A player is given a fixed budget to explore a finite set of arms, and the rewards of each arm are drawn independently from a fixed, unknown distribution. The player aims to identify the arm with the largest expected reward. We propose a general framework to unify sequential elimination algorithms, where the arms are dismissed iteratively until a unique arm is left. Our analysis reveals a novel performance measure expressed in terms of the sampling mechanism and number of eliminated arms"},"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":"1609.02606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-08T21:46:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"17d46ef90ee8e5fa6d9793f26da83055f8fe1231781eb8c06f0611bfd7a70314","abstract_canon_sha256":"3d01a6c843765585aadccad53b8f7170801736e319cba0fcd713714b0909fdaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:02.178699Z","signature_b64":"L5FnkryLEdBZhipdXbx/ORt0+WmbUrNYr4R3Du2T7bQPnz3DhradUXEV34qbmRPeQA8Y5RY2ZLhox03FPH7DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5565b652379e0a5964d843f9c3ad3c99470e724bf04380bef5d9bcf382f042e1","last_reissued_at":"2026-05-18T00:39:02.177935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:02.177935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Mohammad Noshad, Shahin Shahrampour, Vahid Tarokh","submitted_at":"2016-09-08T21:46:37Z","abstract_excerpt":"We consider the best-arm identification problem in multi-armed bandits, which focuses purely on exploration. A player is given a fixed budget to explore a finite set of arms, and the rewards of each arm are drawn independently from a fixed, unknown distribution. The player aims to identify the arm with the largest expected reward. We propose a general framework to unify sequential elimination algorithms, where the arms are dismissed iteratively until a unique arm is left. Our analysis reveals a novel performance measure expressed in terms of the sampling mechanism and number of eliminated arms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02606","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":"1609.02606","created_at":"2026-05-18T00:39:02.178060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02606v2","created_at":"2026-05-18T00:39:02.178060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02606","created_at":"2026-05-18T00:39:02.178060+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVS3MURXTYFF","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVS3MURXTYFFSZGY","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVS3MURX","created_at":"2026-05-18T12:30:29.479603+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/KVS3MURXTYFFSZGYIP44HLJ4TF","json":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF.json","graph_json":"https://pith.science/api/pith-number/KVS3MURXTYFFSZGYIP44HLJ4TF/graph.json","events_json":"https://pith.science/api/pith-number/KVS3MURXTYFFSZGYIP44HLJ4TF/events.json","paper":"https://pith.science/paper/KVS3MURX"},"agent_actions":{"view_html":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF","download_json":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF.json","view_paper":"https://pith.science/paper/KVS3MURX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02606&json=true","fetch_graph":"https://pith.science/api/pith-number/KVS3MURXTYFFSZGYIP44HLJ4TF/graph.json","fetch_events":"https://pith.science/api/pith-number/KVS3MURXTYFFSZGYIP44HLJ4TF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/action/storage_attestation","attest_author":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/action/author_attestation","sign_citation":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/action/citation_signature","submit_replication":"https://pith.science/pith/KVS3MURXTYFFSZGYIP44HLJ4TF/action/replication_record"}},"created_at":"2026-05-18T00:39:02.178060+00:00","updated_at":"2026-05-18T00:39:02.178060+00:00"}