{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ED7QE3QRB27QD7KMPLARVLPIAM","short_pith_number":"pith:ED7QE3QR","canonical_record":{"source":{"id":"1305.0759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-03T15:57:49Z","cross_cats_sorted":[],"title_canon_sha256":"9e25e4763bafd96dc60b7f023139cdc512c9115fc11fbbd6fbaac0e56842b540","abstract_canon_sha256":"00f391cf95f02d84506d2baaf85c2909e03af4ab407beb5ed04e09aec1ce31fd"},"schema_version":"1.0"},"canonical_sha256":"20ff026e110ebf01fd4c7ac11aade803138a3ca03999fdc0ca70312abd416ee0","source":{"kind":"arxiv","id":"1305.0759","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0759","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0759v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0759","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"ED7QE3QRB27Q","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ED7QE3QRB27QD7KM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ED7QE3QR","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ED7QE3QRB27QD7KMPLARVLPIAM","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-03T15:57:49Z","cross_cats_sorted":[],"title_canon_sha256":"9e25e4763bafd96dc60b7f023139cdc512c9115fc11fbbd6fbaac0e56842b540","abstract_canon_sha256":"00f391cf95f02d84506d2baaf85c2909e03af4ab407beb5ed04e09aec1ce31fd"},"schema_version":"1.0"},"canonical_sha256":"20ff026e110ebf01fd4c7ac11aade803138a3ca03999fdc0ca70312abd416ee0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.113057Z","signature_b64":"j9agsDrNefbahuEgNYLeEKjteq+7tNncrVt2M7z6730qgCdELbwMKIkzBPkBBzHTgVyngS0UT4t8CVoCf5i6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20ff026e110ebf01fd4c7ac11aade803138a3ca03999fdc0ca70312abd416ee0","last_reissued_at":"2026-05-18T01:26:32.112583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.112583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0759","source_version":1,"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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHY178hI23oNZ4AXe6blldzMvjqSxQdetT7iqsd6VrpPkqhZZluy+Vt56uFqKrjKW9982Jyn+z/1XqPCTewgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:31.816465Z"},"content_sha256":"6acdb6120b8cfabd0e88d1d2edb039d97ed58d827ce4ede3efed3db0b0b945e1","schema_version":"1.0","event_id":"sha256:6acdb6120b8cfabd0e88d1d2edb039d97ed58d827ce4ede3efed3db0b0b945e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ED7QE3QRB27QD7KMPLARVLPIAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GPfit: An R package for Gaussian Process Model Fitting using a New Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Blake MacDonald, Hugh Chipman, Pritam Ranjan","submitted_at":"2013-05-03T15:57:49Z","abstract_excerpt":"Gaussian process (GP) models are commonly used statistical metamodels for emulating expensive computer simulators. Fitting a GP model can be numerically unstable if any pair of design points in the input space are close together. Ranjan, Haynes, and Karsten (2011) proposed a computationally stable approach for fitting GP models to deterministic computer simulators. They used a genetic algorithm based approach that is robust but computationally intensive for maximizing the likelihood. This paper implements a slightly modified version of the model proposed by Ranjan et al. (2011), as the new R p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0759","kind":"arxiv","version":1},"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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgUqpFSatg/nvUVULRvyIwAdJdfuq7IF9ObcpIJ/AIJL+EwjNBf6zpyKv0xP0RG9ZSreboXRtC0142wA4frQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:31.817165Z"},"content_sha256":"2cd3167f1864ca96343659639bdeae1e14c64f46fdb9606e930b5dc3f29f137c","schema_version":"1.0","event_id":"sha256:2cd3167f1864ca96343659639bdeae1e14c64f46fdb9606e930b5dc3f29f137c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ED7QE3QRB27QD7KMPLARVLPIAM/bundle.json","state_url":"https://pith.science/pith/ED7QE3QRB27QD7KMPLARVLPIAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ED7QE3QRB27QD7KMPLARVLPIAM/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-09T07:24:31Z","links":{"resolver":"https://pith.science/pith/ED7QE3QRB27QD7KMPLARVLPIAM","bundle":"https://pith.science/pith/ED7QE3QRB27QD7KMPLARVLPIAM/bundle.json","state":"https://pith.science/pith/ED7QE3QRB27QD7KMPLARVLPIAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ED7QE3QRB27QD7KMPLARVLPIAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ED7QE3QRB27QD7KMPLARVLPIAM","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":"00f391cf95f02d84506d2baaf85c2909e03af4ab407beb5ed04e09aec1ce31fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-03T15:57:49Z","title_canon_sha256":"9e25e4763bafd96dc60b7f023139cdc512c9115fc11fbbd6fbaac0e56842b540"},"schema_version":"1.0","source":{"id":"1305.0759","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0759","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0759v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0759","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"ED7QE3QRB27Q","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ED7QE3QRB27QD7KM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ED7QE3QR","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:2cd3167f1864ca96343659639bdeae1e14c64f46fdb9606e930b5dc3f29f137c","target":"graph","created_at":"2026-05-18T01:26:32Z","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 (GP) models are commonly used statistical metamodels for emulating expensive computer simulators. Fitting a GP model can be numerically unstable if any pair of design points in the input space are close together. Ranjan, Haynes, and Karsten (2011) proposed a computationally stable approach for fitting GP models to deterministic computer simulators. They used a genetic algorithm based approach that is robust but computationally intensive for maximizing the likelihood. This paper implements a slightly modified version of the model proposed by Ranjan et al. (2011), as the new R p","authors_text":"Blake MacDonald, Hugh Chipman, Pritam Ranjan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-03T15:57:49Z","title":"GPfit: An R package for Gaussian Process Model Fitting using a New Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0759","kind":"arxiv","version":1},"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:6acdb6120b8cfabd0e88d1d2edb039d97ed58d827ce4ede3efed3db0b0b945e1","target":"record","created_at":"2026-05-18T01:26:32Z","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":"00f391cf95f02d84506d2baaf85c2909e03af4ab407beb5ed04e09aec1ce31fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-03T15:57:49Z","title_canon_sha256":"9e25e4763bafd96dc60b7f023139cdc512c9115fc11fbbd6fbaac0e56842b540"},"schema_version":"1.0","source":{"id":"1305.0759","kind":"arxiv","version":1}},"canonical_sha256":"20ff026e110ebf01fd4c7ac11aade803138a3ca03999fdc0ca70312abd416ee0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20ff026e110ebf01fd4c7ac11aade803138a3ca03999fdc0ca70312abd416ee0","first_computed_at":"2026-05-18T01:26:32.112583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:32.112583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j9agsDrNefbahuEgNYLeEKjteq+7tNncrVt2M7z6730qgCdELbwMKIkzBPkBBzHTgVyngS0UT4t8CVoCf5i6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:32.113057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0759","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6acdb6120b8cfabd0e88d1d2edb039d97ed58d827ce4ede3efed3db0b0b945e1","sha256:2cd3167f1864ca96343659639bdeae1e14c64f46fdb9606e930b5dc3f29f137c"],"state_sha256":"2fa723597a889849c2af9029cbc7ace26a3cb80ebcbe89f2b26c7664576135f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzTSSiTlaLuWP+KqbLeLaPR5QvucEZzENYEnCogXJ16qUSjMfdXv32ZSnmhB5a1/XTlNfsEYNqQ+fUgttfeDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:24:31.820856Z","bundle_sha256":"d36b36a46f904dff5132681bd5770ec92bab25876179de660cc69017f837ee3b"}}