{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PY7XHB4BE7OUAA5F4PZCK22HOE","short_pith_number":"pith:PY7XHB4B","schema_version":"1.0","canonical_sha256":"7e3f73878127dd4003a5e3f2256b477123cb98e9633312cfddf05d7cdc0b638b","source":{"kind":"arxiv","id":"1210.0686","version":3},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.0686","created_at":"2026-05-18T03:36:46.197389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0686v3","created_at":"2026-05-18T03:36:46.197389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0686","created_at":"2026-05-18T03:36:46.197389+00:00"},{"alias_kind":"pith_short_12","alias_value":"PY7XHB4BE7OU","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PY7XHB4BE7OUAA5F","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PY7XHB4B","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.00865","citing_title":"Constrained Bayesian Optimisation with Multiple Information Sources","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE","json":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE.json","graph_json":"https://pith.science/api/pith-number/PY7XHB4BE7OUAA5F4PZCK22HOE/graph.json","events_json":"https://pith.science/api/pith-number/PY7XHB4BE7OUAA5F4PZCK22HOE/events.json","paper":"https://pith.science/paper/PY7XHB4B"},"agent_actions":{"view_html":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE","download_json":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE.json","view_paper":"https://pith.science/paper/PY7XHB4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0686&json=true","fetch_graph":"https://pith.science/api/pith-number/PY7XHB4BE7OUAA5F4PZCK22HOE/graph.json","fetch_events":"https://pith.science/api/pith-number/PY7XHB4BE7OUAA5F4PZCK22HOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/action/storage_attestation","attest_author":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/action/author_attestation","sign_citation":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/action/citation_signature","submit_replication":"https://pith.science/pith/PY7XHB4BE7OUAA5F4PZCK22HOE/action/replication_record"}},"created_at":"2026-05-18T03:36:46.197389+00:00","updated_at":"2026-05-18T03:36:46.197389+00:00"}