{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FULTCGQZOSBBDTMPHDIJ55G5WK","short_pith_number":"pith:FULTCGQZ","canonical_record":{"source":{"id":"1709.03661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-09-12T02:35:16Z","cross_cats_sorted":[],"title_canon_sha256":"ebe96b08f2fb265b4563cd4c6b57acc0012d888bb47950de9c33547a1de24217","abstract_canon_sha256":"02b7cfd5d1e7e1373506a0f50373a8d158c5b96001db6fa86de204c9b0bc8198"},"schema_version":"1.0"},"canonical_sha256":"2d17311a19748211cd8f38d09ef4ddb295b247abc5019e201b6b564dc319dd6b","source":{"kind":"arxiv","id":"1709.03661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03661","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03661v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03661","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"FULTCGQZOSBB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FULTCGQZOSBBDTMP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FULTCGQZ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FULTCGQZOSBBDTMPHDIJ55G5WK","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-09-12T02:35:16Z","cross_cats_sorted":[],"title_canon_sha256":"ebe96b08f2fb265b4563cd4c6b57acc0012d888bb47950de9c33547a1de24217","abstract_canon_sha256":"02b7cfd5d1e7e1373506a0f50373a8d158c5b96001db6fa86de204c9b0bc8198"},"schema_version":"1.0"},"canonical_sha256":"2d17311a19748211cd8f38d09ef4ddb295b247abc5019e201b6b564dc319dd6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.886064Z","signature_b64":"hvQqFlVrKo/RUdtwdsEOYq2whRtk2VAIUuU7Bn+yv6WrSkyLSSOvfNwd3AEfLnezYtuZpq/PnW8nOMfe3xTTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d17311a19748211cd8f38d09ef4ddb295b247abc5019e201b6b564dc319dd6b","last_reissued_at":"2026-05-18T00:35:29.885551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.885551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03661","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:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UcY4upwL2ktU5jg1uFlNCFsybGoGy0za9OcQbIGdunhKGwghnUY0c/+a5AFisbp4dAg3QkqWc6lvxZ/hK/9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:02.707787Z"},"content_sha256":"b37c3260ce352b864df913dc220317002b9798d7e46e0043ae9eb3c929323099","schema_version":"1.0","event_id":"sha256:b37c3260ce352b864df913dc220317002b9798d7e46e0043ae9eb3c929323099"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FULTCGQZOSBBDTMPHDIJ55G5WK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parametric/Stochastic Model Reduction: Low-Rank Representation, Non-Intrusive Bi-Fidelity Approximation, and Convergence Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Akil Narayan, Alireza Doostan, Hillary Fairbanks, Jerrad Hampton","submitted_at":"2017-09-12T02:35:16Z","abstract_excerpt":"For practical model-based demands, such as design space exploration and uncertainty quantification (UQ), a high-fidelity model that produces accurate outputs often has high computational cost, while a low-fidelity model with less accurate outputs has low computational cost. It is often possible to construct a bi-fidelity model having accuracy comparable with the high-fidelity model and computational cost comparable with the low-fidelity model. This work presents the construction and analysis of a non-intrusive (i.e., sample-based) bi-fidelity model that relies on the low-rank structure of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03661","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:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/VEj6UG/eYBqmX7p7bQZTMxzmjngoBVnzbx/3bspTX+ey9ztZOyx0XOA7m/ram73jVrtVhy9agAg5ns+5nguBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:02.708476Z"},"content_sha256":"c79a34837e47e49774ae932485a1220a1ced894928d23185e83ed5ee363a86f5","schema_version":"1.0","event_id":"sha256:c79a34837e47e49774ae932485a1220a1ced894928d23185e83ed5ee363a86f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FULTCGQZOSBBDTMPHDIJ55G5WK/bundle.json","state_url":"https://pith.science/pith/FULTCGQZOSBBDTMPHDIJ55G5WK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FULTCGQZOSBBDTMPHDIJ55G5WK/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-27T22:11:02Z","links":{"resolver":"https://pith.science/pith/FULTCGQZOSBBDTMPHDIJ55G5WK","bundle":"https://pith.science/pith/FULTCGQZOSBBDTMPHDIJ55G5WK/bundle.json","state":"https://pith.science/pith/FULTCGQZOSBBDTMPHDIJ55G5WK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FULTCGQZOSBBDTMPHDIJ55G5WK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FULTCGQZOSBBDTMPHDIJ55G5WK","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":"02b7cfd5d1e7e1373506a0f50373a8d158c5b96001db6fa86de204c9b0bc8198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-09-12T02:35:16Z","title_canon_sha256":"ebe96b08f2fb265b4563cd4c6b57acc0012d888bb47950de9c33547a1de24217"},"schema_version":"1.0","source":{"id":"1709.03661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03661","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03661v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03661","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"FULTCGQZOSBB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FULTCGQZOSBBDTMP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FULTCGQZ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:c79a34837e47e49774ae932485a1220a1ced894928d23185e83ed5ee363a86f5","target":"graph","created_at":"2026-05-18T00:35:29Z","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":"For practical model-based demands, such as design space exploration and uncertainty quantification (UQ), a high-fidelity model that produces accurate outputs often has high computational cost, while a low-fidelity model with less accurate outputs has low computational cost. It is often possible to construct a bi-fidelity model having accuracy comparable with the high-fidelity model and computational cost comparable with the low-fidelity model. This work presents the construction and analysis of a non-intrusive (i.e., sample-based) bi-fidelity model that relies on the low-rank structure of the ","authors_text":"Akil Narayan, Alireza Doostan, Hillary Fairbanks, Jerrad Hampton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-09-12T02:35:16Z","title":"Parametric/Stochastic Model Reduction: Low-Rank Representation, Non-Intrusive Bi-Fidelity Approximation, and Convergence Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03661","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:b37c3260ce352b864df913dc220317002b9798d7e46e0043ae9eb3c929323099","target":"record","created_at":"2026-05-18T00:35:29Z","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":"02b7cfd5d1e7e1373506a0f50373a8d158c5b96001db6fa86de204c9b0bc8198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-09-12T02:35:16Z","title_canon_sha256":"ebe96b08f2fb265b4563cd4c6b57acc0012d888bb47950de9c33547a1de24217"},"schema_version":"1.0","source":{"id":"1709.03661","kind":"arxiv","version":1}},"canonical_sha256":"2d17311a19748211cd8f38d09ef4ddb295b247abc5019e201b6b564dc319dd6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d17311a19748211cd8f38d09ef4ddb295b247abc5019e201b6b564dc319dd6b","first_computed_at":"2026-05-18T00:35:29.885551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:29.885551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvQqFlVrKo/RUdtwdsEOYq2whRtk2VAIUuU7Bn+yv6WrSkyLSSOvfNwd3AEfLnezYtuZpq/PnW8nOMfe3xTTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:29.886064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b37c3260ce352b864df913dc220317002b9798d7e46e0043ae9eb3c929323099","sha256:c79a34837e47e49774ae932485a1220a1ced894928d23185e83ed5ee363a86f5"],"state_sha256":"00bd13a820bb563c84813d1440f4ac2a051b3feb3611c2af65cbef54a9f46d64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgyuAnd6o8OEzaSrZt1WdtAJ0HvUrXIy0WgNs1ECdo2JL1wUEz6Qo0Q2fjNtM3uNARTJ8SxJh6HZnRRjQc3PDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:11:02.711869Z","bundle_sha256":"b8632a0cdfe04f42ff9e0b88deccdff91cffb72f687ff9b68684ca7ce7260119"}}