{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VHJVUXK4GARADW2MA2KWREC4U5","short_pith_number":"pith:VHJVUXK4","schema_version":"1.0","canonical_sha256":"a9d35a5d5c302201db4c069568905ca764d7f7e3775011b0c02e99b4b238c059","source":{"kind":"arxiv","id":"1702.03605","version":1},"attestation_state":"computed","paper":{"title":"Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen, Mingda Qiao","submitted_at":"2017-02-13T01:31:46Z","abstract_excerpt":"In the Best-$k$-Arm problem, we are given $n$ stochastic bandit arms, each associated with an unknown reward distribution. We are required to identify the $k$ arms with the largest means by taking as few samples as possible. In this paper, we make progress towards a complete characterization of the instance-wise sample complexity bounds for the Best-$k$-Arm problem. On the lower bound side, we obtain a novel complexity term to measure the sample complexity that every Best-$k$-Arm instance requires. This is derived by an interesting and nontrivial reduction from the Best-$1$-Arm problem. We als"},"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":"1702.03605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-13T01:31:46Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"b375c224a4e18ee88fd3ac5fc40ba3ee58cd4db78a1b4b6ba94627ad9e8d790a","abstract_canon_sha256":"5d18fc839411f7f6102de3021d06e16609d885a1f46505a469aa8f0558a4867c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:51.612210Z","signature_b64":"lzcPjV3xOZzxESP1M36F4qFDalNrAQQDEqCBzYT2qNdGUuDfBlN0op4A+w8fAYCqt+uGqTbZitSjKN3+tDQfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d35a5d5c302201db4c069568905ca764d7f7e3775011b0c02e99b4b238c059","last_reissued_at":"2026-05-18T00:50:51.611578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:51.611578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen, Mingda Qiao","submitted_at":"2017-02-13T01:31:46Z","abstract_excerpt":"In the Best-$k$-Arm problem, we are given $n$ stochastic bandit arms, each associated with an unknown reward distribution. We are required to identify the $k$ arms with the largest means by taking as few samples as possible. In this paper, we make progress towards a complete characterization of the instance-wise sample complexity bounds for the Best-$k$-Arm problem. On the lower bound side, we obtain a novel complexity term to measure the sample complexity that every Best-$k$-Arm instance requires. This is derived by an interesting and nontrivial reduction from the Best-$1$-Arm problem. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03605","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":"1702.03605","created_at":"2026-05-18T00:50:51.611668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03605v1","created_at":"2026-05-18T00:50:51.611668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03605","created_at":"2026-05-18T00:50:51.611668+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHJVUXK4GARA","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHJVUXK4GARADW2M","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHJVUXK4","created_at":"2026-05-18T12:31:49.984773+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/VHJVUXK4GARADW2MA2KWREC4U5","json":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5.json","graph_json":"https://pith.science/api/pith-number/VHJVUXK4GARADW2MA2KWREC4U5/graph.json","events_json":"https://pith.science/api/pith-number/VHJVUXK4GARADW2MA2KWREC4U5/events.json","paper":"https://pith.science/paper/VHJVUXK4"},"agent_actions":{"view_html":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5","download_json":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5.json","view_paper":"https://pith.science/paper/VHJVUXK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03605&json=true","fetch_graph":"https://pith.science/api/pith-number/VHJVUXK4GARADW2MA2KWREC4U5/graph.json","fetch_events":"https://pith.science/api/pith-number/VHJVUXK4GARADW2MA2KWREC4U5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/action/storage_attestation","attest_author":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/action/author_attestation","sign_citation":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/action/citation_signature","submit_replication":"https://pith.science/pith/VHJVUXK4GARADW2MA2KWREC4U5/action/replication_record"}},"created_at":"2026-05-18T00:50:51.611668+00:00","updated_at":"2026-05-18T00:50:51.611668+00:00"}