{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EC2MWHZXERZKGLJG2J3TCLDCF7","short_pith_number":"pith:EC2MWHZX","schema_version":"1.0","canonical_sha256":"20b4cb1f372472a32d26d277312c622fdb559abfbd6ab6b6231b8ef6c39bf20b","source":{"kind":"arxiv","id":"1601.00137","version":2},"attestation_state":"computed","paper":{"title":"A goal-oriented RBM-Accelerated generalized polynomial chaos algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Akil Narayan, Jiahua Jiang, Yanlai Chen","submitted_at":"2016-01-02T04:46:28Z","abstract_excerpt":"The non-intrusive generalized Polynomial Chaos (gPC) method is a popular computational approach for solving partial differential equations (PDEs) with random inputs. The main hurdle preventing its efficient direct application for high-dimensional input parameters is that the size of many parametric sampling meshes grows exponentially in the number of inputs (the \"curse of dimensionality\"). In this paper, we design a weighted version of the reduced basis method (RBM) for use in the non-intrusive gPC framework. We construct an RBM surrogate that can rigorously achieve a user-prescribed error tol"},"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":"1601.00137","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-02T04:46:28Z","cross_cats_sorted":[],"title_canon_sha256":"4efb15dde9571fd59bc38dbe999ea70b537d67c0783457b85b71c11e138026ba","abstract_canon_sha256":"b428612d7a450300d0e07194511f855e8e42a017779b0aeb28a96ad218902f4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:33.030664Z","signature_b64":"uu1tpOzAbSMl1ufNnhxPeM48iNNGjmWAcZ7TFwTvLfeDJOSVpuaS3ldV09xkTs/RCFK0Z520wSPWK3y3flLaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20b4cb1f372472a32d26d277312c622fdb559abfbd6ab6b6231b8ef6c39bf20b","last_reissued_at":"2026-05-18T01:04:33.029760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:33.029760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A goal-oriented RBM-Accelerated generalized polynomial chaos algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Akil Narayan, Jiahua Jiang, Yanlai Chen","submitted_at":"2016-01-02T04:46:28Z","abstract_excerpt":"The non-intrusive generalized Polynomial Chaos (gPC) method is a popular computational approach for solving partial differential equations (PDEs) with random inputs. The main hurdle preventing its efficient direct application for high-dimensional input parameters is that the size of many parametric sampling meshes grows exponentially in the number of inputs (the \"curse of dimensionality\"). In this paper, we design a weighted version of the reduced basis method (RBM) for use in the non-intrusive gPC framework. We construct an RBM surrogate that can rigorously achieve a user-prescribed error tol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00137","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.00137","created_at":"2026-05-18T01:04:33.029913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00137v2","created_at":"2026-05-18T01:04:33.029913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00137","created_at":"2026-05-18T01:04:33.029913+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC2MWHZXERZK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC2MWHZXERZKGLJG","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC2MWHZX","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7","json":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7.json","graph_json":"https://pith.science/api/pith-number/EC2MWHZXERZKGLJG2J3TCLDCF7/graph.json","events_json":"https://pith.science/api/pith-number/EC2MWHZXERZKGLJG2J3TCLDCF7/events.json","paper":"https://pith.science/paper/EC2MWHZX"},"agent_actions":{"view_html":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7","download_json":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7.json","view_paper":"https://pith.science/paper/EC2MWHZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00137&json=true","fetch_graph":"https://pith.science/api/pith-number/EC2MWHZXERZKGLJG2J3TCLDCF7/graph.json","fetch_events":"https://pith.science/api/pith-number/EC2MWHZXERZKGLJG2J3TCLDCF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7/action/storage_attestation","attest_author":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7/action/author_attestation","sign_citation":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7/action/citation_signature","submit_replication":"https://pith.science/pith/EC2MWHZXERZKGLJG2J3TCLDCF7/action/replication_record"}},"created_at":"2026-05-18T01:04:33.029913+00:00","updated_at":"2026-05-18T01:04:33.029913+00:00"}