{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EV5PRWIV4RJIEBC3OQL2VIM7MA","short_pith_number":"pith:EV5PRWIV","schema_version":"1.0","canonical_sha256":"257af8d915e45282045b7417aaa19f601d286c6f976b98ca77889c4a448bb7ac","source":{"kind":"arxiv","id":"2104.07462","version":1},"attestation_state":"computed","paper":{"title":"Bi-fidelity Reduced Polynomial Chaos Expansion for Uncertainty Quantification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","stat.CO"],"primary_cat":"math.NA","authors_text":"Alireza Doostan, Felix Newberry, Jerrad Hampton, Kenneth Jansen","submitted_at":"2021-04-15T13:48:31Z","abstract_excerpt":"A ubiquitous challenge in design space exploration or uncertainty quantification of complex engineering problems is the minimization of computational cost. A useful tool to ease the burden of solving such systems is model reduction. This work considers a stochastic model reduction method (SMR), in the context of polynomial chaos (PC) expansions, where low-fidelity (LF) samples are leveraged to form a stochastic reduced basis. The reduced basis enables the construction of a bi-fidelity (BF) estimate of a quantity of interest from a small number of high-fidelity (HF) samples. A successful BF est"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2104.07462","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2021-04-15T13:48:31Z","cross_cats_sorted":["cs.NA","stat.CO"],"title_canon_sha256":"266ccd738f294772e3adee8ac206c59e899ca3285ab844f32ead5b045d1ccd39","abstract_canon_sha256":"e95a6297f2ba787a78c6772d26ab179727a49e3eaec3b518c1e78b40d4a973b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:28.161779Z","signature_b64":"qZjkQKPnFv7MgMwEb+fhyutELhDP/PbbPZ27e1TZ3zC2A9uRQBVBIKF6IrvoLVhniweqapYt254YaFEGMMIfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"257af8d915e45282045b7417aaa19f601d286c6f976b98ca77889c4a448bb7ac","last_reissued_at":"2026-07-05T02:32:28.161376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:28.161376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bi-fidelity Reduced Polynomial Chaos Expansion for Uncertainty Quantification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","stat.CO"],"primary_cat":"math.NA","authors_text":"Alireza Doostan, Felix Newberry, Jerrad Hampton, Kenneth Jansen","submitted_at":"2021-04-15T13:48:31Z","abstract_excerpt":"A ubiquitous challenge in design space exploration or uncertainty quantification of complex engineering problems is the minimization of computational cost. A useful tool to ease the burden of solving such systems is model reduction. This work considers a stochastic model reduction method (SMR), in the context of polynomial chaos (PC) expansions, where low-fidelity (LF) samples are leveraged to form a stochastic reduced basis. The reduced basis enables the construction of a bi-fidelity (BF) estimate of a quantity of interest from a small number of high-fidelity (HF) samples. A successful BF est"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07462","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.07462/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.07462","created_at":"2026-07-05T02:32:28.161432+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.07462v1","created_at":"2026-07-05T02:32:28.161432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07462","created_at":"2026-07-05T02:32:28.161432+00:00"},{"alias_kind":"pith_short_12","alias_value":"EV5PRWIV4RJI","created_at":"2026-07-05T02:32:28.161432+00:00"},{"alias_kind":"pith_short_16","alias_value":"EV5PRWIV4RJIEBC3","created_at":"2026-07-05T02:32:28.161432+00:00"},{"alias_kind":"pith_short_8","alias_value":"EV5PRWIV","created_at":"2026-07-05T02:32:28.161432+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01615","citing_title":"IndicRAGSuite: Large-Scale Datasets and a Benchmark for Indian Language RAG Systems","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA","json":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA.json","graph_json":"https://pith.science/api/pith-number/EV5PRWIV4RJIEBC3OQL2VIM7MA/graph.json","events_json":"https://pith.science/api/pith-number/EV5PRWIV4RJIEBC3OQL2VIM7MA/events.json","paper":"https://pith.science/paper/EV5PRWIV"},"agent_actions":{"view_html":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA","download_json":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA.json","view_paper":"https://pith.science/paper/EV5PRWIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.07462&json=true","fetch_graph":"https://pith.science/api/pith-number/EV5PRWIV4RJIEBC3OQL2VIM7MA/graph.json","fetch_events":"https://pith.science/api/pith-number/EV5PRWIV4RJIEBC3OQL2VIM7MA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA/action/storage_attestation","attest_author":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA/action/author_attestation","sign_citation":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA/action/citation_signature","submit_replication":"https://pith.science/pith/EV5PRWIV4RJIEBC3OQL2VIM7MA/action/replication_record"}},"created_at":"2026-07-05T02:32:28.161432+00:00","updated_at":"2026-07-05T02:32:28.161432+00:00"}