{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OXQGEP2YIWGSR63GCIJUZJATX4","short_pith_number":"pith:OXQGEP2Y","canonical_record":{"source":{"id":"1806.10761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-28T04:06:17Z","cross_cats_sorted":["cs.NA","stat.CO","stat.ME"],"title_canon_sha256":"26ac5326a83dfe90da162068d07cdf258af1c8d09f9faae68e216fc15e3db166","abstract_canon_sha256":"85ebc22668a6964cc748813a804ea2d8539e417c73e09c1e2666848e1cb1ea4c"},"schema_version":"1.0"},"canonical_sha256":"75e0623f58458d28fb6612134ca413bf0064ecbd1b90b192190721753e0055a4","source":{"kind":"arxiv","id":"1806.10761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10761","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10761v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10761","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"OXQGEP2YIWGS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXQGEP2YIWGSR63G","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXQGEP2Y","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OXQGEP2YIWGSR63GCIJUZJATX4","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-28T04:06:17Z","cross_cats_sorted":["cs.NA","stat.CO","stat.ME"],"title_canon_sha256":"26ac5326a83dfe90da162068d07cdf258af1c8d09f9faae68e216fc15e3db166","abstract_canon_sha256":"85ebc22668a6964cc748813a804ea2d8539e417c73e09c1e2666848e1cb1ea4c"},"schema_version":"1.0"},"canonical_sha256":"75e0623f58458d28fb6612134ca413bf0064ecbd1b90b192190721753e0055a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:08.000559Z","signature_b64":"F7mRX3xzor3Wc5PzU8RdcclIanIlP3PJD9+jnnLJD0E26lEtdSilY0QS6+kE3rC2koAwso0F52eNBEbux3TgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e0623f58458d28fb6612134ca413bf0064ecbd1b90b192190721753e0055a4","last_reissued_at":"2026-05-18T00:12:07.999861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:07.999861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10761","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAPUhpfKpRGCkXQJljWqvLWJEja1hWf3lfKh6CIPXs6AufuVN3ei56unHJi4nu9MiBRusczVWwYyWpFHo4y6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T10:37:19.360173Z"},"content_sha256":"2ccf13901695ca4566e8d034ad60bacaf519e492f6e00543602112eb4da714fb","schema_version":"1.0","event_id":"sha256:2ccf13901695ca4566e8d034ad60bacaf519e492f6e00543602112eb4da714fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OXQGEP2YIWGSR63GCIJUZJATX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Survey of multifidelity methods in uncertainty propagation, inference, and optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO","stat.ME"],"primary_cat":"math.NA","authors_text":"Benjamin Peherstorfer, Karen Willcox, Max Gunzburger","submitted_at":"2018-06-28T04:06:17Z","abstract_excerpt":"In many situations across computational science and engineering, multiple computational models are available that describe a system of interest. These different models have varying evaluation costs and varying fidelities. Typically, a computationally expensive high-fidelity model describes the system with the accuracy required by the current application at hand, while lower-fidelity models are less accurate but computationally cheaper than the high-fidelity model. Outer-loop applications, such as optimization, inference, and uncertainty quantification, require multiple model evaluations at man"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10761","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnFtn0RPs9dsm212XQA2cZL2c0jNVuTGmZFGoSRrKp8wMAE4mmWT2apw8Ukqxj9sN7Y5wolRZMkNBfYClgylAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T10:37:19.360619Z"},"content_sha256":"44d1e50ff66269cba9b2dbc188f65c39e2744d7497bda157fb31852e5f044915","schema_version":"1.0","event_id":"sha256:44d1e50ff66269cba9b2dbc188f65c39e2744d7497bda157fb31852e5f044915"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXQGEP2YIWGSR63GCIJUZJATX4/bundle.json","state_url":"https://pith.science/pith/OXQGEP2YIWGSR63GCIJUZJATX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXQGEP2YIWGSR63GCIJUZJATX4/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-23T10:37:19Z","links":{"resolver":"https://pith.science/pith/OXQGEP2YIWGSR63GCIJUZJATX4","bundle":"https://pith.science/pith/OXQGEP2YIWGSR63GCIJUZJATX4/bundle.json","state":"https://pith.science/pith/OXQGEP2YIWGSR63GCIJUZJATX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXQGEP2YIWGSR63GCIJUZJATX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OXQGEP2YIWGSR63GCIJUZJATX4","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":"85ebc22668a6964cc748813a804ea2d8539e417c73e09c1e2666848e1cb1ea4c","cross_cats_sorted":["cs.NA","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-28T04:06:17Z","title_canon_sha256":"26ac5326a83dfe90da162068d07cdf258af1c8d09f9faae68e216fc15e3db166"},"schema_version":"1.0","source":{"id":"1806.10761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10761","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10761v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10761","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"OXQGEP2YIWGS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXQGEP2YIWGSR63G","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXQGEP2Y","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:44d1e50ff66269cba9b2dbc188f65c39e2744d7497bda157fb31852e5f044915","target":"graph","created_at":"2026-05-18T00:12: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":"In many situations across computational science and engineering, multiple computational models are available that describe a system of interest. These different models have varying evaluation costs and varying fidelities. Typically, a computationally expensive high-fidelity model describes the system with the accuracy required by the current application at hand, while lower-fidelity models are less accurate but computationally cheaper than the high-fidelity model. Outer-loop applications, such as optimization, inference, and uncertainty quantification, require multiple model evaluations at man","authors_text":"Benjamin Peherstorfer, Karen Willcox, Max Gunzburger","cross_cats":["cs.NA","stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-28T04:06:17Z","title":"Survey of multifidelity methods in uncertainty propagation, inference, and optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10761","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:2ccf13901695ca4566e8d034ad60bacaf519e492f6e00543602112eb4da714fb","target":"record","created_at":"2026-05-18T00:12: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":"85ebc22668a6964cc748813a804ea2d8539e417c73e09c1e2666848e1cb1ea4c","cross_cats_sorted":["cs.NA","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-28T04:06:17Z","title_canon_sha256":"26ac5326a83dfe90da162068d07cdf258af1c8d09f9faae68e216fc15e3db166"},"schema_version":"1.0","source":{"id":"1806.10761","kind":"arxiv","version":1}},"canonical_sha256":"75e0623f58458d28fb6612134ca413bf0064ecbd1b90b192190721753e0055a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e0623f58458d28fb6612134ca413bf0064ecbd1b90b192190721753e0055a4","first_computed_at":"2026-05-18T00:12:07.999861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:07.999861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F7mRX3xzor3Wc5PzU8RdcclIanIlP3PJD9+jnnLJD0E26lEtdSilY0QS6+kE3rC2koAwso0F52eNBEbux3TgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:08.000559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ccf13901695ca4566e8d034ad60bacaf519e492f6e00543602112eb4da714fb","sha256:44d1e50ff66269cba9b2dbc188f65c39e2744d7497bda157fb31852e5f044915"],"state_sha256":"834378c01c8495b12b4cce70f34c282ba1c7afafd6dbddf0591689c4e76156cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoqcbrcIvB9/BB1USrma8AGbL8pdmNB174p630jDAuQaMFLGgkYzP8Vf5VM0VJ70/VejciuK3F2uB2lS0DP/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T10:37:19.363794Z","bundle_sha256":"beb0b288c1961ca50647ce6a4b3478ca3540480640b8e79f28c039a5b352141f"}}