{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5Q245JXNKKK36FVWG6RSTW53GZ","short_pith_number":"pith:5Q245JXN","schema_version":"1.0","canonical_sha256":"ec35cea6ed5295bf16b637a329dbbb36461192aa9516b85600070313a2b8834e","source":{"kind":"arxiv","id":"2506.06978","version":2},"attestation_state":"computed","paper":{"title":"Near Optimal Non-asymptotic Sample Complexity of 1-Identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Wang Chi Cheung, Zitian Li","submitted_at":"2025-06-08T03:23:45Z","abstract_excerpt":"Motivated by an open direction in existing literature, we study the 1-identification problem, a fundamental multi-armed bandit formulation on pure exploration. The goal is to determine whether there exists an arm whose mean reward is at least a known threshold $\\mu_0$, or to output None if it believes such an arm does not exist. The agent needs to guarantee its output is correct with probability at least $1-\\delta$. Degenne & Koolen 2019 has established the asymptotically tight sample complexity for the 1-identification problem, but they commented that the non-asymptotic analysis remains uncle"},"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":"2506.06978","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-08T03:23:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a33a41d44c82686c8ccf7cedd9a9f49dceeae7f3cb351ddeca71c355c4d158b8","abstract_canon_sha256":"653316e4f5e6b343a87a799f2043dbab0b3a6820fa931e107a1e8560a2a03e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:20.363090Z","signature_b64":"AU8Zv4I579gJ8iAdOkbfydM1zWJfBsKn3Fw1Y20+2XKdSwsn/8EwrNVtthlLmg2oYlpvawlRW3FpiHjWLvhNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec35cea6ed5295bf16b637a329dbbb36461192aa9516b85600070313a2b8834e","last_reissued_at":"2026-07-05T11:56:20.362684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:20.362684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimal Non-asymptotic Sample Complexity of 1-Identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Wang Chi Cheung, Zitian Li","submitted_at":"2025-06-08T03:23:45Z","abstract_excerpt":"Motivated by an open direction in existing literature, we study the 1-identification problem, a fundamental multi-armed bandit formulation on pure exploration. The goal is to determine whether there exists an arm whose mean reward is at least a known threshold $\\mu_0$, or to output None if it believes such an arm does not exist. The agent needs to guarantee its output is correct with probability at least $1-\\delta$. Degenne & Koolen 2019 has established the asymptotically tight sample complexity for the 1-identification problem, but they commented that the non-asymptotic analysis remains uncle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06978","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.06978/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.06978","created_at":"2026-07-05T11:56:20.362740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.06978v2","created_at":"2026-07-05T11:56:20.362740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06978","created_at":"2026-07-05T11:56:20.362740+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q245JXNKKK3","created_at":"2026-07-05T11:56:20.362740+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q245JXNKKK36FVW","created_at":"2026-07-05T11:56:20.362740+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q245JXN","created_at":"2026-07-05T11:56:20.362740+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/5Q245JXNKKK36FVWG6RSTW53GZ","json":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ.json","graph_json":"https://pith.science/api/pith-number/5Q245JXNKKK36FVWG6RSTW53GZ/graph.json","events_json":"https://pith.science/api/pith-number/5Q245JXNKKK36FVWG6RSTW53GZ/events.json","paper":"https://pith.science/paper/5Q245JXN"},"agent_actions":{"view_html":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ","download_json":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ.json","view_paper":"https://pith.science/paper/5Q245JXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.06978&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q245JXNKKK36FVWG6RSTW53GZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q245JXNKKK36FVWG6RSTW53GZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ/action/storage_attestation","attest_author":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ/action/author_attestation","sign_citation":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ/action/citation_signature","submit_replication":"https://pith.science/pith/5Q245JXNKKK36FVWG6RSTW53GZ/action/replication_record"}},"created_at":"2026-07-05T11:56:20.362740+00:00","updated_at":"2026-07-05T11:56:20.362740+00:00"}