{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I2LQ5G3G22J76P75W3ATSQBWM2","short_pith_number":"pith:I2LQ5G3G","schema_version":"1.0","canonical_sha256":"46970e9b66d693ff3ffdb6c139403666bbb279e309d2c1c6c6ffbe357a067a0b","source":{"kind":"arxiv","id":"1707.02649","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear Sequential Accepts and Rejects for Identification of Top Arms in Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Shahin Shahrampour, Vahid Tarokh","submitted_at":"2017-07-09T22:32:09Z","abstract_excerpt":"We address the M-best-arm identification problem in multi-armed bandits. A player has a limited budget to explore K arms (M<K), and once pulled, each arm yields a reward drawn (independently) from a fixed, unknown distribution. The goal is to find the top M arms in the sense of expected reward. We develop an algorithm which proceeds in rounds to deactivate arms iteratively. At each round, the budget is divided by a nonlinear function of remaining arms, and the arms are pulled correspondingly. Based on a decision rule, the deactivated arm at each round may be accepted or rejected. The algorithm"},"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":"1707.02649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-09T22:32:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"efd470a0ca6dda4e1e38db5596731254e764fbd419d4144f70db10ddef23fc52","abstract_canon_sha256":"07bf8c495af1aae4c454c38cdba9c7fdb67e2330bb6000a3720ac734a1674c1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:36.239547Z","signature_b64":"qu02JpPCMGn0hjrDYoM3XG9tXf7yc9uwXZiPDv0bJiTF4cyeR3YQI4K8QKVvpiCfZm8fdfOLkAj0oGaVOrKXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46970e9b66d693ff3ffdb6c139403666bbb279e309d2c1c6c6ffbe357a067a0b","last_reissued_at":"2026-05-18T00:40:36.238872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:36.238872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear Sequential Accepts and Rejects for Identification of Top Arms in Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Shahin Shahrampour, Vahid Tarokh","submitted_at":"2017-07-09T22:32:09Z","abstract_excerpt":"We address the M-best-arm identification problem in multi-armed bandits. A player has a limited budget to explore K arms (M<K), and once pulled, each arm yields a reward drawn (independently) from a fixed, unknown distribution. The goal is to find the top M arms in the sense of expected reward. We develop an algorithm which proceeds in rounds to deactivate arms iteratively. At each round, the budget is divided by a nonlinear function of remaining arms, and the arms are pulled correspondingly. Based on a decision rule, the deactivated arm at each round may be accepted or rejected. The algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02649","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":"1707.02649","created_at":"2026-05-18T00:40:36.238974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02649v1","created_at":"2026-05-18T00:40:36.238974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02649","created_at":"2026-05-18T00:40:36.238974+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2LQ5G3G22J7","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2LQ5G3G22J76P75","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2LQ5G3G","created_at":"2026-05-18T12:31:21.493067+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/I2LQ5G3G22J76P75W3ATSQBWM2","json":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2.json","graph_json":"https://pith.science/api/pith-number/I2LQ5G3G22J76P75W3ATSQBWM2/graph.json","events_json":"https://pith.science/api/pith-number/I2LQ5G3G22J76P75W3ATSQBWM2/events.json","paper":"https://pith.science/paper/I2LQ5G3G"},"agent_actions":{"view_html":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2","download_json":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2.json","view_paper":"https://pith.science/paper/I2LQ5G3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02649&json=true","fetch_graph":"https://pith.science/api/pith-number/I2LQ5G3G22J76P75W3ATSQBWM2/graph.json","fetch_events":"https://pith.science/api/pith-number/I2LQ5G3G22J76P75W3ATSQBWM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2/action/storage_attestation","attest_author":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2/action/author_attestation","sign_citation":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2/action/citation_signature","submit_replication":"https://pith.science/pith/I2LQ5G3G22J76P75W3ATSQBWM2/action/replication_record"}},"created_at":"2026-05-18T00:40:36.238974+00:00","updated_at":"2026-05-18T00:40:36.238974+00:00"}