{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MM6DGR7RSKBLNVKD5XE2XDOBOA","short_pith_number":"pith:MM6DGR7R","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"},"canonical_sha256":"633c3347f19282b6d543edc9ab8dc1702a1efa3b12b806f61ebb6cb563dd112b","source":{"kind":"arxiv","id":"2305.07603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.07603","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"arxiv_version","alias_value":"2305.07603v1","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07603","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"pith_short_12","alias_value":"MM6DGR7RSKBL","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"pith_short_16","alias_value":"MM6DGR7RSKBLNVKD","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"pith_short_8","alias_value":"MM6DGR7R","created_at":"2026-07-05T06:09:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MM6DGR7RSKBLNVKD5XE2XDOBOA","target":"record","payload":{"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"},"canonical_sha256":"633c3347f19282b6d543edc9ab8dc1702a1efa3b12b806f61ebb6cb563dd112b","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"},"source_kind":"arxiv","source_id":"2305.07603","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:09:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEYuGvvtiUzsvkhtPFkueTrx1Y0qwjCz/NHc2imCG1DvYE3REcXVZkARQ4Uv/d86QDVunwekWEhKOB9Lr1FVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:29:23.250483Z"},"content_sha256":"d06b2b4824a277db2fb76bed4fa5cb341f398bd3ce6d4a6de6f7984ee6ca1b10","schema_version":"1.0","event_id":"sha256:d06b2b4824a277db2fb76bed4fa5cb341f398bd3ce6d4a6de6f7984ee6ca1b10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MM6DGR7RSKBLNVKD5XE2XDOBOA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:09:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDZpf5xtJHz8HUIUeeHOSBAuz1Dbsgo74zFI+9IeWJMM68UXHPKUQWBTyeKi/5vIh+pDcSCc981HTdgvtgtbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:29:23.251361Z"},"content_sha256":"0235a9fd337a738b50cc90ec1b964bec5839909c20f07a4fa0b69b640cbbd84d","schema_version":"1.0","event_id":"sha256:0235a9fd337a738b50cc90ec1b964bec5839909c20f07a4fa0b69b640cbbd84d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/bundle.json","state_url":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T08:29:23Z","links":{"resolver":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA","bundle":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/bundle.json","state":"https://pith.science/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MM6DGR7RSKBLNVKD5XE2XDOBOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MM6DGR7RSKBLNVKD5XE2XDOBOA","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":"81acc4db3f116d75b0b82b47a3fdf5fa8e0197d44209db7397c1b9d34d90e534","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-12T16:51:32Z","title_canon_sha256":"220127545057502aeebba17a5d94502693324587c1b4dcdbca96079bbd8dd296"},"schema_version":"1.0","source":{"id":"2305.07603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.07603","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"arxiv_version","alias_value":"2305.07603v1","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07603","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"pith_short_12","alias_value":"MM6DGR7RSKBL","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"pith_short_16","alias_value":"MM6DGR7RSKBLNVKD","created_at":"2026-07-05T06:09:38Z"},{"alias_kind":"pith_short_8","alias_value":"MM6DGR7R","created_at":"2026-07-05T06:09:38Z"}],"graph_snapshots":[{"event_id":"sha256:0235a9fd337a738b50cc90ec1b964bec5839909c20f07a4fa0b69b640cbbd84d","target":"graph","created_at":"2026-07-05T06:09:38Z","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/2305.07603/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. ","authors_text":"Hui Xiao, Zhihong Wei","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-12T16:51:32Z","title":"Efficient Dynamic Allocation Policy for Robust Ranking and Selection under Stochastic Control Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.07603","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:d06b2b4824a277db2fb76bed4fa5cb341f398bd3ce6d4a6de6f7984ee6ca1b10","target":"record","created_at":"2026-07-05T06:09:38Z","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":"81acc4db3f116d75b0b82b47a3fdf5fa8e0197d44209db7397c1b9d34d90e534","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-12T16:51:32Z","title_canon_sha256":"220127545057502aeebba17a5d94502693324587c1b4dcdbca96079bbd8dd296"},"schema_version":"1.0","source":{"id":"2305.07603","kind":"arxiv","version":1}},"canonical_sha256":"633c3347f19282b6d543edc9ab8dc1702a1efa3b12b806f61ebb6cb563dd112b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"633c3347f19282b6d543edc9ab8dc1702a1efa3b12b806f61ebb6cb563dd112b","first_computed_at":"2026-07-05T06:09:38.163904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:38.163904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWbqq2H6lRsGkqk0HkHtHXRVVhgKtRFDh7TIGUYd0pjv5z9vQIfkFqbsM/ZUXXWesosvSoEuJZwd2Iw9Ydd2BA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:38.164274Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.07603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d06b2b4824a277db2fb76bed4fa5cb341f398bd3ce6d4a6de6f7984ee6ca1b10","sha256:0235a9fd337a738b50cc90ec1b964bec5839909c20f07a4fa0b69b640cbbd84d"],"state_sha256":"8b9599fe4c02005cedbc187ba472ee4a0b292f4116225ef2620f951ec0cf0f68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52IKzpwpkZ4pets1DLGpQxqujrsERoeHcjZzWgDcZ3/fOsvkEejM7aWZIn3eMHvF+tcMAoSyYwTEVnPVgBcJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T08:29:23.257667Z","bundle_sha256":"c1f40d80f7bdefb028f6508f9b79a8a2edc0b11f9824b518c66c4e0934aa3765"}}