{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DE7VXBWMP66PMFARWK3OCZAKZC","short_pith_number":"pith:DE7VXBWM","schema_version":"1.0","canonical_sha256":"193f5b86cc7fbcf61411b2b6e1640ac8a6d3567255a2046430d3bd5e5b216246","source":{"kind":"arxiv","id":"2601.15620","version":2},"attestation_state":"computed","paper":{"title":"Closing the Gap on the Sample Complexity of 1-Identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Matching lower and upper bounds close the sample complexity gap for 1-identification in bandits","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Wang Chi Cheung, Zitian Li","submitted_at":"2026-01-22T03:50:31Z","abstract_excerpt":"The 1-identification problem is a fundamental pure-exploration problem in multi-armed bandits. An agent aims to determine whether there exists an arm whose mean reward exceeds a known threshold $\\mu_0$, or to output \\textsf{None} otherwise. The agent must guarantee correctness with probability at least $1-\\delta$, while minimizing the expected number of arm pulls $\\mathbb{E}[\\tau]$. We study the 1-identification problem and make two main contributions. First, for instances with at least one qualified arm, we derive a new lower bound on $\\mathbb{E}[\\tau]$ via a novel optimization formulation. S"},"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":true},"canonical_record":{"source":{"id":"2601.15620","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-22T03:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"5aa1a22329b8e12cd043a6a0f5cca1bc0f89df06a5ad3b1efde8fa23d4ab7e67","abstract_canon_sha256":"7f75777d379bf95ff5cc317055d7575dd4095591d55a9dc488bd26df1ca3e2e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:16.607663Z","signature_b64":"eduQD1mGqxqcC1+Kxu52tzoys/vbPiQkmLXdi+Y/MGeKB9pa5UawxQmboDUqRfSjAtUsyCkK0XF+P6I+U8TvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"193f5b86cc7fbcf61411b2b6e1640ac8a6d3567255a2046430d3bd5e5b216246","last_reissued_at":"2026-05-17T23:39:16.606992Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:16.606992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closing the Gap on the Sample Complexity of 1-Identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Matching lower and upper bounds close the sample complexity gap for 1-identification in bandits","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Wang Chi Cheung, Zitian Li","submitted_at":"2026-01-22T03:50:31Z","abstract_excerpt":"The 1-identification problem is a fundamental pure-exploration problem in multi-armed bandits. An agent aims to determine whether there exists an arm whose mean reward exceeds a known threshold $\\mu_0$, or to output \\textsf{None} otherwise. The agent must guarantee correctness with probability at least $1-\\delta$, while minimizing the expected number of arm pulls $\\mathbb{E}[\\tau]$. We study the 1-identification problem and make two main contributions. First, for instances with at least one qualified arm, we derive a new lower bound on $\\mathbb{E}[\\tau]$ via a novel optimization formulation. S"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"for instances with at least one qualified arm, we derive a new lower bound on E[τ] via a novel optimization formulation... upper bounds that match the lower bounds up to polynomial logarithmic factors uniformly over all instances.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The novel optimization formulation accurately captures the information-theoretic complexity of 1-identification, and standard concentration assumptions on rewards (e.g., sub-Gaussian) suffice for the upper-bound analysis to hold uniformly.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"New lower bound via optimization and matching upper bounds close the sample complexity gap for 1-identification in bandits with at least one qualified arm.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Matching lower and upper bounds close the sample complexity gap for 1-identification in bandits","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"239532076a5408742b5cc81ad7791e8eb1cd7e62c62427c500dff61b2ab302a1"},"source":{"id":"2601.15620","kind":"arxiv","version":2},"verdict":{"id":"3e300fe5-fddc-4e78-8692-c60c2b1f7a8b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T12:25:13.321790Z","strongest_claim":"for instances with at least one qualified arm, we derive a new lower bound on E[τ] via a novel optimization formulation... upper bounds that match the lower bounds up to polynomial logarithmic factors uniformly over all instances.","one_line_summary":"New lower bound via optimization and matching upper bounds close the sample complexity gap for 1-identification in bandits with at least one qualified arm.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The novel optimization formulation accurately captures the information-theoretic complexity of 1-identification, and standard concentration assumptions on rewards (e.g., sub-Gaussian) suffice for the upper-bound analysis to hold uniformly.","pith_extraction_headline":"Matching lower and upper bounds close the sample complexity gap for 1-identification in bandits"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"488bb50a0526f3dcf8b306224460f50563bfdbe9271e926152505ffafc6af949"},"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":"2601.15620","created_at":"2026-05-17T23:39:16.607100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.15620v2","created_at":"2026-05-17T23:39:16.607100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.15620","created_at":"2026-05-17T23:39:16.607100+00:00"},{"alias_kind":"pith_short_12","alias_value":"DE7VXBWMP66P","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"DE7VXBWMP66PMFAR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"DE7VXBWM","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23182","citing_title":"Pure Exploration for a Good Policy in Reinforcement Learning with Bandit Feedback","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC","json":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC.json","graph_json":"https://pith.science/api/pith-number/DE7VXBWMP66PMFARWK3OCZAKZC/graph.json","events_json":"https://pith.science/api/pith-number/DE7VXBWMP66PMFARWK3OCZAKZC/events.json","paper":"https://pith.science/paper/DE7VXBWM"},"agent_actions":{"view_html":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC","download_json":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC.json","view_paper":"https://pith.science/paper/DE7VXBWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.15620&json=true","fetch_graph":"https://pith.science/api/pith-number/DE7VXBWMP66PMFARWK3OCZAKZC/graph.json","fetch_events":"https://pith.science/api/pith-number/DE7VXBWMP66PMFARWK3OCZAKZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC/action/storage_attestation","attest_author":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC/action/author_attestation","sign_citation":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC/action/citation_signature","submit_replication":"https://pith.science/pith/DE7VXBWMP66PMFARWK3OCZAKZC/action/replication_record"}},"created_at":"2026-05-17T23:39:16.607100+00:00","updated_at":"2026-05-17T23:39:16.607100+00:00"}