{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KTGFTZA2DPEY6AKLY46UMVHMWB","short_pith_number":"pith:KTGFTZA2","schema_version":"1.0","canonical_sha256":"54cc59e41a1bc98f014bc73d4654ecb041f4c9070db8fe563e806889ff96518c","source":{"kind":"arxiv","id":"2511.20183","version":2},"attestation_state":"computed","paper":{"title":"Multi-fidelity Gaussian process regression for noisy outputs and non-nested experimental designs: a comparison between the recursive and non-recursive formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Baptiste Kerleguer, Cyril Feau, Josselin Garnier, Nils Baillie","submitted_at":"2025-11-25T11:06:08Z","abstract_excerpt":"This paper investigates a recursive formulation of auto-regressive multi-fidelity Gaussian process regression in the challenging setting of noisy and non-nested high- and low-fidelity data. We propose a decoupled optimization strategy based on the expectation-maximization algorithm, which exploits the structure of the recursive model. In particular, we derive closed-form update formulas when the scaling factor is modeled as a parametric linear predictor. This approach is compared with the fully coupled likelihood maximization of the classical non-recursive formulation introduced by Kennedy and"},"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":"2511.20183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2025-11-25T11:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"5b5c9368df0e5f2e06487295b38f3e865551d7dfc64524f9cd251786662499ba","abstract_canon_sha256":"5f16be501d495bf1b1886d96749e4d72f2e6ac69b969e2894de9898486f72f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:12.087397Z","signature_b64":"1EKEnPyOkGSs8rUdlBH34XO2RzpdsTaqcF3P53nygfdKakccx5EsgqN0gTivZCaNdaMC1ibjQxixs+TTNYHrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54cc59e41a1bc98f014bc73d4654ecb041f4c9070db8fe563e806889ff96518c","last_reissued_at":"2026-05-21T01:05:12.086625Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:12.086625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-fidelity Gaussian process regression for noisy outputs and non-nested experimental designs: a comparison between the recursive and non-recursive formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Baptiste Kerleguer, Cyril Feau, Josselin Garnier, Nils Baillie","submitted_at":"2025-11-25T11:06:08Z","abstract_excerpt":"This paper investigates a recursive formulation of auto-regressive multi-fidelity Gaussian process regression in the challenging setting of noisy and non-nested high- and low-fidelity data. We propose a decoupled optimization strategy based on the expectation-maximization algorithm, which exploits the structure of the recursive model. In particular, we derive closed-form update formulas when the scaling factor is modeled as a parametric linear predictor. This approach is compared with the fully coupled likelihood maximization of the classical non-recursive formulation introduced by Kennedy and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.20183","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.20183/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2511.20183","created_at":"2026-05-21T01:05:12.086750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.20183v2","created_at":"2026-05-21T01:05:12.086750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.20183","created_at":"2026-05-21T01:05:12.086750+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTGFTZA2DPEY","created_at":"2026-05-21T01:05:12.086750+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTGFTZA2DPEY6AKL","created_at":"2026-05-21T01:05:12.086750+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTGFTZA2","created_at":"2026-05-21T01:05:12.086750+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/KTGFTZA2DPEY6AKLY46UMVHMWB","json":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB.json","graph_json":"https://pith.science/api/pith-number/KTGFTZA2DPEY6AKLY46UMVHMWB/graph.json","events_json":"https://pith.science/api/pith-number/KTGFTZA2DPEY6AKLY46UMVHMWB/events.json","paper":"https://pith.science/paper/KTGFTZA2"},"agent_actions":{"view_html":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB","download_json":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB.json","view_paper":"https://pith.science/paper/KTGFTZA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.20183&json=true","fetch_graph":"https://pith.science/api/pith-number/KTGFTZA2DPEY6AKLY46UMVHMWB/graph.json","fetch_events":"https://pith.science/api/pith-number/KTGFTZA2DPEY6AKLY46UMVHMWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB/action/storage_attestation","attest_author":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB/action/author_attestation","sign_citation":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB/action/citation_signature","submit_replication":"https://pith.science/pith/KTGFTZA2DPEY6AKLY46UMVHMWB/action/replication_record"}},"created_at":"2026-05-21T01:05:12.086750+00:00","updated_at":"2026-05-21T01:05:12.086750+00:00"}