{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5Q26RFBFOE7XABX7HNJHW7KQMA","short_pith_number":"pith:5Q26RFBF","schema_version":"1.0","canonical_sha256":"ec35e89425713f7006ff3b527b7d5060116d92e25fede2c7f1880ad17da75fbf","source":{"kind":"arxiv","id":"2407.11631","version":4},"attestation_state":"computed","paper":{"title":"A parallel batch greedy algorithm in reduced basis methods: Convergence rates and numerical results","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"J\\\"urgen Vorloeper, Karsten Urban, Niklas Reich","submitted_at":"2024-07-16T11:50:04Z","abstract_excerpt":"The \"classical\" (weak) greedy algorithm is widely used within model order reduction in order to compute a reduced basis in the offline training phase: An a posteriori error estimator is maximized and the snapshot corresponding to the maximizer is added to the basis. Since these snapshots are determined by a sufficiently detailed discretization, the offline phase is often computationally extremely costly. We suggest to replace the serial determination of one snapshot after the other by a parallel approach. In order to do so, we introduce a batch size $b$ and add $b$ snapshots to the current bas"},"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":"2407.11631","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T11:50:04Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"dc5ce7cdfb7ac95d6acacb372809e5a27977878d77bc4d63e79c69159d7bfa27","abstract_canon_sha256":"2a3d44ff38f7db20e5334f7f15dd39ece173f5c5321fa4aee1b39430aa82f8c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:32.361364Z","signature_b64":"/DboeUTNxKW5+ZZcJEsVfnVnPapwubraHNf7KnYx0LZ5QKqctnDVLFYoi94vawvAKoxbuiqcgRdGFkcuIVptAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec35e89425713f7006ff3b527b7d5060116d92e25fede2c7f1880ad17da75fbf","last_reissued_at":"2026-05-27T01:05:32.360663Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:32.360663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A parallel batch greedy algorithm in reduced basis methods: Convergence rates and numerical results","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"J\\\"urgen Vorloeper, Karsten Urban, Niklas Reich","submitted_at":"2024-07-16T11:50:04Z","abstract_excerpt":"The \"classical\" (weak) greedy algorithm is widely used within model order reduction in order to compute a reduced basis in the offline training phase: An a posteriori error estimator is maximized and the snapshot corresponding to the maximizer is added to the basis. Since these snapshots are determined by a sufficiently detailed discretization, the offline phase is often computationally extremely costly. We suggest to replace the serial determination of one snapshot after the other by a parallel approach. In order to do so, we introduce a batch size $b$ and add $b$ snapshots to the current bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11631","kind":"arxiv","version":4},"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/2407.11631/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":"2407.11631","created_at":"2026-05-27T01:05:32.360760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.11631v4","created_at":"2026-05-27T01:05:32.360760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11631","created_at":"2026-05-27T01:05:32.360760+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q26RFBFOE7X","created_at":"2026-05-27T01:05:32.360760+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q26RFBFOE7XABX7","created_at":"2026-05-27T01:05:32.360760+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q26RFBF","created_at":"2026-05-27T01:05:32.360760+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/5Q26RFBFOE7XABX7HNJHW7KQMA","json":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA.json","graph_json":"https://pith.science/api/pith-number/5Q26RFBFOE7XABX7HNJHW7KQMA/graph.json","events_json":"https://pith.science/api/pith-number/5Q26RFBFOE7XABX7HNJHW7KQMA/events.json","paper":"https://pith.science/paper/5Q26RFBF"},"agent_actions":{"view_html":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA","download_json":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA.json","view_paper":"https://pith.science/paper/5Q26RFBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.11631&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q26RFBFOE7XABX7HNJHW7KQMA/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q26RFBFOE7XABX7HNJHW7KQMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA/action/storage_attestation","attest_author":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA/action/author_attestation","sign_citation":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA/action/citation_signature","submit_replication":"https://pith.science/pith/5Q26RFBFOE7XABX7HNJHW7KQMA/action/replication_record"}},"created_at":"2026-05-27T01:05:32.360760+00:00","updated_at":"2026-05-27T01:05:32.360760+00:00"}