{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VNPLBMW6JL3RH6JBRGRRWLNAB3","short_pith_number":"pith:VNPLBMW6","schema_version":"1.0","canonical_sha256":"ab5eb0b2de4af713f92189a31b2da00ee7573bfc925c1c2f7ce6a37fddb04d64","source":{"kind":"arxiv","id":"2605.28059","version":1},"attestation_state":"computed","paper":{"title":"Convergence analysis of a parareal algorithm with multistep fine propagator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Georgios Akrivis, Qingle Lin, Zhi Zhou","submitted_at":"2026-05-27T07:07:01Z","abstract_excerpt":"The parareal algorithm is a powerful parallel-in-time integration method that accelerates the numerical solution of evolution equations by iteratively combining a fine propagator and a coarse propagator. Although the convergence of the parareal algorithm has been extensively studied, most existing analyses assume that the fine propagator is either an exact solver or a single-step method. In this paper, we construct and analyze a parareal algorithm for solving parabolic equations, where the fine propagator is based on the two-step backward differentiation formula (BDF2), while the coarse propag"},"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":"2605.28059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-27T07:07:01Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a6dee1ee591c7c845fead191c63737c21457f3dd7d24d81777bf2e80ca12cc7f","abstract_canon_sha256":"ddcf592917b19c537c2ee7c767c14f4ed6219b8ac13c7e96da53cc6ac37e94c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:57.349518Z","signature_b64":"AezT0xyjFUxPTDjVaNK2qwRhi1+4CzVBl7rrAL2KPBAJWvB0gcsZHmLvo6Nz1oPsTu316wTLHcVx+dgvqDnUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab5eb0b2de4af713f92189a31b2da00ee7573bfc925c1c2f7ce6a37fddb04d64","last_reissued_at":"2026-05-28T01:04:57.349092Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:57.349092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence analysis of a parareal algorithm with multistep fine propagator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Georgios Akrivis, Qingle Lin, Zhi Zhou","submitted_at":"2026-05-27T07:07:01Z","abstract_excerpt":"The parareal algorithm is a powerful parallel-in-time integration method that accelerates the numerical solution of evolution equations by iteratively combining a fine propagator and a coarse propagator. Although the convergence of the parareal algorithm has been extensively studied, most existing analyses assume that the fine propagator is either an exact solver or a single-step method. In this paper, we construct and analyze a parareal algorithm for solving parabolic equations, where the fine propagator is based on the two-step backward differentiation formula (BDF2), while the coarse propag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28059","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/2605.28059/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":"2605.28059","created_at":"2026-05-28T01:04:57.349152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28059v1","created_at":"2026-05-28T01:04:57.349152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28059","created_at":"2026-05-28T01:04:57.349152+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNPLBMW6JL3R","created_at":"2026-05-28T01:04:57.349152+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNPLBMW6JL3RH6JB","created_at":"2026-05-28T01:04:57.349152+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNPLBMW6","created_at":"2026-05-28T01:04:57.349152+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/VNPLBMW6JL3RH6JBRGRRWLNAB3","json":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3.json","graph_json":"https://pith.science/api/pith-number/VNPLBMW6JL3RH6JBRGRRWLNAB3/graph.json","events_json":"https://pith.science/api/pith-number/VNPLBMW6JL3RH6JBRGRRWLNAB3/events.json","paper":"https://pith.science/paper/VNPLBMW6"},"agent_actions":{"view_html":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3","download_json":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3.json","view_paper":"https://pith.science/paper/VNPLBMW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28059&json=true","fetch_graph":"https://pith.science/api/pith-number/VNPLBMW6JL3RH6JBRGRRWLNAB3/graph.json","fetch_events":"https://pith.science/api/pith-number/VNPLBMW6JL3RH6JBRGRRWLNAB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3/action/storage_attestation","attest_author":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3/action/author_attestation","sign_citation":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3/action/citation_signature","submit_replication":"https://pith.science/pith/VNPLBMW6JL3RH6JBRGRRWLNAB3/action/replication_record"}},"created_at":"2026-05-28T01:04:57.349152+00:00","updated_at":"2026-05-28T01:04:57.349152+00:00"}