{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DE7VXBWMP66PMFARWK3OCZAKZC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7f75777d379bf95ff5cc317055d7575dd4095591d55a9dc488bd26df1ca3e2e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-22T03:50:31Z","title_canon_sha256":"5aa1a22329b8e12cd043a6a0f5cca1bc0f89df06a5ad3b1efde8fa23d4ab7e67"},"schema_version":"1.0","source":{"id":"2601.15620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.15620","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2601.15620v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.15620","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"DE7VXBWMP66P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DE7VXBWMP66PMFAR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DE7VXBWM","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:663c5a4229d9d8c3610f6ae09452f05981a16abee027a4e43518443348813c49","target":"graph","created_at":"2026-05-17T23:39:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Matching lower and upper bounds close the sample complexity gap for 1-identification in bandits"}],"snapshot_sha256":"239532076a5408742b5cc81ad7791e8eb1cd7e62c62427c500dff61b2ab302a1"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"488bb50a0526f3dcf8b306224460f50563bfdbe9271e926152505ffafc6af949"},"paper":{"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","authors_text":"Wang Chi Cheung, Zitian Li","cross_cats":[],"headline":"Matching lower and upper bounds close the sample complexity gap for 1-identification in bandits","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-22T03:50:31Z","title":"Closing the Gap on the Sample Complexity of 1-Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.15620","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T12:25:13.321790Z","id":"3e300fe5-fddc-4e78-8692-c60c2b1f7a8b","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Matching lower and upper bounds close the sample complexity gap for 1-identification in bandits","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.","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."}},"verdict_id":"3e300fe5-fddc-4e78-8692-c60c2b1f7a8b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ec4b135853e06f92de4d27b5d63e2862b44f633f77bbbdec74781afb456dbf65","target":"record","created_at":"2026-05-17T23:39:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7f75777d379bf95ff5cc317055d7575dd4095591d55a9dc488bd26df1ca3e2e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-22T03:50:31Z","title_canon_sha256":"5aa1a22329b8e12cd043a6a0f5cca1bc0f89df06a5ad3b1efde8fa23d4ab7e67"},"schema_version":"1.0","source":{"id":"2601.15620","kind":"arxiv","version":2}},"canonical_sha256":"193f5b86cc7fbcf61411b2b6e1640ac8a6d3567255a2046430d3bd5e5b216246","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"193f5b86cc7fbcf61411b2b6e1640ac8a6d3567255a2046430d3bd5e5b216246","first_computed_at":"2026-05-17T23:39:16.606992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:16.606992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eduQD1mGqxqcC1+Kxu52tzoys/vbPiQkmLXdi+Y/MGeKB9pa5UawxQmboDUqRfSjAtUsyCkK0XF+P6I+U8TvCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:16.607663Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.15620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec4b135853e06f92de4d27b5d63e2862b44f633f77bbbdec74781afb456dbf65","sha256:663c5a4229d9d8c3610f6ae09452f05981a16abee027a4e43518443348813c49"],"state_sha256":"9f350b0108067e83e380a9249f26733c536e601050d044df83c0081d5ce148d8"}