{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UQXRJZV454FGMEUUCKTMWGJUWR","short_pith_number":"pith:UQXRJZV4","canonical_record":{"source":{"id":"1409.0074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-08-30T01:02:47Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"e29642b4d044221fcc603e64f9269105102c58314169e45ae436d98704c4ac11","abstract_canon_sha256":"7cb206b870d30b9c7769e32ce033d401c770cc659e104d1d8e192d94c3127af0"},"schema_version":"1.0"},"canonical_sha256":"a42f14e6bcef0a66129412a6cb1934b476a07cf5cbc3b5fe92b09bf1c08c7969","source":{"kind":"arxiv","id":"1409.0074","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0074","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0074v2","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0074","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"UQXRJZV454FG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UQXRJZV454FGMEUU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UQXRJZV4","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UQXRJZV454FGMEUUCKTMWGJUWR","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-08-30T01:02:47Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"e29642b4d044221fcc603e64f9269105102c58314169e45ae436d98704c4ac11","abstract_canon_sha256":"7cb206b870d30b9c7769e32ce033d401c770cc659e104d1d8e192d94c3127af0"},"schema_version":"1.0"},"canonical_sha256":"a42f14e6bcef0a66129412a6cb1934b476a07cf5cbc3b5fe92b09bf1c08c7969","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:07.969996Z","signature_b64":"pM0IrLfiExgCkq/KEBKcyHWdhnx15968KAZwmyDtF8uFbfpP++pYte8gIpO99pAmLS/QS2Xjqlo30NwK/+hdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a42f14e6bcef0a66129412a6cb1934b476a07cf5cbc3b5fe92b09bf1c08c7969","last_reissued_at":"2026-05-18T02:30:07.969539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:07.969539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0074","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-18T02:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0ksI36lZRUDnZFbGeJBWuBxkvQy3tFHeCckih9qfBlj1ymOCvyoqFOPjNM0S5tw/evGD9iv3/rxtK0smYcAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:43:16.392605Z"},"content_sha256":"b78487a25a9622c14ea71b80ac6d7868812f75b8628db3e79d06ab46d33f58cf","schema_version":"1.0","event_id":"sha256:b78487a25a9622c14ea71b80ac6d7868812f75b8628db3e79d06ab46d33f58cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UQXRJZV454FGMEUUCKTMWGJUWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding up neighborhood search in local Gaussian process prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Benjamin Haaland, Robert B. Gramacy","submitted_at":"2014-08-30T01:02:47Z","abstract_excerpt":"Recent implementations of local approximate Gaussian process models have pushed computational boundaries for non-linear, non-parametric prediction problems, particularly when deployed as emulators for computer experiments. Their flavor of spatially independent computation accommodates massive parallelization, meaning that they can handle designs two or more orders of magnitude larger than previously. However, accomplishing that feat can still require massive supercomputing resources. Here we aim to ease that burden. We study how predictive variance is reduced as local designs are built up for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0074","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-18T02:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SggC4V7KxQFx8BBm0poJnzqBIl29ANxzmrxD9DO7YwJI5t2LYnM67Z8PTtYl8A/0EqbeotifC5I+iq60O96Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:43:16.393253Z"},"content_sha256":"cb8fae8ac8aa63eceb49cc316bb325995bc825037cb1ea3cf7838bcf9b33628e","schema_version":"1.0","event_id":"sha256:cb8fae8ac8aa63eceb49cc316bb325995bc825037cb1ea3cf7838bcf9b33628e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQXRJZV454FGMEUUCKTMWGJUWR/bundle.json","state_url":"https://pith.science/pith/UQXRJZV454FGMEUUCKTMWGJUWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQXRJZV454FGMEUUCKTMWGJUWR/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-31T11:43:16Z","links":{"resolver":"https://pith.science/pith/UQXRJZV454FGMEUUCKTMWGJUWR","bundle":"https://pith.science/pith/UQXRJZV454FGMEUUCKTMWGJUWR/bundle.json","state":"https://pith.science/pith/UQXRJZV454FGMEUUCKTMWGJUWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQXRJZV454FGMEUUCKTMWGJUWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UQXRJZV454FGMEUUCKTMWGJUWR","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":"7cb206b870d30b9c7769e32ce033d401c770cc659e104d1d8e192d94c3127af0","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-08-30T01:02:47Z","title_canon_sha256":"e29642b4d044221fcc603e64f9269105102c58314169e45ae436d98704c4ac11"},"schema_version":"1.0","source":{"id":"1409.0074","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0074","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0074v2","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0074","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"UQXRJZV454FG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UQXRJZV454FGMEUU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UQXRJZV4","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:cb8fae8ac8aa63eceb49cc316bb325995bc825037cb1ea3cf7838bcf9b33628e","target":"graph","created_at":"2026-05-18T02:30: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":"Recent implementations of local approximate Gaussian process models have pushed computational boundaries for non-linear, non-parametric prediction problems, particularly when deployed as emulators for computer experiments. Their flavor of spatially independent computation accommodates massive parallelization, meaning that they can handle designs two or more orders of magnitude larger than previously. However, accomplishing that feat can still require massive supercomputing resources. Here we aim to ease that burden. We study how predictive variance is reduced as local designs are built up for ","authors_text":"Benjamin Haaland, Robert B. Gramacy","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-08-30T01:02:47Z","title":"Speeding up neighborhood search in local Gaussian process prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0074","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:b78487a25a9622c14ea71b80ac6d7868812f75b8628db3e79d06ab46d33f58cf","target":"record","created_at":"2026-05-18T02:30: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":"7cb206b870d30b9c7769e32ce033d401c770cc659e104d1d8e192d94c3127af0","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-08-30T01:02:47Z","title_canon_sha256":"e29642b4d044221fcc603e64f9269105102c58314169e45ae436d98704c4ac11"},"schema_version":"1.0","source":{"id":"1409.0074","kind":"arxiv","version":2}},"canonical_sha256":"a42f14e6bcef0a66129412a6cb1934b476a07cf5cbc3b5fe92b09bf1c08c7969","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a42f14e6bcef0a66129412a6cb1934b476a07cf5cbc3b5fe92b09bf1c08c7969","first_computed_at":"2026-05-18T02:30:07.969539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:07.969539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pM0IrLfiExgCkq/KEBKcyHWdhnx15968KAZwmyDtF8uFbfpP++pYte8gIpO99pAmLS/QS2Xjqlo30NwK/+hdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:07.969996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0074","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b78487a25a9622c14ea71b80ac6d7868812f75b8628db3e79d06ab46d33f58cf","sha256:cb8fae8ac8aa63eceb49cc316bb325995bc825037cb1ea3cf7838bcf9b33628e"],"state_sha256":"e62219b4a809e16dc47e0ff6ca8c7e660ac615dee3674dfc01509632c7d929ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6cTbvZY84/Os+z/kGPvC0WGL++XyI/8XviL42Ox81bG+A409ozGkvc7F4+oybOrYNcamje8eXxYhc9xxRDPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:43:16.396858Z","bundle_sha256":"7fd21172219c40cca7d5731de786acfdfe4d6be326fe84ba73f4ffe7e10738ef"}}