{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FNVAOKMF4HSQ4WMRYQRIZN2D5W","short_pith_number":"pith:FNVAOKMF","schema_version":"1.0","canonical_sha256":"2b6a072985e1e50e5991c4228cb743eda0d31a84b4224c3bf5cfd0e2d639e7ed","source":{"kind":"arxiv","id":"2409.02673","version":1},"attestation_state":"computed","paper":{"title":"A Parareal algorithm without Coarse Propagator?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Mario Ohlberger, Martin J. Gander, Stephan Rave","submitted_at":"2024-09-04T13:02:51Z","abstract_excerpt":"The Parareal algorithm was invented in 2001 in order to parallelize the solution of evolution problems in the time direction. It is based on parallel fine time propagators called F and sequential coarse time propagators called G, which alternatingly solve the evolution problem and iteratively converge to the fine solution. The coarse propagator G is a very important component of Parareal, as one sees in the convergence analyses. We present here for the first time a Parareal algorithm without coarse propagator, and explain why this can work very well for parabolic problems. We give a new conver"},"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":"2409.02673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-09-04T13:02:51Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0b8e5da9e7bf03940d2bc3edad96110969e0f3017b56f3568aaf5b7a514ae666","abstract_canon_sha256":"76ad5bcb19c110dc64aea1460fc0f25b9750380512b214526c2042c54d84c498"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:08.481304Z","signature_b64":"qXRLDfQVlxkBSvb4w84+MnU2cy/GOAxnMSFEvaHEW09WGOqhtvW/Pnf+bdOggwb2MFLJmmZkBzRM44c7FL4JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b6a072985e1e50e5991c4228cb743eda0d31a84b4224c3bf5cfd0e2d639e7ed","last_reissued_at":"2026-07-05T09:03:08.480890Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:08.480890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parareal algorithm without Coarse Propagator?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Mario Ohlberger, Martin J. Gander, Stephan Rave","submitted_at":"2024-09-04T13:02:51Z","abstract_excerpt":"The Parareal algorithm was invented in 2001 in order to parallelize the solution of evolution problems in the time direction. It is based on parallel fine time propagators called F and sequential coarse time propagators called G, which alternatingly solve the evolution problem and iteratively converge to the fine solution. The coarse propagator G is a very important component of Parareal, as one sees in the convergence analyses. We present here for the first time a Parareal algorithm without coarse propagator, and explain why this can work very well for parabolic problems. We give a new conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02673","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/2409.02673/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":"2409.02673","created_at":"2026-07-05T09:03:08.480947+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02673v1","created_at":"2026-07-05T09:03:08.480947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02673","created_at":"2026-07-05T09:03:08.480947+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNVAOKMF4HSQ","created_at":"2026-07-05T09:03:08.480947+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNVAOKMF4HSQ4WMR","created_at":"2026-07-05T09:03:08.480947+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNVAOKMF","created_at":"2026-07-05T09:03:08.480947+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.08873","citing_title":"A Parareal Algorithm with Low-Rank Coarse Solvers","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W","json":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W.json","graph_json":"https://pith.science/api/pith-number/FNVAOKMF4HSQ4WMRYQRIZN2D5W/graph.json","events_json":"https://pith.science/api/pith-number/FNVAOKMF4HSQ4WMRYQRIZN2D5W/events.json","paper":"https://pith.science/paper/FNVAOKMF"},"agent_actions":{"view_html":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W","download_json":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W.json","view_paper":"https://pith.science/paper/FNVAOKMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02673&json=true","fetch_graph":"https://pith.science/api/pith-number/FNVAOKMF4HSQ4WMRYQRIZN2D5W/graph.json","fetch_events":"https://pith.science/api/pith-number/FNVAOKMF4HSQ4WMRYQRIZN2D5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W/action/storage_attestation","attest_author":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W/action/author_attestation","sign_citation":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W/action/citation_signature","submit_replication":"https://pith.science/pith/FNVAOKMF4HSQ4WMRYQRIZN2D5W/action/replication_record"}},"created_at":"2026-07-05T09:03:08.480947+00:00","updated_at":"2026-07-05T09:03:08.480947+00:00"}