{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NZAH2XGH2D6W3YRXFSTWVQNUA4","short_pith_number":"pith:NZAH2XGH","canonical_record":{"source":{"id":"1904.10639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-24T04:41:40Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"1b2b60d28bec455ac85ae3385245cd043a039c2bc99d60783e5d0c62c64ced56","abstract_canon_sha256":"4bcccef0c8a45ca704cd5f1c46c8170d1006f7ff128e099e3bcac1204a518956"},"schema_version":"1.0"},"canonical_sha256":"6e407d5cc7d0fd6de2372ca76ac1b4073f4a7b84bde68c22de01e91d363d8c43","source":{"kind":"arxiv","id":"1904.10639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10639","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10639v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10639","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"NZAH2XGH2D6W","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NZAH2XGH2D6W3YRX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NZAH2XGH","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NZAH2XGH2D6W3YRXFSTWVQNUA4","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-24T04:41:40Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"1b2b60d28bec455ac85ae3385245cd043a039c2bc99d60783e5d0c62c64ced56","abstract_canon_sha256":"4bcccef0c8a45ca704cd5f1c46c8170d1006f7ff128e099e3bcac1204a518956"},"schema_version":"1.0"},"canonical_sha256":"6e407d5cc7d0fd6de2372ca76ac1b4073f4a7b84bde68c22de01e91d363d8c43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:53.164263Z","signature_b64":"lS1+iV6QdcKsYQQk1jkabjtgm4iiPHQYM49ovWkz1YC9OajfkMQfCAzt5b+M6wuKn1w5AbAFqjOtL4XzZRJdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e407d5cc7d0fd6de2372ca76ac1b4073f4a7b84bde68c22de01e91d363d8c43","last_reissued_at":"2026-05-17T23:47:53.163843Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:53.163843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10639","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:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tm5p84JNwNGfh1u/JilYl5NXA8vYkvIl3t2yCSFazrcsIWtsAaJ+ooxbP3KQCrAV++gjt8MDlsxjnx1U2+m8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:37:09.883944Z"},"content_sha256":"ee338c2ee91e815fa7785d197774a469885db6686f3e6c4d16c7dd5790360eab","schema_version":"1.0","event_id":"sha256:ee338c2ee91e815fa7785d197774a469885db6686f3e6c4d16c7dd5790360eab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NZAH2XGH2D6W3YRXFSTWVQNUA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Simulation Budget Allocation for Subset Selection Using Regression Metamodels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"math.OC","authors_text":"Fei Gao, Hui Xiao, Siyang Gao, Zhongshun Shi","submitted_at":"2019-04-24T04:41:40Z","abstract_excerpt":"This research considers the ranking and selection (R&S) problem of selecting the optimal subset from a finite set of alternative designs. Given the total simulation budget constraint, we aim to maximize the probability of correctly selecting the top-m designs. In order to improve the selection efficiency, we incorporate the information from across the domain into regression metamodels. In this research, we assume that the mean performance of each design is approximately quadratic. To achieve a better fit of this model, we divide the solution space into adjacent partitions such that the quadrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10639","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:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7kuWa8nb8mtQuqLdx53Tcx2vQdxUxzBiabZL4LlxWNMWZ8QdbRgxlQxoyIfFJQEYum4FjYeayolig07yj14Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:37:09.884684Z"},"content_sha256":"5802feb6458c765c764c295b31ac0e8c97687a288513a2364880a8ebd8767164","schema_version":"1.0","event_id":"sha256:5802feb6458c765c764c295b31ac0e8c97687a288513a2364880a8ebd8767164"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZAH2XGH2D6W3YRXFSTWVQNUA4/bundle.json","state_url":"https://pith.science/pith/NZAH2XGH2D6W3YRXFSTWVQNUA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZAH2XGH2D6W3YRXFSTWVQNUA4/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-10T23:37:09Z","links":{"resolver":"https://pith.science/pith/NZAH2XGH2D6W3YRXFSTWVQNUA4","bundle":"https://pith.science/pith/NZAH2XGH2D6W3YRXFSTWVQNUA4/bundle.json","state":"https://pith.science/pith/NZAH2XGH2D6W3YRXFSTWVQNUA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZAH2XGH2D6W3YRXFSTWVQNUA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NZAH2XGH2D6W3YRXFSTWVQNUA4","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":"4bcccef0c8a45ca704cd5f1c46c8170d1006f7ff128e099e3bcac1204a518956","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-24T04:41:40Z","title_canon_sha256":"1b2b60d28bec455ac85ae3385245cd043a039c2bc99d60783e5d0c62c64ced56"},"schema_version":"1.0","source":{"id":"1904.10639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10639","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10639v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10639","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"NZAH2XGH2D6W","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NZAH2XGH2D6W3YRX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NZAH2XGH","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:5802feb6458c765c764c295b31ac0e8c97687a288513a2364880a8ebd8767164","target":"graph","created_at":"2026-05-17T23:47:53Z","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":"This research considers the ranking and selection (R&S) problem of selecting the optimal subset from a finite set of alternative designs. Given the total simulation budget constraint, we aim to maximize the probability of correctly selecting the top-m designs. In order to improve the selection efficiency, we incorporate the information from across the domain into regression metamodels. In this research, we assume that the mean performance of each design is approximately quadratic. To achieve a better fit of this model, we divide the solution space into adjacent partitions such that the quadrat","authors_text":"Fei Gao, Hui Xiao, Siyang Gao, Zhongshun Shi","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-24T04:41:40Z","title":"Efficient Simulation Budget Allocation for Subset Selection Using Regression Metamodels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10639","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:ee338c2ee91e815fa7785d197774a469885db6686f3e6c4d16c7dd5790360eab","target":"record","created_at":"2026-05-17T23:47:53Z","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":"4bcccef0c8a45ca704cd5f1c46c8170d1006f7ff128e099e3bcac1204a518956","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-24T04:41:40Z","title_canon_sha256":"1b2b60d28bec455ac85ae3385245cd043a039c2bc99d60783e5d0c62c64ced56"},"schema_version":"1.0","source":{"id":"1904.10639","kind":"arxiv","version":1}},"canonical_sha256":"6e407d5cc7d0fd6de2372ca76ac1b4073f4a7b84bde68c22de01e91d363d8c43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e407d5cc7d0fd6de2372ca76ac1b4073f4a7b84bde68c22de01e91d363d8c43","first_computed_at":"2026-05-17T23:47:53.163843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:53.163843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lS1+iV6QdcKsYQQk1jkabjtgm4iiPHQYM49ovWkz1YC9OajfkMQfCAzt5b+M6wuKn1w5AbAFqjOtL4XzZRJdCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:53.164263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee338c2ee91e815fa7785d197774a469885db6686f3e6c4d16c7dd5790360eab","sha256:5802feb6458c765c764c295b31ac0e8c97687a288513a2364880a8ebd8767164"],"state_sha256":"a76e111a643aa656afacb83cec5096f94c18d7a6a93b359b6115052476e63df4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwL5Cl1uDUs1qc16+Q/4oMQMWYlw/6FiqjEGP9Aym7Zf41JaY1ssVS/sJz95O6LEeuAOzeOGa4kirVl0Aa8UBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:37:09.888673Z","bundle_sha256":"15bd9be7469b9de01366a1d5368e75512ec063a8ff01bcc6c8f4891514c5fc58"}}