{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VTRVNEDOTUQ3ELJDABILM3A4X2","short_pith_number":"pith:VTRVNEDO","canonical_record":{"source":{"id":"1604.04980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-18T04:05:59Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"2caff1accbf0aec1276734531af1de2deb3f1660fc0ce4817c00383662ef850c","abstract_canon_sha256":"90a55bdc7627fb5fc623c1da7e3ba640f8a96115254b640eb52f6aa6b4e42e72"},"schema_version":"1.0"},"canonical_sha256":"ace356906e9d21b22d230050b66c1cbeae9942de3241ba53ce1935a91c1454ab","source":{"kind":"arxiv","id":"1604.04980","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04980","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04980v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04980","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"VTRVNEDOTUQ3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VTRVNEDOTUQ3ELJD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VTRVNEDO","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VTRVNEDOTUQ3ELJDABILM3A4X2","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-18T04:05:59Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"2caff1accbf0aec1276734531af1de2deb3f1660fc0ce4817c00383662ef850c","abstract_canon_sha256":"90a55bdc7627fb5fc623c1da7e3ba640f8a96115254b640eb52f6aa6b4e42e72"},"schema_version":"1.0"},"canonical_sha256":"ace356906e9d21b22d230050b66c1cbeae9942de3241ba53ce1935a91c1454ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.841350Z","signature_b64":"5fWaeVU1q6vVVPWWYh4HKER2E428d6S/BvOlIi7szE46Sp6mEC+1Ff+yjmMweOrukV3F8HxXoy0cfM8x2rEpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace356906e9d21b22d230050b66c1cbeae9942de3241ba53ce1935a91c1454ab","last_reissued_at":"2026-05-18T00:05:00.840944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.840944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04980","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-18T00:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZkENAlfdNAhyVfk7Zu295I0zVRluVhSYYkMgwQfnAVYbtPUrC33CWAanrdZIY5U+66BHj6cyOg14pA6soJhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:29:31.004359Z"},"content_sha256":"7b6a39b9cc3fbc877370461e065ea05b5753b195bc3098b5171c55eb6d5fdebf","schema_version":"1.0","event_id":"sha256:7b6a39b9cc3fbc877370461e065ea05b5753b195bc3098b5171c55eb6d5fdebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VTRVNEDOTUQ3ELJDABILM3A4X2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Potentially Predictive Variance Reducing Subsample Locations in Local Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Benjamin Haaland, Chih-Li Sung, Robert B. Gramacy","submitted_at":"2016-04-18T04:05:59Z","abstract_excerpt":"Gaussian process models are commonly used as emulators for computer experiments. However, developing a Gaussian process emulator can be computationally prohibitive when the number of experimental samples is even moderately large. Local Gaussian process approximation (Gramacy and Apley, 2015) was proposed as an accurate and computationally feasible emulation alternative. However, constructing local sub-designs specific to predictions at a particular location of interest remains a substantial computational bottleneck to the technique. In this paper, two computationally efficient neighborhood sea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04980","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-18T00:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExmJog/pIfdrt9CApcnqWG2akwJxfCyTj8R9Wb8SyuV3Y+rNYC7q41gy2YHUUQK2Keh8Vn5ZTxULlPdN6Z0EBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:29:31.004734Z"},"content_sha256":"5c82917793c98303c4dc21aef3c8f9681a7f0fcae1304bd510980f545ee05698","schema_version":"1.0","event_id":"sha256:5c82917793c98303c4dc21aef3c8f9681a7f0fcae1304bd510980f545ee05698"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTRVNEDOTUQ3ELJDABILM3A4X2/bundle.json","state_url":"https://pith.science/pith/VTRVNEDOTUQ3ELJDABILM3A4X2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTRVNEDOTUQ3ELJDABILM3A4X2/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-27T18:29:31Z","links":{"resolver":"https://pith.science/pith/VTRVNEDOTUQ3ELJDABILM3A4X2","bundle":"https://pith.science/pith/VTRVNEDOTUQ3ELJDABILM3A4X2/bundle.json","state":"https://pith.science/pith/VTRVNEDOTUQ3ELJDABILM3A4X2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTRVNEDOTUQ3ELJDABILM3A4X2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VTRVNEDOTUQ3ELJDABILM3A4X2","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":"90a55bdc7627fb5fc623c1da7e3ba640f8a96115254b640eb52f6aa6b4e42e72","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-18T04:05:59Z","title_canon_sha256":"2caff1accbf0aec1276734531af1de2deb3f1660fc0ce4817c00383662ef850c"},"schema_version":"1.0","source":{"id":"1604.04980","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04980","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04980v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04980","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"VTRVNEDOTUQ3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VTRVNEDOTUQ3ELJD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VTRVNEDO","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:5c82917793c98303c4dc21aef3c8f9681a7f0fcae1304bd510980f545ee05698","target":"graph","created_at":"2026-05-18T00:05: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":"Gaussian process models are commonly used as emulators for computer experiments. However, developing a Gaussian process emulator can be computationally prohibitive when the number of experimental samples is even moderately large. Local Gaussian process approximation (Gramacy and Apley, 2015) was proposed as an accurate and computationally feasible emulation alternative. However, constructing local sub-designs specific to predictions at a particular location of interest remains a substantial computational bottleneck to the technique. In this paper, two computationally efficient neighborhood sea","authors_text":"Benjamin Haaland, Chih-Li Sung, Robert B. Gramacy","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-18T04:05:59Z","title":"Potentially Predictive Variance Reducing Subsample Locations in Local Gaussian Process Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04980","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:7b6a39b9cc3fbc877370461e065ea05b5753b195bc3098b5171c55eb6d5fdebf","target":"record","created_at":"2026-05-18T00:05: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":"90a55bdc7627fb5fc623c1da7e3ba640f8a96115254b640eb52f6aa6b4e42e72","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-18T04:05:59Z","title_canon_sha256":"2caff1accbf0aec1276734531af1de2deb3f1660fc0ce4817c00383662ef850c"},"schema_version":"1.0","source":{"id":"1604.04980","kind":"arxiv","version":2}},"canonical_sha256":"ace356906e9d21b22d230050b66c1cbeae9942de3241ba53ce1935a91c1454ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ace356906e9d21b22d230050b66c1cbeae9942de3241ba53ce1935a91c1454ab","first_computed_at":"2026-05-18T00:05:00.840944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:00.840944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5fWaeVU1q6vVVPWWYh4HKER2E428d6S/BvOlIi7szE46Sp6mEC+1Ff+yjmMweOrukV3F8HxXoy0cfM8x2rEpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:00.841350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04980","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b6a39b9cc3fbc877370461e065ea05b5753b195bc3098b5171c55eb6d5fdebf","sha256:5c82917793c98303c4dc21aef3c8f9681a7f0fcae1304bd510980f545ee05698"],"state_sha256":"81a3691503f31986105f21d0dcd267fbea2a36ecb6adb6433c975ab73437cfdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AK7iUV1A7Fqnyt+dgdMgRAc2cO9hZTgxBSNFUJzf9J51M/UXPNZWmMqTi/S24/9si8hP6A2l0c08GZhY1xXpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:29:31.008074Z","bundle_sha256":"db64a39b221382841f2bae0d77626f4af77e266040baf073c37a38c109133453"}}