{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:I3BAZ36FXVWYMNZWQAFX56JG3C","short_pith_number":"pith:I3BAZ36F","canonical_record":{"source":{"id":"1506.08010","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-26T09:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"ce9efc191ce3dccb97c85e8e419a22f869152e8e6ee668c3d497956fd40aca44","abstract_canon_sha256":"76a37202c9d21327d6953e6415b2d481474fc7feca8d70fd06c9f52420d18b86"},"schema_version":"1.0"},"canonical_sha256":"46c20cefc5bd6d863736800b7ef926d8a4e87320f49fe280d46100bf67504700","source":{"kind":"arxiv","id":"1506.08010","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08010","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08010v4","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08010","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"I3BAZ36FXVWY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I3BAZ36FXVWYMNZW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I3BAZ36F","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:I3BAZ36FXVWYMNZWQAFX56JG3C","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08010","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-26T09:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"ce9efc191ce3dccb97c85e8e419a22f869152e8e6ee668c3d497956fd40aca44","abstract_canon_sha256":"76a37202c9d21327d6953e6415b2d481474fc7feca8d70fd06c9f52420d18b86"},"schema_version":"1.0"},"canonical_sha256":"46c20cefc5bd6d863736800b7ef926d8a4e87320f49fe280d46100bf67504700","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:07.021042Z","signature_b64":"LspSsd93GsyS3APm+osf+T8l7LwwCY7n+pXBcxYkXsMqIVszqKC9Lkq3qLSU5mekeBKPGJnvdvDr/PsCEu0LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c20cefc5bd6d863736800b7ef926d8a4e87320f49fe280d46100bf67504700","last_reissued_at":"2026-05-18T01:09:07.020450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:07.020450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08010","source_version":4,"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-18T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ks05rGB+LQ4YdCobY6j3kk/mJ7ZpTSAyPjbrk5DW16yrtFN4HL+50WmmcP4NKFdhEljLIIqcAwxxq1clrgS7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:52:29.198153Z"},"content_sha256":"b804d97d5e792a362135d7f23d5491aace15f017a143dda011c339ec02e84552","schema_version":"1.0","event_id":"sha256:b804d97d5e792a362135d7f23d5491aace15f017a143dda011c339ec02e84552"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:I3BAZ36FXVWYMNZWQAFX56JG3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gaussian process hyper-parameter estimation using parallel asymptotically independent Markov sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"A. Garbuno-Inigo, F.A. DiazDelaO, K.M. Zuev","submitted_at":"2015-06-26T09:46:04Z","abstract_excerpt":"Gaussian process emulators of computationally expensive computer codes provide fast statistical approximations to model physical processes. The training of these surrogates depends on the set of design points chosen to run the simulator. Due to computational cost, such training set is bound to be limited and quantifying the resulting uncertainty in the hyper-parameters of the emulator by uni-modal distributions is likely to induce bias. In order to quantify this uncertainty, this paper proposes a computationally efficient sampler based on an extension of Asymptotically Independent Markov Sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08010","kind":"arxiv","version":4},"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-18T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLNg1v1beXqAkz4FET0+rRGps1a+mmNND2GLjv6MDjB81WDPjo/5Ki1dgmKmKpdHOfu/Z4kKbByUUvWSQDGMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:52:29.198782Z"},"content_sha256":"0108b7d6eb877798c68441706d5f12f519e96cd8aedc47a91214678e54bac835","schema_version":"1.0","event_id":"sha256:0108b7d6eb877798c68441706d5f12f519e96cd8aedc47a91214678e54bac835"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3BAZ36FXVWYMNZWQAFX56JG3C/bundle.json","state_url":"https://pith.science/pith/I3BAZ36FXVWYMNZWQAFX56JG3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3BAZ36FXVWYMNZWQAFX56JG3C/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-25T21:52:29Z","links":{"resolver":"https://pith.science/pith/I3BAZ36FXVWYMNZWQAFX56JG3C","bundle":"https://pith.science/pith/I3BAZ36FXVWYMNZWQAFX56JG3C/bundle.json","state":"https://pith.science/pith/I3BAZ36FXVWYMNZWQAFX56JG3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3BAZ36FXVWYMNZWQAFX56JG3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:I3BAZ36FXVWYMNZWQAFX56JG3C","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":"76a37202c9d21327d6953e6415b2d481474fc7feca8d70fd06c9f52420d18b86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-26T09:46:04Z","title_canon_sha256":"ce9efc191ce3dccb97c85e8e419a22f869152e8e6ee668c3d497956fd40aca44"},"schema_version":"1.0","source":{"id":"1506.08010","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08010","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08010v4","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08010","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"I3BAZ36FXVWY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I3BAZ36FXVWYMNZW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I3BAZ36F","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:0108b7d6eb877798c68441706d5f12f519e96cd8aedc47a91214678e54bac835","target":"graph","created_at":"2026-05-18T01:09:07Z","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":"Gaussian process emulators of computationally expensive computer codes provide fast statistical approximations to model physical processes. The training of these surrogates depends on the set of design points chosen to run the simulator. Due to computational cost, such training set is bound to be limited and quantifying the resulting uncertainty in the hyper-parameters of the emulator by uni-modal distributions is likely to induce bias. In order to quantify this uncertainty, this paper proposes a computationally efficient sampler based on an extension of Asymptotically Independent Markov Sampl","authors_text":"A. Garbuno-Inigo, F.A. DiazDelaO, K.M. Zuev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-26T09:46:04Z","title":"Gaussian process hyper-parameter estimation using parallel asymptotically independent Markov sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08010","kind":"arxiv","version":4},"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:b804d97d5e792a362135d7f23d5491aace15f017a143dda011c339ec02e84552","target":"record","created_at":"2026-05-18T01:09:07Z","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":"76a37202c9d21327d6953e6415b2d481474fc7feca8d70fd06c9f52420d18b86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-26T09:46:04Z","title_canon_sha256":"ce9efc191ce3dccb97c85e8e419a22f869152e8e6ee668c3d497956fd40aca44"},"schema_version":"1.0","source":{"id":"1506.08010","kind":"arxiv","version":4}},"canonical_sha256":"46c20cefc5bd6d863736800b7ef926d8a4e87320f49fe280d46100bf67504700","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46c20cefc5bd6d863736800b7ef926d8a4e87320f49fe280d46100bf67504700","first_computed_at":"2026-05-18T01:09:07.020450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:07.020450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LspSsd93GsyS3APm+osf+T8l7LwwCY7n+pXBcxYkXsMqIVszqKC9Lkq3qLSU5mekeBKPGJnvdvDr/PsCEu0LBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:07.021042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08010","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b804d97d5e792a362135d7f23d5491aace15f017a143dda011c339ec02e84552","sha256:0108b7d6eb877798c68441706d5f12f519e96cd8aedc47a91214678e54bac835"],"state_sha256":"9e9a7c8f86844a4f841b8565783bf1b165b403c8fc653bf172ed44e76ff13bd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdUwYm92S8cjVQo6mB5bSaeYftm2DPzT1hJVSjNxovTlWVBX5DkZx0IB8yRO2t5et1BE57/f8Ss43OGgAGayCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:52:29.202235Z","bundle_sha256":"bfc961b34e97396d3b67f05fd38e860e7e96e44bc99b56b68e40669f4bb7b4fe"}}