{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7QU3II2VNG3YEK4URLQTWNOT2X","short_pith_number":"pith:7QU3II2V","canonical_record":{"source":{"id":"1112.5389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-22T17:08:15Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4b7c90c9e1de25be56a0d34add73d3d69d8127786f81a6fc9c99655583d466f9","abstract_canon_sha256":"930b5ad0e6a5d0206f501ded61280d641026250a70bf1456fe49bdd75c40b271"},"schema_version":"1.0"},"canonical_sha256":"fc29b4235569b7822b948ae13b35d3d5d1dd17b7cbe1bc78b6023f1f6cdc350d","source":{"kind":"arxiv","id":"1112.5389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5389","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5389v2","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5389","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"7QU3II2VNG3Y","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7QU3II2VNG3YEK4U","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7QU3II2V","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7QU3II2VNG3YEK4URLQTWNOT2X","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-22T17:08:15Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4b7c90c9e1de25be56a0d34add73d3d69d8127786f81a6fc9c99655583d466f9","abstract_canon_sha256":"930b5ad0e6a5d0206f501ded61280d641026250a70bf1456fe49bdd75c40b271"},"schema_version":"1.0"},"canonical_sha256":"fc29b4235569b7822b948ae13b35d3d5d1dd17b7cbe1bc78b6023f1f6cdc350d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:00.833614Z","signature_b64":"6U8F2v17NlkBjPCY6rLsTcDrUScAwkySSUWmilZcz8Aano+8Xozayh8/19D2IhFJkF9rt62epYzstPEe/DF5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc29b4235569b7822b948ae13b35d3d5d1dd17b7cbe1bc78b6023f1f6cdc350d","last_reissued_at":"2026-05-18T03:45:00.832935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:00.832935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5389","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-18T03:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6iO5hVnVVzfDX7YYxVzzWn1Fn1Fe6E6L1oQEMryUrPjPnnd0A3HlRH8yIaTpSzWnbBPseMJhzGjRROKbdN6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:37.860234Z"},"content_sha256":"c7b69de074fdc4ca1a363e7fed33f7775ae4080c8e1aa45fa192d1720c93c7df","schema_version":"1.0","event_id":"sha256:c7b69de074fdc4ca1a363e7fed33f7775ae4080c8e1aa45fa192d1720c93c7df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7QU3II2VNG3YEK4URLQTWNOT2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian analysis of hierarchical multi-fidelity codes","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":"2011-12-22T17:08:15Z","abstract_excerpt":"This paper deals with the Gaussian process based approximation of a code which can be run at different levels of accuracy. This method, which is a particular case of co-kriging, allows us to improve a surrogate model of a complex computer code using fast approximations of it. In particular, we focus on the case of a large number of code levels on the one hand and on a Bayesian approach when we have two levels on the other hand. The main results of this paper are a new approach to estimate the model parameters which provides a closed form expression for an important parameter of the model (the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5389","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-18T03:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlJpRSRcgJoP7shFIY1u/u7KGxzjgwLWPltv2j53td60Ym6q83JFXJDhGYzqNsGPX5HxQXhW1AXkvJ6AydjiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:37.860616Z"},"content_sha256":"fd5917e96096d232d2194ac80b923d3e00fe17ea0a9213c3e896975b442fd78b","schema_version":"1.0","event_id":"sha256:fd5917e96096d232d2194ac80b923d3e00fe17ea0a9213c3e896975b442fd78b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QU3II2VNG3YEK4URLQTWNOT2X/bundle.json","state_url":"https://pith.science/pith/7QU3II2VNG3YEK4URLQTWNOT2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QU3II2VNG3YEK4URLQTWNOT2X/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-30T05:19:37Z","links":{"resolver":"https://pith.science/pith/7QU3II2VNG3YEK4URLQTWNOT2X","bundle":"https://pith.science/pith/7QU3II2VNG3YEK4URLQTWNOT2X/bundle.json","state":"https://pith.science/pith/7QU3II2VNG3YEK4URLQTWNOT2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QU3II2VNG3YEK4URLQTWNOT2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7QU3II2VNG3YEK4URLQTWNOT2X","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":"930b5ad0e6a5d0206f501ded61280d641026250a70bf1456fe49bdd75c40b271","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-22T17:08:15Z","title_canon_sha256":"4b7c90c9e1de25be56a0d34add73d3d69d8127786f81a6fc9c99655583d466f9"},"schema_version":"1.0","source":{"id":"1112.5389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5389","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5389v2","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5389","created_at":"2026-05-18T03:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"7QU3II2VNG3Y","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7QU3II2VNG3YEK4U","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7QU3II2V","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:fd5917e96096d232d2194ac80b923d3e00fe17ea0a9213c3e896975b442fd78b","target":"graph","created_at":"2026-05-18T03:45:00Z","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":"This paper deals with the Gaussian process based approximation of a code which can be run at different levels of accuracy. This method, which is a particular case of co-kriging, allows us to improve a surrogate model of a complex computer code using fast approximations of it. In particular, we focus on the case of a large number of code levels on the one hand and on a Bayesian approach when we have two levels on the other hand. The main results of this paper are a new approach to estimate the model parameters which provides a closed form expression for an important parameter of the model (the ","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":"2011-12-22T17:08:15Z","title":"Bayesian analysis of hierarchical multi-fidelity codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5389","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:c7b69de074fdc4ca1a363e7fed33f7775ae4080c8e1aa45fa192d1720c93c7df","target":"record","created_at":"2026-05-18T03:45:00Z","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":"930b5ad0e6a5d0206f501ded61280d641026250a70bf1456fe49bdd75c40b271","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-22T17:08:15Z","title_canon_sha256":"4b7c90c9e1de25be56a0d34add73d3d69d8127786f81a6fc9c99655583d466f9"},"schema_version":"1.0","source":{"id":"1112.5389","kind":"arxiv","version":2}},"canonical_sha256":"fc29b4235569b7822b948ae13b35d3d5d1dd17b7cbe1bc78b6023f1f6cdc350d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc29b4235569b7822b948ae13b35d3d5d1dd17b7cbe1bc78b6023f1f6cdc350d","first_computed_at":"2026-05-18T03:45:00.832935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:00.832935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6U8F2v17NlkBjPCY6rLsTcDrUScAwkySSUWmilZcz8Aano+8Xozayh8/19D2IhFJkF9rt62epYzstPEe/DF5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:00.833614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7b69de074fdc4ca1a363e7fed33f7775ae4080c8e1aa45fa192d1720c93c7df","sha256:fd5917e96096d232d2194ac80b923d3e00fe17ea0a9213c3e896975b442fd78b"],"state_sha256":"f7e6b852ca27330c93d03bc795d9be10bb18e440fa5f7defe4944895b90c9d1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hl3FfEhazp+Riq51mWjYLGlanmB6ga3TAq3BFGZvkZXGdfF257YKWOx6ggJcwUU18C/cylFLvRah2m8P3ly7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:19:37.862539Z","bundle_sha256":"bd24307e6d00ac88bdf238aec6cfe3cc6544fd59303362aa72a658ac13148938"}}