{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5Q26RFBFOE7XABX7HNJHW7KQMA","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":"2a3d44ff38f7db20e5334f7f15dd39ece173f5c5321fa4aee1b39430aa82f8c3","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T11:50:04Z","title_canon_sha256":"dc5ce7cdfb7ac95d6acacb372809e5a27977878d77bc4d63e79c69159d7bfa27"},"schema_version":"1.0","source":{"id":"2407.11631","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.11631","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2407.11631v4","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11631","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"5Q26RFBFOE7X","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"5Q26RFBFOE7XABX7","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"5Q26RFBF","created_at":"2026-05-27T01:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:46186fc65defb513e7d4f79aacae0af6322ba158cccff134fe7b8af12299a343","target":"graph","created_at":"2026-05-27T01:05:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.11631/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"J\\\"urgen Vorloeper, Karsten Urban, Niklas Reich","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T11:50:04Z","title":"A parallel batch greedy algorithm in reduced basis methods: Convergence rates and numerical results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11631","kind":"arxiv","version":4},"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:dd286325506f735057514b9e077c4f1158e203215b059ad82fa666b66501c167","target":"record","created_at":"2026-05-27T01:05:32Z","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":"2a3d44ff38f7db20e5334f7f15dd39ece173f5c5321fa4aee1b39430aa82f8c3","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T11:50:04Z","title_canon_sha256":"dc5ce7cdfb7ac95d6acacb372809e5a27977878d77bc4d63e79c69159d7bfa27"},"schema_version":"1.0","source":{"id":"2407.11631","kind":"arxiv","version":4}},"canonical_sha256":"ec35e89425713f7006ff3b527b7d5060116d92e25fede2c7f1880ad17da75fbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec35e89425713f7006ff3b527b7d5060116d92e25fede2c7f1880ad17da75fbf","first_computed_at":"2026-05-27T01:05:32.360663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:32.360663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/DboeUTNxKW5+ZZcJEsVfnVnPapwubraHNf7KnYx0LZ5QKqctnDVLFYoi94vawvAKoxbuiqcgRdGFkcuIVptAw==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:32.361364Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.11631","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd286325506f735057514b9e077c4f1158e203215b059ad82fa666b66501c167","sha256:46186fc65defb513e7d4f79aacae0af6322ba158cccff134fe7b8af12299a343"],"state_sha256":"88d86990e3ddb28f8ccb6a01a43084629b2e69ccd5156fe7e18ec6cd6ba9ce38"}