{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YSFYEGZGBXN7QSJF5NAPKVRSIR","short_pith_number":"pith:YSFYEGZG","canonical_record":{"source":{"id":"2605.11979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-12T11:33:59Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6315b20d3d39d59f2069802f2ba7d66c3cb01821332c8d6b8217fc595ccb2421","abstract_canon_sha256":"b9f8a2004913b92dbe4d555d63dfeadc7fd933ec064c4fe6d0595ce3ad21cf19"},"schema_version":"1.0"},"canonical_sha256":"c48b821b260ddbf84925eb40f556324440acca5ef1f2a7b507faef92583ee180","source":{"kind":"arxiv","id":"2605.11979","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11979","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11979v2","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11979","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"YSFYEGZGBXN7","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"YSFYEGZGBXN7QSJF","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"YSFYEGZG","created_at":"2026-05-20T00:03:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YSFYEGZGBXN7QSJF5NAPKVRSIR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.11979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-12T11:33:59Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6315b20d3d39d59f2069802f2ba7d66c3cb01821332c8d6b8217fc595ccb2421","abstract_canon_sha256":"b9f8a2004913b92dbe4d555d63dfeadc7fd933ec064c4fe6d0595ce3ad21cf19"},"schema_version":"1.0"},"canonical_sha256":"c48b821b260ddbf84925eb40f556324440acca5ef1f2a7b507faef92583ee180","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:18.142632Z","signature_b64":"V1kB7NeA/11FpxHTGPOKi1Smgah6ZTNomuwA4f7Gy+KO0TInkQOJtaMFsmM+briGs2IMK1afmWqZcd18VBtsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c48b821b260ddbf84925eb40f556324440acca5ef1f2a7b507faef92583ee180","last_reissued_at":"2026-05-20T00:03:18.141707Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:18.141707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.11979","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTZNr/82amHdFYOjMwJpYGkgymgWF7wyyJ2LB4n+fO+lKVgE/TifpNV3DV9jGli/g684oX+UoXd7YBhPZfx5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:14:10.796974Z"},"content_sha256":"f15be03bacff01785c3287a090246b1d509ffbf0fafc9545d9a9e71ec7adccae","schema_version":"1.0","event_id":"sha256:f15be03bacff01785c3287a090246b1d509ffbf0fafc9545d9a9e71ec7adccae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YSFYEGZGBXN7QSJF5NAPKVRSIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimized Two-Step Coarse Propagators in Parareal Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An optimized two-step coarse propagator reduces parareal convergence factor to approximately 0.0064","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Guanglian Li, Kai Zhang, Qingle Lin, Zhi Zhou","submitted_at":"2026-05-12T11:33:59Z","abstract_excerpt":"In this work, we propose a novel framework for accelerating the parareal algorithm, in which the coarse propagator is formulated as a two-step method and optimized with respect to the convergence factor.} We derive a rigorous error estimate for the proposed two-step parareal algorithm, yielding an explicit bound on the linear convergence factor. This estimate is not only of theoretical interest: it provides a quantitative guideline for selecting and designing coarse propagators. Guided by this estimate, we {consider the linear parabolic equation as an illustrative example and }construct an opt"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting method attains an optimized convergence factor of approximately 0.0064, substantially smaller than that of commonly used practical coarse propagators in the classical parareal setting, while keeping the computational cost moderate.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the two-step coarse propagator optimized via the derived error bound will deliver the stated fast convergence on general linear and nonlinear parabolic problems without hidden costs or stability issues that the bound does not capture.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A two-step optimized coarse propagator for parareal algorithms achieves a convergence factor of about 0.0064 on parabolic PDEs, far below standard choices while maintaining moderate cost.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An optimized two-step coarse propagator reduces parareal convergence factor to approximately 0.0064","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"76eaf15846810927bc9c4ec1bffac19cbf1d232eb1b7e0202f50c61edb82bc50"},"source":{"id":"2605.11979","kind":"arxiv","version":2},"verdict":{"id":"921f01ab-087f-4f20-9a8a-db9a6fb349f1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T04:43:25.644955Z","strongest_claim":"The resulting method attains an optimized convergence factor of approximately 0.0064, substantially smaller than that of commonly used practical coarse propagators in the classical parareal setting, while keeping the computational cost moderate.","one_line_summary":"A two-step optimized coarse propagator for parareal algorithms achieves a convergence factor of about 0.0064 on parabolic PDEs, far below standard choices while maintaining moderate cost.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the two-step coarse propagator optimized via the derived error bound will deliver the stated fast convergence on general linear and nonlinear parabolic problems without hidden costs or stability issues that the bound does not capture.","pith_extraction_headline":"An optimized two-step coarse propagator reduces parareal convergence factor to approximately 0.0064"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11979/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T11:34:48.858403Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T09:01:17.138424Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:02:28.107988Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c2798a6817ec4c73d61a00d6684480a82fe162eecc073256f38b4b47d7980e8e"},"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"},"verdict_id":"921f01ab-087f-4f20-9a8a-db9a6fb349f1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dc0CFMBTKmRBCc1CL9qZa4PNiGQzGH2R+qImJ0UHoLLb+c8XTIu4+lVCqEsP40dHPScB4J+x6UL2R6PazoW9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:14:10.798093Z"},"content_sha256":"471d1a9884b8b608703be9644b9f3444a13f34de8a320a314692d20a5d60dc36","schema_version":"1.0","event_id":"sha256:471d1a9884b8b608703be9644b9f3444a13f34de8a320a314692d20a5d60dc36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSFYEGZGBXN7QSJF5NAPKVRSIR/bundle.json","state_url":"https://pith.science/pith/YSFYEGZGBXN7QSJF5NAPKVRSIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSFYEGZGBXN7QSJF5NAPKVRSIR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T16:14:10Z","links":{"resolver":"https://pith.science/pith/YSFYEGZGBXN7QSJF5NAPKVRSIR","bundle":"https://pith.science/pith/YSFYEGZGBXN7QSJF5NAPKVRSIR/bundle.json","state":"https://pith.science/pith/YSFYEGZGBXN7QSJF5NAPKVRSIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSFYEGZGBXN7QSJF5NAPKVRSIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YSFYEGZGBXN7QSJF5NAPKVRSIR","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":"b9f8a2004913b92dbe4d555d63dfeadc7fd933ec064c4fe6d0595ce3ad21cf19","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-12T11:33:59Z","title_canon_sha256":"6315b20d3d39d59f2069802f2ba7d66c3cb01821332c8d6b8217fc595ccb2421"},"schema_version":"1.0","source":{"id":"2605.11979","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11979","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11979v2","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11979","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"YSFYEGZGBXN7","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"YSFYEGZGBXN7QSJF","created_at":"2026-05-20T00:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"YSFYEGZG","created_at":"2026-05-20T00:03:18Z"}],"graph_snapshots":[{"event_id":"sha256:471d1a9884b8b608703be9644b9f3444a13f34de8a320a314692d20a5d60dc36","target":"graph","created_at":"2026-05-20T00:03:18Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The resulting method attains an optimized convergence factor of approximately 0.0064, substantially smaller than that of commonly used practical coarse propagators in the classical parareal setting, while keeping the computational cost moderate."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the two-step coarse propagator optimized via the derived error bound will deliver the stated fast convergence on general linear and nonlinear parabolic problems without hidden costs or stability issues that the bound does not capture."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A two-step optimized coarse propagator for parareal algorithms achieves a convergence factor of about 0.0064 on parabolic PDEs, far below standard choices while maintaining moderate cost."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An optimized two-step coarse propagator reduces parareal convergence factor to approximately 0.0064"}],"snapshot_sha256":"76eaf15846810927bc9c4ec1bffac19cbf1d232eb1b7e0202f50c61edb82bc50"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T11:34:48.858403Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T09:01:17.138424Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T08:02:28.107988Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.11979/integrity.json","findings":[],"snapshot_sha256":"c2798a6817ec4c73d61a00d6684480a82fe162eecc073256f38b4b47d7980e8e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we propose a novel framework for accelerating the parareal algorithm, in which the coarse propagator is formulated as a two-step method and optimized with respect to the convergence factor.} We derive a rigorous error estimate for the proposed two-step parareal algorithm, yielding an explicit bound on the linear convergence factor. This estimate is not only of theoretical interest: it provides a quantitative guideline for selecting and designing coarse propagators. Guided by this estimate, we {consider the linear parabolic equation as an illustrative example and }construct an opt","authors_text":"Guanglian Li, Kai Zhang, Qingle Lin, Zhi Zhou","cross_cats":["cs.NA"],"headline":"An optimized two-step coarse propagator reduces parareal convergence factor to approximately 0.0064","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-12T11:33:59Z","title":"Optimized Two-Step Coarse Propagators in Parareal Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.11979","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T04:43:25.644955Z","id":"921f01ab-087f-4f20-9a8a-db9a6fb349f1","model_set":{"reader":"grok-4.3"},"one_line_summary":"A two-step optimized coarse propagator for parareal algorithms achieves a convergence factor of about 0.0064 on parabolic PDEs, far below standard choices while maintaining moderate cost.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An optimized two-step coarse propagator reduces parareal convergence factor to approximately 0.0064","strongest_claim":"The resulting method attains an optimized convergence factor of approximately 0.0064, substantially smaller than that of commonly used practical coarse propagators in the classical parareal setting, while keeping the computational cost moderate.","weakest_assumption":"That the two-step coarse propagator optimized via the derived error bound will deliver the stated fast convergence on general linear and nonlinear parabolic problems without hidden costs or stability issues that the bound does not capture."}},"verdict_id":"921f01ab-087f-4f20-9a8a-db9a6fb349f1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f15be03bacff01785c3287a090246b1d509ffbf0fafc9545d9a9e71ec7adccae","target":"record","created_at":"2026-05-20T00:03:18Z","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":"b9f8a2004913b92dbe4d555d63dfeadc7fd933ec064c4fe6d0595ce3ad21cf19","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-12T11:33:59Z","title_canon_sha256":"6315b20d3d39d59f2069802f2ba7d66c3cb01821332c8d6b8217fc595ccb2421"},"schema_version":"1.0","source":{"id":"2605.11979","kind":"arxiv","version":2}},"canonical_sha256":"c48b821b260ddbf84925eb40f556324440acca5ef1f2a7b507faef92583ee180","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c48b821b260ddbf84925eb40f556324440acca5ef1f2a7b507faef92583ee180","first_computed_at":"2026-05-20T00:03:18.141707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:18.141707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V1kB7NeA/11FpxHTGPOKi1Smgah6ZTNomuwA4f7Gy+KO0TInkQOJtaMFsmM+briGs2IMK1afmWqZcd18VBtsCA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:18.142632Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.11979","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f15be03bacff01785c3287a090246b1d509ffbf0fafc9545d9a9e71ec7adccae","sha256:471d1a9884b8b608703be9644b9f3444a13f34de8a320a314692d20a5d60dc36"],"state_sha256":"d8c42f9b8285b1dbd4f996881705fcb4ea4cecf3d34f37aadd8d74cd50c922eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzEcOd0ZOlWPlfpZ3BgIrZUu93AR9rNIxhCzfzzZ85lbIr3ikHp704XulhuyPRRko4TQXQtSAZSXkmv4TZMQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:14:10.801866Z","bundle_sha256":"3ddcaeef529ffdcd0119145b126f42082bba5d4a6ae808e3a6d8ba3212b604f7"}}