{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DINWTG3JFZQVBOS3KE6FMOJHCL","short_pith_number":"pith:DINWTG3J","canonical_record":{"source":{"id":"1710.03206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T17:38:04Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"61a41300c973bcdf731754326b8bd3770a160f74284ed29d8155283d057df933","abstract_canon_sha256":"6999199215db1f89c08b14dcb5744bfaceff986b65f55b1d5dca5e95e7061c34"},"schema_version":"1.0"},"canonical_sha256":"1a1b699b692e6150ba5b513c56392712d89f771921000479d927c5f6a3b505e5","source":{"kind":"arxiv","id":"1710.03206","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03206","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03206v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03206","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"DINWTG3JFZQV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DINWTG3JFZQVBOS3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DINWTG3J","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DINWTG3JFZQVBOS3KE6FMOJHCL","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T17:38:04Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"61a41300c973bcdf731754326b8bd3770a160f74284ed29d8155283d057df933","abstract_canon_sha256":"6999199215db1f89c08b14dcb5744bfaceff986b65f55b1d5dca5e95e7061c34"},"schema_version":"1.0"},"canonical_sha256":"1a1b699b692e6150ba5b513c56392712d89f771921000479d927c5f6a3b505e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.668981Z","signature_b64":"Dn/jjmlBDTHtHjQUplPa1s2TdQgx08vRYfidUGgR4MB7XEAs5e0EgmoNSZxDIiR5V0opyWX6hdH8jQrhE3XSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a1b699b692e6150ba5b513c56392712d89f771921000479d927c5f6a3b505e5","last_reissued_at":"2026-05-17T23:55:34.668286Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.668286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03206","source_version":2,"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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmGG0DhbtZ0LQfVOzdZR2Elq19qd0FI/u5ASW4I/wDM6KAzbWyViZlp0oIqb6WLft4ucYOYD9MfNGNsIbOYLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:00:56.902841Z"},"content_sha256":"0006839004ead7a9b3440a46931059d6d45809eb768245916f56970fdaa3532d","schema_version":"1.0","event_id":"sha256:0006839004ead7a9b3440a46931059d6d45809eb768245916f56970fdaa3532d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DINWTG3JFZQVBOS3KE6FMOJHCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Replication or exploration? Sequential design for stochastic simulation experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Jiangeng Huang, Mickael Binois, Mike Ludkovski, Robert B Gramacy","submitted_at":"2017-10-09T17:38:04Z","abstract_excerpt":"We investigate the merits of replication, and provide methods for optimal design (including replicates), with the goal of obtaining globally accurate emulation of noisy computer simulation experiments. We first show that replication can be beneficial from both design and computational perspectives, in the context of Gaussian process surrogate modeling. We then develop a lookahead based sequential design scheme that can determine if a new run should be at an existing input location (i.e., replicate) or at a new one (explore). When paired with a newly developed heteroskedastic Gaussian process m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03206","kind":"arxiv","version":2},"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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYuB5N0Jw7tFxg2EahHJTrOj8LSoyoghWnXYjrsPnooIRdzIkaEXaNy8pTI8nD4tH5gmICyXBSPGMNIf9ujrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:00:56.903190Z"},"content_sha256":"fb154cc4100c3f422a9c2b36cf881d50aa7c91e6d88483fd403ad15d9eacbcae","schema_version":"1.0","event_id":"sha256:fb154cc4100c3f422a9c2b36cf881d50aa7c91e6d88483fd403ad15d9eacbcae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DINWTG3JFZQVBOS3KE6FMOJHCL/bundle.json","state_url":"https://pith.science/pith/DINWTG3JFZQVBOS3KE6FMOJHCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DINWTG3JFZQVBOS3KE6FMOJHCL/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-22T16:00:56Z","links":{"resolver":"https://pith.science/pith/DINWTG3JFZQVBOS3KE6FMOJHCL","bundle":"https://pith.science/pith/DINWTG3JFZQVBOS3KE6FMOJHCL/bundle.json","state":"https://pith.science/pith/DINWTG3JFZQVBOS3KE6FMOJHCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DINWTG3JFZQVBOS3KE6FMOJHCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DINWTG3JFZQVBOS3KE6FMOJHCL","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":"6999199215db1f89c08b14dcb5744bfaceff986b65f55b1d5dca5e95e7061c34","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T17:38:04Z","title_canon_sha256":"61a41300c973bcdf731754326b8bd3770a160f74284ed29d8155283d057df933"},"schema_version":"1.0","source":{"id":"1710.03206","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03206","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03206v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03206","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"DINWTG3JFZQV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DINWTG3JFZQVBOS3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DINWTG3J","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:fb154cc4100c3f422a9c2b36cf881d50aa7c91e6d88483fd403ad15d9eacbcae","target":"graph","created_at":"2026-05-17T23:55:34Z","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":"We investigate the merits of replication, and provide methods for optimal design (including replicates), with the goal of obtaining globally accurate emulation of noisy computer simulation experiments. We first show that replication can be beneficial from both design and computational perspectives, in the context of Gaussian process surrogate modeling. We then develop a lookahead based sequential design scheme that can determine if a new run should be at an existing input location (i.e., replicate) or at a new one (explore). When paired with a newly developed heteroskedastic Gaussian process m","authors_text":"Jiangeng Huang, Mickael Binois, Mike Ludkovski, Robert B Gramacy","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T17:38:04Z","title":"Replication or exploration? Sequential design for stochastic simulation experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03206","kind":"arxiv","version":2},"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:0006839004ead7a9b3440a46931059d6d45809eb768245916f56970fdaa3532d","target":"record","created_at":"2026-05-17T23:55:34Z","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":"6999199215db1f89c08b14dcb5744bfaceff986b65f55b1d5dca5e95e7061c34","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T17:38:04Z","title_canon_sha256":"61a41300c973bcdf731754326b8bd3770a160f74284ed29d8155283d057df933"},"schema_version":"1.0","source":{"id":"1710.03206","kind":"arxiv","version":2}},"canonical_sha256":"1a1b699b692e6150ba5b513c56392712d89f771921000479d927c5f6a3b505e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a1b699b692e6150ba5b513c56392712d89f771921000479d927c5f6a3b505e5","first_computed_at":"2026-05-17T23:55:34.668286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:34.668286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dn/jjmlBDTHtHjQUplPa1s2TdQgx08vRYfidUGgR4MB7XEAs5e0EgmoNSZxDIiR5V0opyWX6hdH8jQrhE3XSCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:34.668981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03206","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0006839004ead7a9b3440a46931059d6d45809eb768245916f56970fdaa3532d","sha256:fb154cc4100c3f422a9c2b36cf881d50aa7c91e6d88483fd403ad15d9eacbcae"],"state_sha256":"3c836b728fecacd2fe1f3d455bdee7e6a3d51225b5b5fdf77431f8b54b5a2e9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNI9fe13cdPsBUQzjDdt++Qf10r4gCsF4UNMcM+tSCyck4y4zL3D6l66tC9UiKnNU7hGi9HU2P2yNR/7xIojDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:00:56.905137Z","bundle_sha256":"d9a3cd7b15c77e20a720ffe9c450f80c2f70e09b0cf8af199a37894c08aeb795"}}