{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YKMB7EQEMQLMZJMNAFS7YCUCJ5","short_pith_number":"pith:YKMB7EQE","canonical_record":{"source":{"id":"1410.7291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-27T16:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"45f62331b1dec79fd91467844e81bbca23190ab93c55d80cfaf37714f2e220e7","abstract_canon_sha256":"99a65c2c0c15e89841f229eedaa42985ca67521d2fee5c63abb1010dbc4b3e94"},"schema_version":"1.0"},"canonical_sha256":"c2981f92046416cca58d0165fc0a824f5a55a0386653ed99ae7878ac338a3c97","source":{"kind":"arxiv","id":"1410.7291","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7291","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7291v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7291","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"YKMB7EQEMQLM","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YKMB7EQEMQLMZJMN","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YKMB7EQE","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YKMB7EQEMQLMZJMNAFS7YCUCJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-27T16:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"45f62331b1dec79fd91467844e81bbca23190ab93c55d80cfaf37714f2e220e7","abstract_canon_sha256":"99a65c2c0c15e89841f229eedaa42985ca67521d2fee5c63abb1010dbc4b3e94"},"schema_version":"1.0"},"canonical_sha256":"c2981f92046416cca58d0165fc0a824f5a55a0386653ed99ae7878ac338a3c97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.648532Z","signature_b64":"NthFJKRppq+hW+QvaUNzQtokuRk2wLMD3VWtHCa4Vd9TSKPcnVFKgyseMwgQiaUitWlx/U5mfueJuxqouichDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2981f92046416cca58d0165fc0a824f5a55a0386653ed99ae7878ac338a3c97","last_reissued_at":"2026-05-18T02:26:38.647888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.647888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7291","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:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOBi26K8xyrqifQeSqRpNANr85xy5mOFy/SlOkp21xt0FqjsGJY+8lHkwv92b0ccD7JpgyHyieR5yMk1AH07Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:56:47.029860Z"},"content_sha256":"d79d98ce15a810038211426ea29a08823ff5d87b1b3b6c374476fd1f66501b91","schema_version":"1.0","event_id":"sha256:d79d98ce15a810038211426ea29a08823ff5d87b1b3b6c374476fd1f66501b91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YKMB7EQEMQLMZJMNAFS7YCUCJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sensitivity Analysis for Computationally Expensive Models using Optimization and Objective-oriented Surrogate Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Christine A. Shoemaker, Yilun Wang","submitted_at":"2014-10-27T16:11:09Z","abstract_excerpt":"In this paper, we focus on developing efficient sensitivity analysis methods for a computationally expensive objective function $f(x)$ in the case that the minimization of it has just been performed. Here \"computationally expensive\" means that each of its evaluation takes significant amount of time, and therefore our main goal to use a small number of function evaluations of $f(x)$ to further infer the sensitivity information of these different parameters. Correspondingly, we consider the optimization procedure as an adaptive experimental design and re-use its available function evaluations as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7291","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:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsR1OAqoWXOzyXMUh4F9YJSvJ8/E0nWyi3nsZJeFK5nQC3WgjZL3WYgWgMWfASjHWhco3eooKorgP6PYphe4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:56:47.030254Z"},"content_sha256":"171e8946d1a5646618184fd431af526578fd7814388b182656ef55bdcf37e8e7","schema_version":"1.0","event_id":"sha256:171e8946d1a5646618184fd431af526578fd7814388b182656ef55bdcf37e8e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKMB7EQEMQLMZJMNAFS7YCUCJ5/bundle.json","state_url":"https://pith.science/pith/YKMB7EQEMQLMZJMNAFS7YCUCJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKMB7EQEMQLMZJMNAFS7YCUCJ5/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-08T09:56:47Z","links":{"resolver":"https://pith.science/pith/YKMB7EQEMQLMZJMNAFS7YCUCJ5","bundle":"https://pith.science/pith/YKMB7EQEMQLMZJMNAFS7YCUCJ5/bundle.json","state":"https://pith.science/pith/YKMB7EQEMQLMZJMNAFS7YCUCJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKMB7EQEMQLMZJMNAFS7YCUCJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YKMB7EQEMQLMZJMNAFS7YCUCJ5","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":"99a65c2c0c15e89841f229eedaa42985ca67521d2fee5c63abb1010dbc4b3e94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-27T16:11:09Z","title_canon_sha256":"45f62331b1dec79fd91467844e81bbca23190ab93c55d80cfaf37714f2e220e7"},"schema_version":"1.0","source":{"id":"1410.7291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7291","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7291v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7291","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"YKMB7EQEMQLM","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YKMB7EQEMQLMZJMN","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YKMB7EQE","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:171e8946d1a5646618184fd431af526578fd7814388b182656ef55bdcf37e8e7","target":"graph","created_at":"2026-05-18T02:26:38Z","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":"In this paper, we focus on developing efficient sensitivity analysis methods for a computationally expensive objective function $f(x)$ in the case that the minimization of it has just been performed. Here \"computationally expensive\" means that each of its evaluation takes significant amount of time, and therefore our main goal to use a small number of function evaluations of $f(x)$ to further infer the sensitivity information of these different parameters. Correspondingly, we consider the optimization procedure as an adaptive experimental design and re-use its available function evaluations as","authors_text":"Christine A. Shoemaker, Yilun Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-27T16:11:09Z","title":"Sensitivity Analysis for Computationally Expensive Models using Optimization and Objective-oriented Surrogate Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7291","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:d79d98ce15a810038211426ea29a08823ff5d87b1b3b6c374476fd1f66501b91","target":"record","created_at":"2026-05-18T02:26:38Z","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":"99a65c2c0c15e89841f229eedaa42985ca67521d2fee5c63abb1010dbc4b3e94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-27T16:11:09Z","title_canon_sha256":"45f62331b1dec79fd91467844e81bbca23190ab93c55d80cfaf37714f2e220e7"},"schema_version":"1.0","source":{"id":"1410.7291","kind":"arxiv","version":2}},"canonical_sha256":"c2981f92046416cca58d0165fc0a824f5a55a0386653ed99ae7878ac338a3c97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2981f92046416cca58d0165fc0a824f5a55a0386653ed99ae7878ac338a3c97","first_computed_at":"2026-05-18T02:26:38.647888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.647888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NthFJKRppq+hW+QvaUNzQtokuRk2wLMD3VWtHCa4Vd9TSKPcnVFKgyseMwgQiaUitWlx/U5mfueJuxqouichDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.648532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d79d98ce15a810038211426ea29a08823ff5d87b1b3b6c374476fd1f66501b91","sha256:171e8946d1a5646618184fd431af526578fd7814388b182656ef55bdcf37e8e7"],"state_sha256":"7ae8c3ccd748661979f9313d4d6c5ad89931790ff2333c8f44fe48f20b1b3d98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QG0I1fHq/TXQtMbiv81H98CcFOPR/u1rWAVQqrRQ0EWr7hOAxDz2+muThFpqmrR8YJLdi068ZFZ1kLWULyLfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:56:47.032429Z","bundle_sha256":"1e8ebd034d78a07fbc819f4259f72fb3322ad0de8fd67a4eb24e3e5272f9bb00"}}