{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5DEHJ3YFJCWY72T42J6QBOWTXK","short_pith_number":"pith:5DEHJ3YF","schema_version":"1.0","canonical_sha256":"e8c874ef0548ad8fea7cd27d00bad3ba9e62949d9d86296ffbc6e94ef18f573c","source":{"kind":"arxiv","id":"2607.11635","version":1},"attestation_state":"computed","paper":{"title":"Fundamental Limitations of Fixed-Budget Best-Arm Identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Motti Goldberger","submitted_at":"2026-07-13T14:50:32Z","abstract_excerpt":"In fixed-budget best-arm identification, also known as ranking and selection, an algorithm has a sampling budget to distribute across $K$ arms. Each sample provides noisy feedback about that arm's mean, and the goal is to identify the arm with the largest mean. A common performance benchmark is the static oracle: a non-adaptive strategy that knows the means in advance and chooses fixed sampling proportions to maximize the exponential decay rate of the probability of incorrect identification. Several adaptive algorithms have been constructed such that their sampling proportions converge to the "},"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":"2607.11635","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-13T14:50:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f2ea0d72439b6eae90468692b49c8b0e8919ab655e6c17f51b798f3d885782ac","abstract_canon_sha256":"bc03cd70486d067a4a5125a55739e6551a91d5769cecad6f2e1792ce78123f6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T02:22:16.000425Z","signature_b64":"fb7KdHFSxuYwbWAMQbi+KkFDNq6OVT5Eif0OThOhFchUWJXQwRIzWm1krPqJVhGa87uT8GF2kVrIEC7BZMNXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c874ef0548ad8fea7cd27d00bad3ba9e62949d9d86296ffbc6e94ef18f573c","last_reissued_at":"2026-07-14T02:22:15.998231Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T02:22:15.998231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Limitations of Fixed-Budget Best-Arm Identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Motti Goldberger","submitted_at":"2026-07-13T14:50:32Z","abstract_excerpt":"In fixed-budget best-arm identification, also known as ranking and selection, an algorithm has a sampling budget to distribute across $K$ arms. Each sample provides noisy feedback about that arm's mean, and the goal is to identify the arm with the largest mean. A common performance benchmark is the static oracle: a non-adaptive strategy that knows the means in advance and chooses fixed sampling proportions to maximize the exponential decay rate of the probability of incorrect identification. Several adaptive algorithms have been constructed such that their sampling proportions converge to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11635","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.11635/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":"2607.11635","created_at":"2026-07-14T02:22:15.999978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11635v1","created_at":"2026-07-14T02:22:15.999978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11635","created_at":"2026-07-14T02:22:15.999978+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DEHJ3YFJCWY","created_at":"2026-07-14T02:22:15.999978+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DEHJ3YFJCWY72T4","created_at":"2026-07-14T02:22:15.999978+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DEHJ3YF","created_at":"2026-07-14T02:22:15.999978+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/5DEHJ3YFJCWY72T42J6QBOWTXK","json":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK.json","graph_json":"https://pith.science/api/pith-number/5DEHJ3YFJCWY72T42J6QBOWTXK/graph.json","events_json":"https://pith.science/api/pith-number/5DEHJ3YFJCWY72T42J6QBOWTXK/events.json","paper":"https://pith.science/paper/5DEHJ3YF"},"agent_actions":{"view_html":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK","download_json":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK.json","view_paper":"https://pith.science/paper/5DEHJ3YF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11635&json=true","fetch_graph":"https://pith.science/api/pith-number/5DEHJ3YFJCWY72T42J6QBOWTXK/graph.json","fetch_events":"https://pith.science/api/pith-number/5DEHJ3YFJCWY72T42J6QBOWTXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK/action/storage_attestation","attest_author":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK/action/author_attestation","sign_citation":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK/action/citation_signature","submit_replication":"https://pith.science/pith/5DEHJ3YFJCWY72T42J6QBOWTXK/action/replication_record"}},"created_at":"2026-07-14T02:22:15.999978+00:00","updated_at":"2026-07-14T02:22:15.999978+00:00"}