{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SDX6BKCUFUI43UWKGBVS7GCKG5","short_pith_number":"pith:SDX6BKCU","canonical_record":{"source":{"id":"1903.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-03-14T06:24:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a531b172dff48ecf9df01955f43b35fea678ccd6fbc071db8ebef9aa3db28d2d","abstract_canon_sha256":"9674f3e69bb0c6eadf09ed791905c95b0f9e0f31eadb90ee6ab3929c8ca45092"},"schema_version":"1.0"},"canonical_sha256":"90efe0a8542d11cdd2ca306b2f984a377077e6c4e650b7c999f1924325ef1705","source":{"kind":"arxiv","id":"1903.05828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05828","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05828v1","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05828","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"SDX6BKCUFUI4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SDX6BKCUFUI43UWK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SDX6BKCU","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SDX6BKCUFUI43UWKGBVS7GCKG5","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-03-14T06:24:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a531b172dff48ecf9df01955f43b35fea678ccd6fbc071db8ebef9aa3db28d2d","abstract_canon_sha256":"9674f3e69bb0c6eadf09ed791905c95b0f9e0f31eadb90ee6ab3929c8ca45092"},"schema_version":"1.0"},"canonical_sha256":"90efe0a8542d11cdd2ca306b2f984a377077e6c4e650b7c999f1924325ef1705","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:16.051785Z","signature_b64":"1S7HJNJHhz+14iPk1GeYGoZ0LkiP3gy51VwY3yYxwsHXtFwhJwr/IjA+ZJfUPvIiCnscsjarW3Wb+InG9Zj8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90efe0a8542d11cdd2ca306b2f984a377077e6c4e650b7c999f1924325ef1705","last_reissued_at":"2026-05-17T23:51:16.051340Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:16.051340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05828","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-17T23:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwKA5MVGO/2L+eY0QQTnZg9GU0ltsETam/SBw4GdDR8SUqtNHTk6Q4a7ziCAIVhjScsCeIqSm2xIjMsRpaYADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:46:24.749228Z"},"content_sha256":"a6c38425c9017b0d7ae96165ffba6c328ecc2c9bf55499f0dcc50794aec601b8","schema_version":"1.0","event_id":"sha256:a6c38425c9017b0d7ae96165ffba6c328ecc2c9bf55499f0dcc50794aec601b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SDX6BKCUFUI43UWKGBVS7GCKG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributionally Robust Selection of the Best","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ME","authors_text":"L. Jeff Hong, Weiwei Fan, Xiaowei Zhang","submitted_at":"2019-03-14T06:24:09Z","abstract_excerpt":"Specifying a proper input distribution is often a challenging task in simulation modeling. In practice, there may be multiple plausible distributions that can fit the input data reasonably well, especially when the data volume is not large. In this paper, we consider the problem of selecting the best from a finite set of simulated alternatives, in the presence of such input uncertainty. We model such uncertainty by an ambiguity set consisting of a finite number of plausible input distributions, and aim to select the alternative with the best worst-case mean performance over the ambiguity set. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05828","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-17T23:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLbcG8gwcJn6lSeiSrRLRiAYhsp7Gq5R7xO88RW1q7Oaw6JUlYacs+9md67gbFl9iWcxZBeZgo84GhC6Be5FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:46:24.749957Z"},"content_sha256":"7fe629cadf141fbbd59a6dcaeb80bae2a1bac11eed74b0eca9426c3cd45b8ebe","schema_version":"1.0","event_id":"sha256:7fe629cadf141fbbd59a6dcaeb80bae2a1bac11eed74b0eca9426c3cd45b8ebe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDX6BKCUFUI43UWKGBVS7GCKG5/bundle.json","state_url":"https://pith.science/pith/SDX6BKCUFUI43UWKGBVS7GCKG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDX6BKCUFUI43UWKGBVS7GCKG5/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-06-08T16:46:24Z","links":{"resolver":"https://pith.science/pith/SDX6BKCUFUI43UWKGBVS7GCKG5","bundle":"https://pith.science/pith/SDX6BKCUFUI43UWKGBVS7GCKG5/bundle.json","state":"https://pith.science/pith/SDX6BKCUFUI43UWKGBVS7GCKG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDX6BKCUFUI43UWKGBVS7GCKG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SDX6BKCUFUI43UWKGBVS7GCKG5","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":"9674f3e69bb0c6eadf09ed791905c95b0f9e0f31eadb90ee6ab3929c8ca45092","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-03-14T06:24:09Z","title_canon_sha256":"a531b172dff48ecf9df01955f43b35fea678ccd6fbc071db8ebef9aa3db28d2d"},"schema_version":"1.0","source":{"id":"1903.05828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05828","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05828v1","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05828","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"SDX6BKCUFUI4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SDX6BKCUFUI43UWK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SDX6BKCU","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:7fe629cadf141fbbd59a6dcaeb80bae2a1bac11eed74b0eca9426c3cd45b8ebe","target":"graph","created_at":"2026-05-17T23:51:16Z","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":"Specifying a proper input distribution is often a challenging task in simulation modeling. In practice, there may be multiple plausible distributions that can fit the input data reasonably well, especially when the data volume is not large. In this paper, we consider the problem of selecting the best from a finite set of simulated alternatives, in the presence of such input uncertainty. We model such uncertainty by an ambiguity set consisting of a finite number of plausible input distributions, and aim to select the alternative with the best worst-case mean performance over the ambiguity set. ","authors_text":"L. Jeff Hong, Weiwei Fan, Xiaowei Zhang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-03-14T06:24:09Z","title":"Distributionally Robust Selection of the Best"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05828","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:a6c38425c9017b0d7ae96165ffba6c328ecc2c9bf55499f0dcc50794aec601b8","target":"record","created_at":"2026-05-17T23:51:16Z","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":"9674f3e69bb0c6eadf09ed791905c95b0f9e0f31eadb90ee6ab3929c8ca45092","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-03-14T06:24:09Z","title_canon_sha256":"a531b172dff48ecf9df01955f43b35fea678ccd6fbc071db8ebef9aa3db28d2d"},"schema_version":"1.0","source":{"id":"1903.05828","kind":"arxiv","version":1}},"canonical_sha256":"90efe0a8542d11cdd2ca306b2f984a377077e6c4e650b7c999f1924325ef1705","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90efe0a8542d11cdd2ca306b2f984a377077e6c4e650b7c999f1924325ef1705","first_computed_at":"2026-05-17T23:51:16.051340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:16.051340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1S7HJNJHhz+14iPk1GeYGoZ0LkiP3gy51VwY3yYxwsHXtFwhJwr/IjA+ZJfUPvIiCnscsjarW3Wb+InG9Zj8Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:16.051785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6c38425c9017b0d7ae96165ffba6c328ecc2c9bf55499f0dcc50794aec601b8","sha256:7fe629cadf141fbbd59a6dcaeb80bae2a1bac11eed74b0eca9426c3cd45b8ebe"],"state_sha256":"a759a2d57cc7da729908d9049d6793acda42581399818635b4122188ee6169db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4pnXvmyBcMd5Nj4FPDV+4oEwycvfi5L7rhHdrMZYfY1BMqSlefTlYms/J3xu3JdWrWWaRa61L4fOwXn1wFRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:46:24.754058Z","bundle_sha256":"c00bd18f2b185c42cd2477271f26aa596b271b3150da3686b50d8e9ffea915dc"}}