{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NXDOLFK54XCGZIW6MIP2MY5CH2","short_pith_number":"pith:NXDOLFK5","canonical_record":{"source":{"id":"1303.0383","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-03-02T12:56:45Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"225519d4e1b89202b7d7f0512e161ab444a93c55f88eeac13d7cf895a9a5c6c9","abstract_canon_sha256":"1d6e607bb7f9a988822c57f2565d0060ecbf1e7a383855c9fce62b9b2dc7e204"},"schema_version":"1.0"},"canonical_sha256":"6dc6e5955de5c46ca2de621fa663a23ebee658eabc3e87e4e943246d4184d85c","source":{"kind":"arxiv","id":"1303.0383","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0383","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0383v4","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0383","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"NXDOLFK54XCG","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NXDOLFK54XCGZIW6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NXDOLFK5","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NXDOLFK54XCGZIW6MIP2MY5CH2","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0383","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-03-02T12:56:45Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"225519d4e1b89202b7d7f0512e161ab444a93c55f88eeac13d7cf895a9a5c6c9","abstract_canon_sha256":"1d6e607bb7f9a988822c57f2565d0060ecbf1e7a383855c9fce62b9b2dc7e204"},"schema_version":"1.0"},"canonical_sha256":"6dc6e5955de5c46ca2de621fa663a23ebee658eabc3e87e4e943246d4184d85c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:45.828700Z","signature_b64":"pHJBUstkuBGTF4PEvto0NTFnOlzq6y31viB8nuLMTGPcmtjFsCecZcMzwMHg5UjrnZ5658J/ozsdBJ+yduaQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dc6e5955de5c46ca2de621fa663a23ebee658eabc3e87e4e943246d4184d85c","last_reissued_at":"2026-05-18T02:40:45.828209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:45.828209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0383","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-18T02:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yCVbnUwUJlLSP0KcCf1v+xZPiYwWbz9C/HpN6S/KgiC6/GDEDR6n9flMBd7DiTSGr7j7u9wafZKvotg0L0JYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:58:12.464992Z"},"content_sha256":"0ee856028f715b96897d9cb0e013ff7939da62ec06f0b283627bda18e37df08b","schema_version":"1.0","event_id":"sha256:0ee856028f715b96897d9cb0e013ff7939da62ec06f0b283627bda18e37df08b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NXDOLFK54XCGZIW6MIP2MY5CH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Gaussian process approximation for large computer experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Daniel W. Apley, Robert B. Gramacy","submitted_at":"2013-03-02T12:56:45Z","abstract_excerpt":"We provide a new approach to approximate emulation of large computer experiments. By focusing expressly on desirable properties of the predictive equations, we derive a family of local sequential design schemes that dynamically define the support of a Gaussian process predictor based on a local subset of the data. We further derive expressions for fast sequential updating of all needed quantities as the local designs are built-up iteratively. Then we show how independent application of our local design strategy across the elements of a vast predictive grid facilitates a trivially parallel impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0383","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-18T02:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfpsALK1A1IfeUdJZY0WdqB5wumOXdvsetgpHF5Z2imByV9CK7saQa6PZAQNAet0qms8TNss81D9td3VYQx4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:58:12.465675Z"},"content_sha256":"705c09642c5733e81ce4a2419267065d8e393efece4c8866a561670c494b46f8","schema_version":"1.0","event_id":"sha256:705c09642c5733e81ce4a2419267065d8e393efece4c8866a561670c494b46f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXDOLFK54XCGZIW6MIP2MY5CH2/bundle.json","state_url":"https://pith.science/pith/NXDOLFK54XCGZIW6MIP2MY5CH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXDOLFK54XCGZIW6MIP2MY5CH2/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-06-07T04:58:12Z","links":{"resolver":"https://pith.science/pith/NXDOLFK54XCGZIW6MIP2MY5CH2","bundle":"https://pith.science/pith/NXDOLFK54XCGZIW6MIP2MY5CH2/bundle.json","state":"https://pith.science/pith/NXDOLFK54XCGZIW6MIP2MY5CH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXDOLFK54XCGZIW6MIP2MY5CH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NXDOLFK54XCGZIW6MIP2MY5CH2","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":"1d6e607bb7f9a988822c57f2565d0060ecbf1e7a383855c9fce62b9b2dc7e204","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-03-02T12:56:45Z","title_canon_sha256":"225519d4e1b89202b7d7f0512e161ab444a93c55f88eeac13d7cf895a9a5c6c9"},"schema_version":"1.0","source":{"id":"1303.0383","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0383","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0383v4","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0383","created_at":"2026-05-18T02:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"NXDOLFK54XCG","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NXDOLFK54XCGZIW6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NXDOLFK5","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:705c09642c5733e81ce4a2419267065d8e393efece4c8866a561670c494b46f8","target":"graph","created_at":"2026-05-18T02:40:45Z","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 provide a new approach to approximate emulation of large computer experiments. By focusing expressly on desirable properties of the predictive equations, we derive a family of local sequential design schemes that dynamically define the support of a Gaussian process predictor based on a local subset of the data. We further derive expressions for fast sequential updating of all needed quantities as the local designs are built-up iteratively. Then we show how independent application of our local design strategy across the elements of a vast predictive grid facilitates a trivially parallel impl","authors_text":"Daniel W. Apley, Robert B. Gramacy","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-03-02T12:56:45Z","title":"Local Gaussian process approximation for large computer experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0383","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:0ee856028f715b96897d9cb0e013ff7939da62ec06f0b283627bda18e37df08b","target":"record","created_at":"2026-05-18T02:40:45Z","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":"1d6e607bb7f9a988822c57f2565d0060ecbf1e7a383855c9fce62b9b2dc7e204","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-03-02T12:56:45Z","title_canon_sha256":"225519d4e1b89202b7d7f0512e161ab444a93c55f88eeac13d7cf895a9a5c6c9"},"schema_version":"1.0","source":{"id":"1303.0383","kind":"arxiv","version":4}},"canonical_sha256":"6dc6e5955de5c46ca2de621fa663a23ebee658eabc3e87e4e943246d4184d85c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dc6e5955de5c46ca2de621fa663a23ebee658eabc3e87e4e943246d4184d85c","first_computed_at":"2026-05-18T02:40:45.828209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:45.828209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pHJBUstkuBGTF4PEvto0NTFnOlzq6y31viB8nuLMTGPcmtjFsCecZcMzwMHg5UjrnZ5658J/ozsdBJ+yduaQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:45.828700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0383","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee856028f715b96897d9cb0e013ff7939da62ec06f0b283627bda18e37df08b","sha256:705c09642c5733e81ce4a2419267065d8e393efece4c8866a561670c494b46f8"],"state_sha256":"64de052a0a80e607f94962fd8462670ec9ccdc1d8883b2be32eea86011021f33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+dUkMmFjvjxPdvmnMxarmqhMZ4sy1gShiM3cQ56SWx5ocLiS78mnv4S3MdSD/36n/CYevbL/g6OLVoieVRvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:58:12.469152Z","bundle_sha256":"a677265a234ebc144a44279491830498f7e0b757d743998c56da440a42520451"}}