{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AE2B64E3VVVXLSJJXDLFSW5JXM","short_pith_number":"pith:AE2B64E3","schema_version":"1.0","canonical_sha256":"01341f709bad6b75c929b8d6595ba9bb26f6840d3ca99ddb224c059d3cc65ea3","source":{"kind":"arxiv","id":"1706.01026","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Multiple-Arm Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiecao Chen, Qin Zhang, Xi Chen, Yuan Zhou","submitted_at":"2017-06-04T05:04:52Z","abstract_excerpt":"We study the problem of selecting $K$ arms with the highest expected rewards in a stochastic $n$-armed bandit game. This problem has a wide range of applications, e.g., A/B testing, crowdsourcing, simulation optimization. Our goal is to develop a PAC algorithm, which, with probability at least $1-\\delta$, identifies a set of $K$ arms with the aggregate regret at most $\\epsilon$. The notion of aggregate regret for multiple-arm identification was first introduced in \\cite{Zhou:14} , which is defined as the difference of the averaged expected rewards between the selected set of arms and the best "},"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":"1706.01026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T05:04:52Z","cross_cats_sorted":[],"title_canon_sha256":"46c1c6f13cc2c53d2c027b996f8522a9dbd05a1266afd4333cfbfab2ddee7bb9","abstract_canon_sha256":"76f213227a13709950ad5417028e9fa275620e48a0fac26d018a9e1449ed3217"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:07.027357Z","signature_b64":"c66RxUSb4VMbCF+s/0Xvf5bE4bTTSetjXBnWtRsvvNOpsHDVttMboZEVZcS7fE96gw4r3KxNXr81wH1i0wczCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01341f709bad6b75c929b8d6595ba9bb26f6840d3ca99ddb224c059d3cc65ea3","last_reissued_at":"2026-05-18T00:43:07.026595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:07.026595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Multiple-Arm Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiecao Chen, Qin Zhang, Xi Chen, Yuan Zhou","submitted_at":"2017-06-04T05:04:52Z","abstract_excerpt":"We study the problem of selecting $K$ arms with the highest expected rewards in a stochastic $n$-armed bandit game. This problem has a wide range of applications, e.g., A/B testing, crowdsourcing, simulation optimization. Our goal is to develop a PAC algorithm, which, with probability at least $1-\\delta$, identifies a set of $K$ arms with the aggregate regret at most $\\epsilon$. The notion of aggregate regret for multiple-arm identification was first introduced in \\cite{Zhou:14} , which is defined as the difference of the averaged expected rewards between the selected set of arms and the best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01026","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":"1706.01026","created_at":"2026-05-18T00:43:07.026722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01026v1","created_at":"2026-05-18T00:43:07.026722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01026","created_at":"2026-05-18T00:43:07.026722+00:00"},{"alias_kind":"pith_short_12","alias_value":"AE2B64E3VVVX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AE2B64E3VVVXLSJJ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AE2B64E3","created_at":"2026-05-18T12:31:05.417338+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/AE2B64E3VVVXLSJJXDLFSW5JXM","json":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM.json","graph_json":"https://pith.science/api/pith-number/AE2B64E3VVVXLSJJXDLFSW5JXM/graph.json","events_json":"https://pith.science/api/pith-number/AE2B64E3VVVXLSJJXDLFSW5JXM/events.json","paper":"https://pith.science/paper/AE2B64E3"},"agent_actions":{"view_html":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM","download_json":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM.json","view_paper":"https://pith.science/paper/AE2B64E3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01026&json=true","fetch_graph":"https://pith.science/api/pith-number/AE2B64E3VVVXLSJJXDLFSW5JXM/graph.json","fetch_events":"https://pith.science/api/pith-number/AE2B64E3VVVXLSJJXDLFSW5JXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM/action/storage_attestation","attest_author":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM/action/author_attestation","sign_citation":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM/action/citation_signature","submit_replication":"https://pith.science/pith/AE2B64E3VVVXLSJJXDLFSW5JXM/action/replication_record"}},"created_at":"2026-05-18T00:43:07.026722+00:00","updated_at":"2026-05-18T00:43:07.026722+00:00"}