{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O2JSSKOLQ452SJ2BVLIBBBVDRZ","short_pith_number":"pith:O2JSSKOL","canonical_record":{"source":{"id":"1710.02619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-07T01:53:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bf2672ac54b1e2986876fa4377da617d6c1f345623b0b7c3baf57b049608dd1d","abstract_canon_sha256":"6d25ac65c1ff11c3ff5a95eccbd7a5da7a5b996bcd9f52c8605fd420bef89273"},"schema_version":"1.0"},"canonical_sha256":"76932929cb873ba92741aad01086a38e4e0c317ea298a0783a45ad1f108b7cfc","source":{"kind":"arxiv","id":"1710.02619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02619","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02619v1","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02619","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"pith_short_12","alias_value":"O2JSSKOLQ452","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2JSSKOLQ452SJ2B","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2JSSKOL","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O2JSSKOLQ452SJ2BVLIBBBVDRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-07T01:53:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bf2672ac54b1e2986876fa4377da617d6c1f345623b0b7c3baf57b049608dd1d","abstract_canon_sha256":"6d25ac65c1ff11c3ff5a95eccbd7a5da7a5b996bcd9f52c8605fd420bef89273"},"schema_version":"1.0"},"canonical_sha256":"76932929cb873ba92741aad01086a38e4e0c317ea298a0783a45ad1f108b7cfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:29.315998Z","signature_b64":"6chwmmgauXI5DPNgZGLP2u33an/CpnQlN9uSJ5F+p/S08y8LAr3KL/1wqBBaKwhu02fTQ/0bOBvQ6j9fmOnsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76932929cb873ba92741aad01086a38e4e0c317ea298a0783a45ad1f108b7cfc","last_reissued_at":"2026-05-18T00:33:29.315485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:29.315485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02619","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-05-18T00:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KSld6VU0v0+Rx3HxSMmA4EAmYBaa36QiIRTsEvAt6wG/hqpBTZwEPa0EkJPBIHPRNEHZm1/GPRHfXo4LRUpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:36:33.931249Z"},"content_sha256":"80308c8298ffc4a75bd5f74b6527802c55d2ca25ad410def2bc458344634f9ec","schema_version":"1.0","event_id":"sha256:80308c8298ffc4a75bd5f74b6527802c55d2ca25ad410def2bc458344634f9ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O2JSSKOLQ452SJ2BVLIBBBVDRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking and Selection as Stochastic Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chun-Hung Chen, Edwin K. P. Chong, Michael C. Fu, Yijie Peng","submitted_at":"2017-10-07T01:53:54Z","abstract_excerpt":"Under a Bayesian framework, we formulate the fully sequential sampling and selection decision in statistical ranking and selection as a stochastic control problem, and derive the associated Bellman equation. Using value function approximation, we derive an approximately optimal allocation policy. We show that this policy is not only computationally efficient but also possesses both one-step-ahead and asymptotic optimality for independent normal sampling distributions. Moreover, the proposed allocation policy is easily generalizable in the approximate dynamic programming paradigm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02619","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":""},"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-05-18T00:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InztmyhyCTaLk8KlW87flx77kDnltDvbU73y8XkbQzMPC8zdN6J6NwZeC+xCwwQefAEQYeU5OBeFaltvw6LOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:36:33.931857Z"},"content_sha256":"b12477471de3d5e30746c997d649b646095c074d39c482bb895e82f836a96cb5","schema_version":"1.0","event_id":"sha256:b12477471de3d5e30746c997d649b646095c074d39c482bb895e82f836a96cb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2JSSKOLQ452SJ2BVLIBBBVDRZ/bundle.json","state_url":"https://pith.science/pith/O2JSSKOLQ452SJ2BVLIBBBVDRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2JSSKOLQ452SJ2BVLIBBBVDRZ/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-05-21T14:36:33Z","links":{"resolver":"https://pith.science/pith/O2JSSKOLQ452SJ2BVLIBBBVDRZ","bundle":"https://pith.science/pith/O2JSSKOLQ452SJ2BVLIBBBVDRZ/bundle.json","state":"https://pith.science/pith/O2JSSKOLQ452SJ2BVLIBBBVDRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2JSSKOLQ452SJ2BVLIBBBVDRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O2JSSKOLQ452SJ2BVLIBBBVDRZ","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":"6d25ac65c1ff11c3ff5a95eccbd7a5da7a5b996bcd9f52c8605fd420bef89273","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-07T01:53:54Z","title_canon_sha256":"bf2672ac54b1e2986876fa4377da617d6c1f345623b0b7c3baf57b049608dd1d"},"schema_version":"1.0","source":{"id":"1710.02619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02619","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02619v1","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02619","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"pith_short_12","alias_value":"O2JSSKOLQ452","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2JSSKOLQ452SJ2B","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2JSSKOL","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:b12477471de3d5e30746c997d649b646095c074d39c482bb895e82f836a96cb5","target":"graph","created_at":"2026-05-18T00:33:29Z","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"},"paper":{"abstract_excerpt":"Under a Bayesian framework, we formulate the fully sequential sampling and selection decision in statistical ranking and selection as a stochastic control problem, and derive the associated Bellman equation. Using value function approximation, we derive an approximately optimal allocation policy. We show that this policy is not only computationally efficient but also possesses both one-step-ahead and asymptotic optimality for independent normal sampling distributions. Moreover, the proposed allocation policy is easily generalizable in the approximate dynamic programming paradigm.","authors_text":"Chun-Hung Chen, Edwin K. P. Chong, Michael C. Fu, Yijie Peng","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-07T01:53:54Z","title":"Ranking and Selection as Stochastic Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02619","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:80308c8298ffc4a75bd5f74b6527802c55d2ca25ad410def2bc458344634f9ec","target":"record","created_at":"2026-05-18T00:33:29Z","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":"6d25ac65c1ff11c3ff5a95eccbd7a5da7a5b996bcd9f52c8605fd420bef89273","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-07T01:53:54Z","title_canon_sha256":"bf2672ac54b1e2986876fa4377da617d6c1f345623b0b7c3baf57b049608dd1d"},"schema_version":"1.0","source":{"id":"1710.02619","kind":"arxiv","version":1}},"canonical_sha256":"76932929cb873ba92741aad01086a38e4e0c317ea298a0783a45ad1f108b7cfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76932929cb873ba92741aad01086a38e4e0c317ea298a0783a45ad1f108b7cfc","first_computed_at":"2026-05-18T00:33:29.315485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:29.315485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6chwmmgauXI5DPNgZGLP2u33an/CpnQlN9uSJ5F+p/S08y8LAr3KL/1wqBBaKwhu02fTQ/0bOBvQ6j9fmOnsCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:29.315998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80308c8298ffc4a75bd5f74b6527802c55d2ca25ad410def2bc458344634f9ec","sha256:b12477471de3d5e30746c997d649b646095c074d39c482bb895e82f836a96cb5"],"state_sha256":"3e47afa1917dc31247fd9cf87223fee228dac13a682f5054bd6e32a8b69d4c80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s90jrTl+pE7YzOoyy5qXFDlRaY7BeqeImrdtFedduwaoRWToXMUH5Eg6AaQz79UEYetEFogBw586eEkQzhgEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T14:36:33.935179Z","bundle_sha256":"28242524c802dc2f43e7555db6e427a68f41564531771ee0e2fbf48b45fbd31e"}}