{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:24O2SNJHSMBHKDXJJ7WUICIEJU","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":"77f4dda52f287c1d0fb6b46f0e34a70d2f735a6fad9d24eebcc9cbc3d52dc29f","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T02:56:26Z","title_canon_sha256":"588ff9cfaf9c4b8a652e348140e9d0ce0b4912293df3cea25c5e68a8f9a067b8"},"schema_version":"1.0","source":{"id":"2506.02386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02386","created_at":"2026-07-05T11:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02386v1","created_at":"2026-07-05T11:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02386","created_at":"2026-07-05T11:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"24O2SNJHSMBH","created_at":"2026-07-05T11:14:37Z"},{"alias_kind":"pith_short_16","alias_value":"24O2SNJHSMBHKDXJ","created_at":"2026-07-05T11:14:37Z"},{"alias_kind":"pith_short_8","alias_value":"24O2SNJH","created_at":"2026-07-05T11:14:37Z"}],"graph_snapshots":[{"event_id":"sha256:8693bfd8f9542cfd326c6665d88cd6f0a05c31e815c53dc55075650c2aafffd6","target":"graph","created_at":"2026-07-05T11:14:37Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.02386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The challenge of identifying the best feasible arm within a fixed budget has attracted considerable interest in recent years. However, a notable gap remains in the literature: the exact exponential rate at which the error probability approaches zero has yet to be established, even in the relatively simple setting of $K$-armed bandits with Gaussian noise. In this paper, we address this gap by examining the problem within the context of linear bandits. We introduce a novel algorithm for best feasible arm identification that guarantees an exponential decay in the error probability. Remarkably, th","authors_text":"Jie Bian, Vincent Y. F. Tan","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02386","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7ce15f78bc9b078d2687f1ea3ffcc4cd76f849022567c57f139d3a8299f778e3","target":"record","created_at":"2026-07-05T11:14:37Z","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":"77f4dda52f287c1d0fb6b46f0e34a70d2f735a6fad9d24eebcc9cbc3d52dc29f","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T02:56:26Z","title_canon_sha256":"588ff9cfaf9c4b8a652e348140e9d0ce0b4912293df3cea25c5e68a8f9a067b8"},"schema_version":"1.0","source":{"id":"2506.02386","kind":"arxiv","version":1}},"canonical_sha256":"d71da935279302750ee94fed4409044d05ffa1315072d23820f156aa6e7d3a8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d71da935279302750ee94fed4409044d05ffa1315072d23820f156aa6e7d3a8a","first_computed_at":"2026-07-05T11:14:37.905007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:37.905007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xAXaAZ9wTv/Nh+vwovD/WPzmFNjmvW2yg+Q9jWE+ienpilhob3k8NKlKMbgiaaCIS5efOHMXRWf7WMF64HNFDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:37.905504Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce15f78bc9b078d2687f1ea3ffcc4cd76f849022567c57f139d3a8299f778e3","sha256:8693bfd8f9542cfd326c6665d88cd6f0a05c31e815c53dc55075650c2aafffd6"],"state_sha256":"41fcac3597836a9848227362cf8c2a11efb92f3481873d744d6cb246b9d16800"}