{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MM6DGR7RSKBLNVKD5XE2XDOBOA","short_pith_number":"pith:MM6DGR7R","schema_version":"1.0","canonical_sha256":"633c3347f19282b6d543edc9ab8dc1702a1efa3b12b806f61ebb6cb563dd112b","source":{"kind":"arxiv","id":"2305.07603","version":1},"attestation_state":"computed","paper":{"title":"Efficient Dynamic Allocation Policy for Robust Ranking and Selection under Stochastic Control Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Hui Xiao, Zhihong Wei","submitted_at":"2023-05-12T16:51:32Z","abstract_excerpt":"This research considers the ranking and selection with input uncertainty. The objective is to maximize the posterior probability of correctly selecting the best alternative under a fixed simulation budget, where each alternative is measured by its worst-case performance. We formulate the dynamic simulation budget allocation decision problem as a stochastic control problem under a Bayesian framework. Following the approximate dynamic programming theory, we derive a one-step-ahead dynamic optimal budget allocation policy and prove that this policy achieves consistency and asymptotic optimality. "},"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":"2305.07603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-12T16:51:32Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"220127545057502aeebba17a5d94502693324587c1b4dcdbca96079bbd8dd296","abstract_canon_sha256":"81acc4db3f116d75b0b82b47a3fdf5fa8e0197d44209db7397c1b9d34d90e534"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:38.164274Z","signature_b64":"RWbqq2H6lRsGkqk0HkHtHXRVVhgKtRFDh7TIGUYd0pjv5z9vQIfkFqbsM/ZUXXWesosvSoEuJZwd2Iw9Ydd2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"633c3347f19282b6d543edc9ab8dc1702a1efa3b12b806f61ebb6cb563dd112b","last_reissued_at":"2026-07-05T06:09:38.163904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:38.163904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Dynamic Allocation Policy for Robust Ranking and Selection under Stochastic Control Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Hui Xiao, Zhihong Wei","submitted_at":"2023-05-12T16:51:32Z","abstract_excerpt":"This research considers the ranking and selection with input uncertainty. The objective is to maximize the posterior probability of correctly selecting the best alternative under a fixed simulation budget, where each alternative is measured by its worst-case performance. We formulate the dynamic simulation budget allocation decision problem as a stochastic control problem under a Bayesian framework. Following the approximate dynamic programming theory, we derive a one-step-ahead dynamic optimal budget allocation policy and prove that this policy achieves consistency and asymptotic optimality. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.07603","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/2305.07603/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":"2305.07603","created_at":"2026-07-05T06:09:38.163957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.07603v1","created_at":"2026-07-05T06:09:38.163957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07603","created_at":"2026-07-05T06:09:38.163957+00:00"},{"alias_kind":"pith_short_12","alias_value":"MM6DGR7RSKBL","created_at":"2026-07-05T06:09:38.163957+00:00"},{"alias_kind":"pith_short_16","alias_value":"MM6DGR7RSKBLNVKD","created_at":"2026-07-05T06:09:38.163957+00:00"},{"alias_kind":"pith_short_8","alias_value":"MM6DGR7R","created_at":"2026-07-05T06:09:38.163957+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/MM6DGR7RSKBLNVKD5XE2XDOBOA","json":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA.json","graph_json":"https://pith.science/api/pith-number/MM6DGR7RSKBLNVKD5XE2XDOBOA/graph.json","events_json":"https://pith.science/api/pith-number/MM6DGR7RSKBLNVKD5XE2XDOBOA/events.json","paper":"https://pith.science/paper/MM6DGR7R"},"agent_actions":{"view_html":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA","download_json":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA.json","view_paper":"https://pith.science/paper/MM6DGR7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.07603&json=true","fetch_graph":"https://pith.science/api/pith-number/MM6DGR7RSKBLNVKD5XE2XDOBOA/graph.json","fetch_events":"https://pith.science/api/pith-number/MM6DGR7RSKBLNVKD5XE2XDOBOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/action/storage_attestation","attest_author":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/action/author_attestation","sign_citation":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/action/citation_signature","submit_replication":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/action/replication_record"}},"created_at":"2026-07-05T06:09:38.163957+00:00","updated_at":"2026-07-05T06:09:38.163957+00:00"}