{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BYLZF7VRLKNWF4YPOLOHRVSXQC","short_pith_number":"pith:BYLZF7VR","schema_version":"1.0","canonical_sha256":"0e1792feb15a9b62f30f72dc78d657808c189cf36c52716dd946e3199b0473b6","source":{"kind":"arxiv","id":"1210.0577","version":2},"attestation_state":"computed","paper":{"title":"Two-step greedy algorithm for reduced order quadratures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc","math.NA"],"primary_cat":"cs.NA","authors_text":"Frank Herrmann, Harbir Antil, Manuel Tiglio, Ricardo H. Nochetto, Scott E. Field","submitted_at":"2012-10-01T21:07:13Z","abstract_excerpt":"We present an algorithm to generate application-specific, global reduced order quadratures (ROQ) for multiple fast evaluations of weighted inner products between parameterized functions. If a reduced basis (RB) or any other projection-based model reduction technique is applied, the dimensionality of integrands is reduced dramatically; however, the cost of approximating the integrands by projection still scales as the size of the original problem. In contrast, using discrete empirical interpolation (DEIM) points as ROQ nodes leads to a computational cost which depends linearly on the dimension "},"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":"1210.0577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-10-01T21:07:13Z","cross_cats_sorted":["gr-qc","math.NA"],"title_canon_sha256":"180e787a91377ee8533324b03fc9a5edfedb8939322bdf5e4d3b160269d254f7","abstract_canon_sha256":"d88d1bd50484dd8290a5d6568c0f62abd52f34efd342dcb6480e5c9298a4b16d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:29.191983Z","signature_b64":"iWtZZ38ouzC422TsQ7Rl+Qk8KGbTH908I3I+4XyfejQHNZ1HSVKf0d9YXB8KkAmqzbaD2zxCbfUV1beuj2edBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e1792feb15a9b62f30f72dc78d657808c189cf36c52716dd946e3199b0473b6","last_reissued_at":"2026-05-18T02:42:29.191128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:29.191128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-step greedy algorithm for reduced order quadratures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc","math.NA"],"primary_cat":"cs.NA","authors_text":"Frank Herrmann, Harbir Antil, Manuel Tiglio, Ricardo H. Nochetto, Scott E. Field","submitted_at":"2012-10-01T21:07:13Z","abstract_excerpt":"We present an algorithm to generate application-specific, global reduced order quadratures (ROQ) for multiple fast evaluations of weighted inner products between parameterized functions. If a reduced basis (RB) or any other projection-based model reduction technique is applied, the dimensionality of integrands is reduced dramatically; however, the cost of approximating the integrands by projection still scales as the size of the original problem. In contrast, using discrete empirical interpolation (DEIM) points as ROQ nodes leads to a computational cost which depends linearly on the dimension "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0577","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":"1210.0577","created_at":"2026-05-18T02:42:29.191279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0577v2","created_at":"2026-05-18T02:42:29.191279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0577","created_at":"2026-05-18T02:42:29.191279+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYLZF7VRLKNW","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYLZF7VRLKNWF4YP","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYLZF7VR","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.14849","citing_title":"A Robust and Efficient F-statistic-based Framework for Consistent Bayesian Inference of Compact Binary Coalescences","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2004.06503","citing_title":"Computationally efficient models for the dominant and sub-dominant harmonic modes of precessing binary black holes","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC","json":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC.json","graph_json":"https://pith.science/api/pith-number/BYLZF7VRLKNWF4YPOLOHRVSXQC/graph.json","events_json":"https://pith.science/api/pith-number/BYLZF7VRLKNWF4YPOLOHRVSXQC/events.json","paper":"https://pith.science/paper/BYLZF7VR"},"agent_actions":{"view_html":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC","download_json":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC.json","view_paper":"https://pith.science/paper/BYLZF7VR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0577&json=true","fetch_graph":"https://pith.science/api/pith-number/BYLZF7VRLKNWF4YPOLOHRVSXQC/graph.json","fetch_events":"https://pith.science/api/pith-number/BYLZF7VRLKNWF4YPOLOHRVSXQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC/action/storage_attestation","attest_author":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC/action/author_attestation","sign_citation":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC/action/citation_signature","submit_replication":"https://pith.science/pith/BYLZF7VRLKNWF4YPOLOHRVSXQC/action/replication_record"}},"created_at":"2026-05-18T02:42:29.191279+00:00","updated_at":"2026-05-18T02:42:29.191279+00:00"}