{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BRKGKJSIIWRAMGWSGMOCEQ7CF5","short_pith_number":"pith:BRKGKJSI","schema_version":"1.0","canonical_sha256":"0c5465264845a2061ad2331c2243e22f5d847d87aa08dfbe02c22af03b1bec92","source":{"kind":"arxiv","id":"2606.11347","version":1},"attestation_state":"computed","paper":{"title":"Annealed Entropic Allocation for Ranking and Selection","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Juergen Branke, Xin Fei","submitted_at":"2026-06-09T18:25:02Z","abstract_excerpt":"We propose Annealed Entropic Allocation, an annealed weighted soft-min framework for sequential budget allocation in ranking and selection. The central idea is to replace the non-smooth maximin large-deviation rate objective with a weighted log-sum-exp surrogate that aggregates challenger-specific pairwise scores through soft-min weights, mitigating hard switching when several challengers are nearly active. To improve finite-budget discrimination, we incorporate the saddlepoint approximation -- a sub-exponential correction derived from refined pairwise tail asymptotics. Because these correctio"},"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":"2606.11347","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ML","submitted_at":"2026-06-09T18:25:02Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"18d2a17de1a18584bea90fb83a713013a1cdf0b681aa34a0a8ab086c71b293ce","abstract_canon_sha256":"5773ab0563e47157bed7120c353956bd5246aff0fac7a569c49d86e25be76acb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T00:08:20.967819Z","signature_b64":"QiDRyAPSfv+rhIqifJss8Fne5g0k3IBYlagbmKGpB7yuW9aHoGlmic7wi88V0TNTYH37nwvA4GhDaZXSybqKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c5465264845a2061ad2331c2243e22f5d847d87aa08dfbe02c22af03b1bec92","last_reissued_at":"2026-06-11T00:08:20.967099Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T00:08:20.967099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Annealed Entropic Allocation for Ranking and Selection","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Juergen Branke, Xin Fei","submitted_at":"2026-06-09T18:25:02Z","abstract_excerpt":"We propose Annealed Entropic Allocation, an annealed weighted soft-min framework for sequential budget allocation in ranking and selection. The central idea is to replace the non-smooth maximin large-deviation rate objective with a weighted log-sum-exp surrogate that aggregates challenger-specific pairwise scores through soft-min weights, mitigating hard switching when several challengers are nearly active. To improve finite-budget discrimination, we incorporate the saddlepoint approximation -- a sub-exponential correction derived from refined pairwise tail asymptotics. Because these correctio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11347","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/2606.11347/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":"2606.11347","created_at":"2026-06-11T00:08:20.967211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11347v1","created_at":"2026-06-11T00:08:20.967211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11347","created_at":"2026-06-11T00:08:20.967211+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRKGKJSIIWRA","created_at":"2026-06-11T00:08:20.967211+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRKGKJSIIWRAMGWS","created_at":"2026-06-11T00:08:20.967211+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRKGKJSI","created_at":"2026-06-11T00:08:20.967211+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/BRKGKJSIIWRAMGWSGMOCEQ7CF5","json":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5.json","graph_json":"https://pith.science/api/pith-number/BRKGKJSIIWRAMGWSGMOCEQ7CF5/graph.json","events_json":"https://pith.science/api/pith-number/BRKGKJSIIWRAMGWSGMOCEQ7CF5/events.json","paper":"https://pith.science/paper/BRKGKJSI"},"agent_actions":{"view_html":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5","download_json":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5.json","view_paper":"https://pith.science/paper/BRKGKJSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11347&json=true","fetch_graph":"https://pith.science/api/pith-number/BRKGKJSIIWRAMGWSGMOCEQ7CF5/graph.json","fetch_events":"https://pith.science/api/pith-number/BRKGKJSIIWRAMGWSGMOCEQ7CF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5/action/storage_attestation","attest_author":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5/action/author_attestation","sign_citation":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5/action/citation_signature","submit_replication":"https://pith.science/pith/BRKGKJSIIWRAMGWSGMOCEQ7CF5/action/replication_record"}},"created_at":"2026-06-11T00:08:20.967211+00:00","updated_at":"2026-06-11T00:08:20.967211+00:00"}