{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OSQGPFCPJTTAOTOJAB7Z3IEIYH","short_pith_number":"pith:OSQGPFCP","canonical_record":{"source":{"id":"1703.09930","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-29T08:32:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c8dd98e33f70ae421972ee34ae869d882bc9f817a1fc8d0c2cf57706545ab793","abstract_canon_sha256":"10a504d12e17d235aa8e09c912ab60ce936760fb3bd5017b18b1ad52d81729ed"},"schema_version":"1.0"},"canonical_sha256":"74a067944f4ce6074dc9007f9da088c1f251caf08df3382b2d3a91150d6eac96","source":{"kind":"arxiv","id":"1703.09930","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09930","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09930v4","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09930","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"pith_short_12","alias_value":"OSQGPFCPJTTA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OSQGPFCPJTTAOTOJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OSQGPFCP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OSQGPFCPJTTAOTOJAB7Z3IEIYH","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09930","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-29T08:32:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c8dd98e33f70ae421972ee34ae869d882bc9f817a1fc8d0c2cf57706545ab793","abstract_canon_sha256":"10a504d12e17d235aa8e09c912ab60ce936760fb3bd5017b18b1ad52d81729ed"},"schema_version":"1.0"},"canonical_sha256":"74a067944f4ce6074dc9007f9da088c1f251caf08df3382b2d3a91150d6eac96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:04.999162Z","signature_b64":"Vz6sc5vrQGnFe2ApteEnxbzxkj+81lJHtnTsN4iIuqx6P0kahUehX2Vp0L3HLaokc6kTAYXQseD6sO7b0t8kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74a067944f4ce6074dc9007f9da088c1f251caf08df3382b2d3a91150d6eac96","last_reissued_at":"2026-05-18T00:21:04.998724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:04.998724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09930","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-18T00:21:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05Hq9xluvTMYgb+v9l29BcFYNIZ2VpVk/p+ydC+pDavhb2/2EW5lN6htU5qOZRC+g9cbwkaKdFttxyB5j5jDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:03:19.433749Z"},"content_sha256":"23c2fff8a73b0334222b50b0a48b1e6700f1cad1c6ec27955e4f7b0c70487a13","schema_version":"1.0","event_id":"sha256:23c2fff8a73b0334222b50b0a48b1e6700f1cad1c6ec27955e4f7b0c70487a13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OSQGPFCPJTTAOTOJAB7Z3IEIYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Gaussian process approximation for Bayesian inference with expensive likelihood functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Hongqiao Wang, Jinglai Li","submitted_at":"2017-03-29T08:32:21Z","abstract_excerpt":"We consider Bayesian inference problems with computationally intensive likelihood functions. We propose a Gaussian process (GP) based method to approximate the joint distribution of the unknown parameters and the data. In particular, we write the joint density approximately as a product of an approximate posterior density and an exponentiated GP surrogate. We then provide an adaptive algorithm to construct such an approximation, where an active learning method is used to choose the design points. With numerical examples, we illustrate that the proposed method has competitive performance agains"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09930","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-18T00:21:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUCK4Csmjce0O/HHniwK7Iicgxu6Be9WPM3K+ZMkxT9w0JvQ5VAOHx7cZ1ViYmsXpinT+hBu/Ay2dGvXjrFBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:03:19.434121Z"},"content_sha256":"258b134641e9b62fe28b6e640de6071be14491d6acd874df47da9e1074b32f60","schema_version":"1.0","event_id":"sha256:258b134641e9b62fe28b6e640de6071be14491d6acd874df47da9e1074b32f60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSQGPFCPJTTAOTOJAB7Z3IEIYH/bundle.json","state_url":"https://pith.science/pith/OSQGPFCPJTTAOTOJAB7Z3IEIYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSQGPFCPJTTAOTOJAB7Z3IEIYH/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-25T08:03:19Z","links":{"resolver":"https://pith.science/pith/OSQGPFCPJTTAOTOJAB7Z3IEIYH","bundle":"https://pith.science/pith/OSQGPFCPJTTAOTOJAB7Z3IEIYH/bundle.json","state":"https://pith.science/pith/OSQGPFCPJTTAOTOJAB7Z3IEIYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSQGPFCPJTTAOTOJAB7Z3IEIYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OSQGPFCPJTTAOTOJAB7Z3IEIYH","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":"10a504d12e17d235aa8e09c912ab60ce936760fb3bd5017b18b1ad52d81729ed","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-29T08:32:21Z","title_canon_sha256":"c8dd98e33f70ae421972ee34ae869d882bc9f817a1fc8d0c2cf57706545ab793"},"schema_version":"1.0","source":{"id":"1703.09930","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09930","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09930v4","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09930","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"pith_short_12","alias_value":"OSQGPFCPJTTA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OSQGPFCPJTTAOTOJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OSQGPFCP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:258b134641e9b62fe28b6e640de6071be14491d6acd874df47da9e1074b32f60","target":"graph","created_at":"2026-05-18T00:21:04Z","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":"We consider Bayesian inference problems with computationally intensive likelihood functions. We propose a Gaussian process (GP) based method to approximate the joint distribution of the unknown parameters and the data. In particular, we write the joint density approximately as a product of an approximate posterior density and an exponentiated GP surrogate. We then provide an adaptive algorithm to construct such an approximation, where an active learning method is used to choose the design points. With numerical examples, we illustrate that the proposed method has competitive performance agains","authors_text":"Hongqiao Wang, Jinglai Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-29T08:32:21Z","title":"Adaptive Gaussian process approximation for Bayesian inference with expensive likelihood functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09930","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:23c2fff8a73b0334222b50b0a48b1e6700f1cad1c6ec27955e4f7b0c70487a13","target":"record","created_at":"2026-05-18T00:21:04Z","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":"10a504d12e17d235aa8e09c912ab60ce936760fb3bd5017b18b1ad52d81729ed","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-29T08:32:21Z","title_canon_sha256":"c8dd98e33f70ae421972ee34ae869d882bc9f817a1fc8d0c2cf57706545ab793"},"schema_version":"1.0","source":{"id":"1703.09930","kind":"arxiv","version":4}},"canonical_sha256":"74a067944f4ce6074dc9007f9da088c1f251caf08df3382b2d3a91150d6eac96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74a067944f4ce6074dc9007f9da088c1f251caf08df3382b2d3a91150d6eac96","first_computed_at":"2026-05-18T00:21:04.998724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:04.998724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vz6sc5vrQGnFe2ApteEnxbzxkj+81lJHtnTsN4iIuqx6P0kahUehX2Vp0L3HLaokc6kTAYXQseD6sO7b0t8kDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:04.999162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09930","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23c2fff8a73b0334222b50b0a48b1e6700f1cad1c6ec27955e4f7b0c70487a13","sha256:258b134641e9b62fe28b6e640de6071be14491d6acd874df47da9e1074b32f60"],"state_sha256":"2740ec5125fa4d8ba89f82b92657d06dc762e0f47ade4b10e6037104da8e5a4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugL+Vta9Z/mANzJpxIDqCuKUBcfo1ZQ/++l0hTtTlu+PrW/ORUQkrL5lCE8kUai4et2bHcBJ5sE7aYuvIMWdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:03:19.436680Z","bundle_sha256":"d7a83a2c16e521eada5c831077f72904b899e2fda0d38b76e97322b57e57bde0"}}