{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FGRFFVNEVCVUVMESY5WEJCGAHX","short_pith_number":"pith:FGRFFVNE","schema_version":"1.0","canonical_sha256":"29a252d5a4a8ab4ab092c76c4488c03dcaf80e30aaff82e3d062cfd3617e081b","source":{"kind":"arxiv","id":"1406.6348","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.6348","created_at":"2026-05-18T00:38:12.943246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6348v2","created_at":"2026-05-18T00:38:12.943246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6348","created_at":"2026-05-18T00:38:12.943246+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGRFFVNEVCVU","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGRFFVNEVCVUVMES","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGRFFVNE","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX","json":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX.json","graph_json":"https://pith.science/api/pith-number/FGRFFVNEVCVUVMESY5WEJCGAHX/graph.json","events_json":"https://pith.science/api/pith-number/FGRFFVNEVCVUVMESY5WEJCGAHX/events.json","paper":"https://pith.science/paper/FGRFFVNE"},"agent_actions":{"view_html":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX","download_json":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX.json","view_paper":"https://pith.science/paper/FGRFFVNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6348&json=true","fetch_graph":"https://pith.science/api/pith-number/FGRFFVNEVCVUVMESY5WEJCGAHX/graph.json","fetch_events":"https://pith.science/api/pith-number/FGRFFVNEVCVUVMESY5WEJCGAHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/action/storage_attestation","attest_author":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/action/author_attestation","sign_citation":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/action/citation_signature","submit_replication":"https://pith.science/pith/FGRFFVNEVCVUVMESY5WEJCGAHX/action/replication_record"}},"created_at":"2026-05-18T00:38:12.943246+00:00","updated_at":"2026-05-18T00:38:12.943246+00:00"}