{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FGRFFVNEVCVUVMESY5WEJCGAHX","short_pith_number":"pith:FGRFFVNE","canonical_record":{"source":{"id":"1406.6348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-06-24T19:37:56Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"45e0870afd095a45d1f4f1626689781e64f656b3b4502664a8940697dda85fc1","abstract_canon_sha256":"ddea7bd1a2e00cff7fa009775e2f056cd0c228b5faeaf7b41226c6cb8e80965e"},"schema_version":"1.0"},"canonical_sha256":"29a252d5a4a8ab4ab092c76c4488c03dcaf80e30aaff82e3d062cfd3617e081b","source":{"kind":"arxiv","id":"1406.6348","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6348","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6348v2","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6348","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"FGRFFVNEVCVU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FGRFFVNEVCVUVMES","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FGRFFVNE","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FGRFFVNEVCVUVMESY5WEJCGAHX","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-06-24T19:37:56Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"45e0870afd095a45d1f4f1626689781e64f656b3b4502664a8940697dda85fc1","abstract_canon_sha256":"ddea7bd1a2e00cff7fa009775e2f056cd0c228b5faeaf7b41226c6cb8e80965e"},"schema_version":"1.0"},"canonical_sha256":"29a252d5a4a8ab4ab092c76c4488c03dcaf80e30aaff82e3d062cfd3617e081b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:12.943832Z","signature_b64":"+ZO9PHt753Cvvw+a5MczrhwsbtlGF4O7WPhf/shxP73jFE+tz9wN+HrVUqgVenFb0vHKte2KNrHA366RJszyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29a252d5a4a8ab4ab092c76c4488c03dcaf80e30aaff82e3d062cfd3617e081b","last_reissued_at":"2026-05-18T00:38:12.943114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:12.943114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6348","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-18T00:38:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W22uTF+huLAwJgl45aUqyke8M68K/2eWZZd4Gov2/JciewqfBOIBP7r+w79favzV2bSHcr7TvbdM9IJPwWSMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:57:20.167152Z"},"content_sha256":"3d800b9f5627561f701c41c87f70310c7fe4629b4b987c73f8fa1a2859e1fc21","schema_version":"1.0","event_id":"sha256:3d800b9f5627561f701c41c87f70310c7fe4629b4b987c73f8fa1a2859e1fc21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FGRFFVNEVCVUVMESY5WEJCGAHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Emulators for stochastic simulation codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Beno\\^it Pauwels (IFPEN, Grenoble 1 UJF), IMT), Simon Nanty (DER, UPS), Vincent Moutoussamy (EDF R&D","submitted_at":"2014-06-24T19:37:56Z","abstract_excerpt":"Numerical simulation codes are very common tools to study complex phenomena, but they are often time-consuming and considered as black boxes. For some statistical studies (e.g. asset management, sensitivity analysis) or optimization problems (e.g. tuning of a molecular model), a high number of runs of such codes is needed. Therefore it is more convenient to build a fast-running approximation - or metamodel - of this code based on a design of experiments. The topic of this paper is the definition of metamodels for stochastic codes. Contrary to deterministic codes, stochastic codes can give diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6348","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-18T00:38:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JQOiYGV7343iJT8NmPQrCs9BNQnRaRRNHcmzS8hrQyZO0RpPFJMx/rIssVTd4nXSAda3gPkwi9SRWy6fq2DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:57:20.167510Z"},"content_sha256":"78b597ab50cec1f0d5218ccad95566e4f8154d15ab8e550b3f3e677f4e8b8ee0","schema_version":"1.0","event_id":"sha256:78b597ab50cec1f0d5218ccad95566e4f8154d15ab8e550b3f3e677f4e8b8ee0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/bundle.json","state_url":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/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-29T19:57:20Z","links":{"resolver":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX","bundle":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/bundle.json","state":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FGRFFVNEVCVUVMESY5WEJCGAHX","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":"ddea7bd1a2e00cff7fa009775e2f056cd0c228b5faeaf7b41226c6cb8e80965e","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-06-24T19:37:56Z","title_canon_sha256":"45e0870afd095a45d1f4f1626689781e64f656b3b4502664a8940697dda85fc1"},"schema_version":"1.0","source":{"id":"1406.6348","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6348","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6348v2","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6348","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"FGRFFVNEVCVU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FGRFFVNEVCVUVMES","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FGRFFVNE","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:78b597ab50cec1f0d5218ccad95566e4f8154d15ab8e550b3f3e677f4e8b8ee0","target":"graph","created_at":"2026-05-18T00:38:12Z","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":"Numerical simulation codes are very common tools to study complex phenomena, but they are often time-consuming and considered as black boxes. For some statistical studies (e.g. asset management, sensitivity analysis) or optimization problems (e.g. tuning of a molecular model), a high number of runs of such codes is needed. Therefore it is more convenient to build a fast-running approximation - or metamodel - of this code based on a design of experiments. The topic of this paper is the definition of metamodels for stochastic codes. Contrary to deterministic codes, stochastic codes can give diff","authors_text":"Beno\\^it Pauwels (IFPEN, Grenoble 1 UJF), IMT), Simon Nanty (DER, UPS), Vincent Moutoussamy (EDF R&D","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-06-24T19:37:56Z","title":"Emulators for stochastic simulation codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6348","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:3d800b9f5627561f701c41c87f70310c7fe4629b4b987c73f8fa1a2859e1fc21","target":"record","created_at":"2026-05-18T00:38:12Z","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":"ddea7bd1a2e00cff7fa009775e2f056cd0c228b5faeaf7b41226c6cb8e80965e","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-06-24T19:37:56Z","title_canon_sha256":"45e0870afd095a45d1f4f1626689781e64f656b3b4502664a8940697dda85fc1"},"schema_version":"1.0","source":{"id":"1406.6348","kind":"arxiv","version":2}},"canonical_sha256":"29a252d5a4a8ab4ab092c76c4488c03dcaf80e30aaff82e3d062cfd3617e081b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29a252d5a4a8ab4ab092c76c4488c03dcaf80e30aaff82e3d062cfd3617e081b","first_computed_at":"2026-05-18T00:38:12.943114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:12.943114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ZO9PHt753Cvvw+a5MczrhwsbtlGF4O7WPhf/shxP73jFE+tz9wN+HrVUqgVenFb0vHKte2KNrHA366RJszyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:12.943832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6348","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d800b9f5627561f701c41c87f70310c7fe4629b4b987c73f8fa1a2859e1fc21","sha256:78b597ab50cec1f0d5218ccad95566e4f8154d15ab8e550b3f3e677f4e8b8ee0"],"state_sha256":"5d12ab3493a370f8fcbc5f55a0d52519c5673e683c1878e6c69348438180c607"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgOo1v5UhKsxzrL4PW0tqGZj5rVdy+p4oXdexffvyuL1o/C8FBcwBomzT2RVX+YcEJ4hmlM4BxWxO0VipjsRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:57:20.169433Z","bundle_sha256":"32dc61d4042170c66dc97725f441ccbd2073b1ec52f678372c0b389135d3386c"}}