{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PY7XHB4BE7OUAA5F4PZCK22HOE","short_pith_number":"pith:PY7XHB4B","canonical_record":{"source":{"id":"1210.0686","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-10-02T07:49:01Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6d3f69d11a66885d9440ad59a551a2ae0bb5678d0663e0e41545578d5519c1fb","abstract_canon_sha256":"3e2a8cc2c15ef6c3b98e6ab4485dd59249e4b568490e2af8985b41ea2bc758ea"},"schema_version":"1.0"},"canonical_sha256":"7e3f73878127dd4003a5e3f2256b477123cb98e9633312cfddf05d7cdc0b638b","source":{"kind":"arxiv","id":"1210.0686","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0686","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0686v3","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0686","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"PY7XHB4BE7OU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PY7XHB4BE7OUAA5F","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PY7XHB4B","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PY7XHB4BE7OUAA5F4PZCK22HOE","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0686","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-10-02T07:49:01Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6d3f69d11a66885d9440ad59a551a2ae0bb5678d0663e0e41545578d5519c1fb","abstract_canon_sha256":"3e2a8cc2c15ef6c3b98e6ab4485dd59249e4b568490e2af8985b41ea2bc758ea"},"schema_version":"1.0"},"canonical_sha256":"7e3f73878127dd4003a5e3f2256b477123cb98e9633312cfddf05d7cdc0b638b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:46.198037Z","signature_b64":"m6+xM+QNXM6XOGJuYOOFyRbhH93We4Mw/gfq1+K0G4lngcfs2Zvbeetzs9oZpO3Hu1rMwSq7qk8ahlsf0eeKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e3f73878127dd4003a5e3f2256b477123cb98e9633312cfddf05d7cdc0b638b","last_reissued_at":"2026-05-18T03:36:46.197254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:46.197254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0686","source_version":3,"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-18T03:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3+3btBHf2jYhJqHD21LtK7jsVNOCc0rrF89UwNJqovEYbHgYO61OlYurgqX+J4OQyKlB7w9aAhmbjSm3cWRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:01:48.023329Z"},"content_sha256":"34d8038c20bd35f99d77d795d4409605bdf8698e41aacd393bde131a1d41f573","schema_version":"1.0","event_id":"sha256:34d8038c20bd35f99d77d795d4409605bdf8698e41aacd393bde131a1d41f573"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PY7XHB4BE7OUAA5F4PZCK22HOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive co-kriging model for Design of Computer experiments with multiple levels of fidelity with an application to hydrodynamic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Loic Le Gratiet (LPMA, - M\\'ethodes d'Analyse Stochastique des Codes et Traitements Num\\'eriques)","submitted_at":"2012-10-02T07:49:01Z","abstract_excerpt":"In many practical cases, a sensitivity analysis or an optimization of a complex time consuming computer code requires to build a fast running approximation of it - also called surrogate model. We consider in this paper the problem of building a surrogate model of a complex computer code which can be run at different levels of accuracy. The co-kriging based surrogate model is a promising tool to build such an approximation. The idea is to improve the surrogate model by using fast and less accurate versions of the code. We present here a new approach to perform a multi-fidelity co-kriging model "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0686","kind":"arxiv","version":3},"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-18T03:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrMOJoKvCI49KK0Iyt89x/VTuMwXyyTssXPS464IuDSUKjKwbyWo4lroVApwidPFiF/GHS/wN4bnGm9y4XeEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:01:48.023801Z"},"content_sha256":"bcc2fdd38bc94d6cd0ecd377a048d94f6e0770ddb37f9d99eb53f50e5679d2f1","schema_version":"1.0","event_id":"sha256:bcc2fdd38bc94d6cd0ecd377a048d94f6e0770ddb37f9d99eb53f50e5679d2f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/bundle.json","state_url":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/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-05-28T23:01:48Z","links":{"resolver":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE","bundle":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/bundle.json","state":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PY7XHB4BE7OUAA5F4PZCK22HOE","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":"3e2a8cc2c15ef6c3b98e6ab4485dd59249e4b568490e2af8985b41ea2bc758ea","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-10-02T07:49:01Z","title_canon_sha256":"6d3f69d11a66885d9440ad59a551a2ae0bb5678d0663e0e41545578d5519c1fb"},"schema_version":"1.0","source":{"id":"1210.0686","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0686","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0686v3","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0686","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"PY7XHB4BE7OU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PY7XHB4BE7OUAA5F","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PY7XHB4B","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:bcc2fdd38bc94d6cd0ecd377a048d94f6e0770ddb37f9d99eb53f50e5679d2f1","target":"graph","created_at":"2026-05-18T03:36:46Z","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":"In many practical cases, a sensitivity analysis or an optimization of a complex time consuming computer code requires to build a fast running approximation of it - also called surrogate model. We consider in this paper the problem of building a surrogate model of a complex computer code which can be run at different levels of accuracy. The co-kriging based surrogate model is a promising tool to build such an approximation. The idea is to improve the surrogate model by using fast and less accurate versions of the code. We present here a new approach to perform a multi-fidelity co-kriging model ","authors_text":"Loic Le Gratiet (LPMA, - M\\'ethodes d'Analyse Stochastique des Codes et Traitements Num\\'eriques)","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-10-02T07:49:01Z","title":"Recursive co-kriging model for Design of Computer experiments with multiple levels of fidelity with an application to hydrodynamic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0686","kind":"arxiv","version":3},"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:34d8038c20bd35f99d77d795d4409605bdf8698e41aacd393bde131a1d41f573","target":"record","created_at":"2026-05-18T03:36:46Z","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":"3e2a8cc2c15ef6c3b98e6ab4485dd59249e4b568490e2af8985b41ea2bc758ea","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-10-02T07:49:01Z","title_canon_sha256":"6d3f69d11a66885d9440ad59a551a2ae0bb5678d0663e0e41545578d5519c1fb"},"schema_version":"1.0","source":{"id":"1210.0686","kind":"arxiv","version":3}},"canonical_sha256":"7e3f73878127dd4003a5e3f2256b477123cb98e9633312cfddf05d7cdc0b638b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e3f73878127dd4003a5e3f2256b477123cb98e9633312cfddf05d7cdc0b638b","first_computed_at":"2026-05-18T03:36:46.197254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:46.197254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m6+xM+QNXM6XOGJuYOOFyRbhH93We4Mw/gfq1+K0G4lngcfs2Zvbeetzs9oZpO3Hu1rMwSq7qk8ahlsf0eeKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:46.198037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0686","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34d8038c20bd35f99d77d795d4409605bdf8698e41aacd393bde131a1d41f573","sha256:bcc2fdd38bc94d6cd0ecd377a048d94f6e0770ddb37f9d99eb53f50e5679d2f1"],"state_sha256":"a66c6336a001884000c6138a9baff7587bd38f012a77eeea13e199d717457ef5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XRAGgdueciHogzMzjLS4F63BBOvMsq3eSJpaVnyFGmfmB9zk4w+6lVQZxf139swYCxj4giTsH1j2oVG7lNQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:01:48.026073Z","bundle_sha256":"13aaea9557a182963fe5bd80878159fd187ebf84fd7e6c7a9f48c61a7bde8e4f"}}