{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:62VJUCBLIKGK2AUISLR657ZCMA","short_pith_number":"pith:62VJUCBL","canonical_record":{"source":{"id":"1212.4703","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SY","submitted_at":"2012-12-19T15:21:13Z","cross_cats_sorted":["math.CA","math.NA"],"title_canon_sha256":"dcc1af7f5b510a1e5e6f563de0414ffd5e3c9596bc7bbfd2eaeda905af4f4321","abstract_canon_sha256":"89e9398f1175d00b98c0efc7cda60cd1ca7caec36b30ae0b171b5235c868af0a"},"schema_version":"1.0"},"canonical_sha256":"f6aa9a082b428cad028892e3eeff22602bc23940e453e96af20ca52e7d8a9e26","source":{"kind":"arxiv","id":"1212.4703","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4703","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4703v2","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4703","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"62VJUCBLIKGK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"62VJUCBLIKGK2AUI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"62VJUCBL","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:62VJUCBLIKGK2AUISLR657ZCMA","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4703","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SY","submitted_at":"2012-12-19T15:21:13Z","cross_cats_sorted":["math.CA","math.NA"],"title_canon_sha256":"dcc1af7f5b510a1e5e6f563de0414ffd5e3c9596bc7bbfd2eaeda905af4f4321","abstract_canon_sha256":"89e9398f1175d00b98c0efc7cda60cd1ca7caec36b30ae0b171b5235c868af0a"},"schema_version":"1.0"},"canonical_sha256":"f6aa9a082b428cad028892e3eeff22602bc23940e453e96af20ca52e7d8a9e26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:57.536547Z","signature_b64":"UGA63wyIcSxh2QpojtdOWmfPEdKTMQqUlRH5tPDXZ2qiwYRm3P+uwctXjZGqPFRChyaJv9d8dw/zs/WWrqt4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6aa9a082b428cad028892e3eeff22602bc23940e453e96af20ca52e7d8a9e26","last_reissued_at":"2026-05-18T02:58:57.535626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:57.535626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4703","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-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACeTTIN/l/0G92+jFENECZIJRaXtGwuM7g1uVtjXTbO2CzNH8lSl0iVTuDbzMFfKxokNcItsP3HzQpiX8E8KBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:13.107992Z"},"content_sha256":"586ec111e3d140515f66af36aa90f18a436137598cedaeed442f2462d7889346","schema_version":"1.0","event_id":"sha256:586ec111e3d140515f66af36aa90f18a436137598cedaeed442f2462d7889346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:62VJUCBLIKGK2AUISLR657ZCMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-explicit Parareal method based on convergence acceleration technique","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.CA","math.NA"],"primary_cat":"cs.SY","authors_text":"Lo\\\"ic Michel","submitted_at":"2012-12-19T15:21:13Z","abstract_excerpt":"The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We report a derivation of the Parareal method that uses a convergence acceleration technique to improve the accuracy of the solution. Our approach uses firstly an explicit ODE solver to perform the parallel computations with different time-steps and then, a decomposition of the solution into specific convergent series, based on an extrapolation method, allows "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4703","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTX6VkbDjLODP3bqyzzJfqI7PNmDkJ+OmX6XKLS6VPXKL4HCJ6Lbl8NT5E8ZQ2P6o7zBQFP4XJpHmfjQJeHmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:13.108742Z"},"content_sha256":"ef83dff160ab8812f2f8a692ed06618b35b0602d4260e37b2225d090a50f2cf3","schema_version":"1.0","event_id":"sha256:ef83dff160ab8812f2f8a692ed06618b35b0602d4260e37b2225d090a50f2cf3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62VJUCBLIKGK2AUISLR657ZCMA/bundle.json","state_url":"https://pith.science/pith/62VJUCBLIKGK2AUISLR657ZCMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62VJUCBLIKGK2AUISLR657ZCMA/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-05-30T10:43:13Z","links":{"resolver":"https://pith.science/pith/62VJUCBLIKGK2AUISLR657ZCMA","bundle":"https://pith.science/pith/62VJUCBLIKGK2AUISLR657ZCMA/bundle.json","state":"https://pith.science/pith/62VJUCBLIKGK2AUISLR657ZCMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62VJUCBLIKGK2AUISLR657ZCMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:62VJUCBLIKGK2AUISLR657ZCMA","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":"89e9398f1175d00b98c0efc7cda60cd1ca7caec36b30ae0b171b5235c868af0a","cross_cats_sorted":["math.CA","math.NA"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SY","submitted_at":"2012-12-19T15:21:13Z","title_canon_sha256":"dcc1af7f5b510a1e5e6f563de0414ffd5e3c9596bc7bbfd2eaeda905af4f4321"},"schema_version":"1.0","source":{"id":"1212.4703","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4703","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4703v2","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4703","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"62VJUCBLIKGK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"62VJUCBLIKGK2AUI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"62VJUCBL","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ef83dff160ab8812f2f8a692ed06618b35b0602d4260e37b2225d090a50f2cf3","target":"graph","created_at":"2026-05-18T02:58:57Z","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"},"paper":{"abstract_excerpt":"The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We report a derivation of the Parareal method that uses a convergence acceleration technique to improve the accuracy of the solution. Our approach uses firstly an explicit ODE solver to perform the parallel computations with different time-steps and then, a decomposition of the solution into specific convergent series, based on an extrapolation method, allows ","authors_text":"Lo\\\"ic Michel","cross_cats":["math.CA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SY","submitted_at":"2012-12-19T15:21:13Z","title":"Semi-explicit Parareal method based on convergence acceleration technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4703","kind":"arxiv","version":2},"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:586ec111e3d140515f66af36aa90f18a436137598cedaeed442f2462d7889346","target":"record","created_at":"2026-05-18T02:58:57Z","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":"89e9398f1175d00b98c0efc7cda60cd1ca7caec36b30ae0b171b5235c868af0a","cross_cats_sorted":["math.CA","math.NA"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SY","submitted_at":"2012-12-19T15:21:13Z","title_canon_sha256":"dcc1af7f5b510a1e5e6f563de0414ffd5e3c9596bc7bbfd2eaeda905af4f4321"},"schema_version":"1.0","source":{"id":"1212.4703","kind":"arxiv","version":2}},"canonical_sha256":"f6aa9a082b428cad028892e3eeff22602bc23940e453e96af20ca52e7d8a9e26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6aa9a082b428cad028892e3eeff22602bc23940e453e96af20ca52e7d8a9e26","first_computed_at":"2026-05-18T02:58:57.535626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:57.535626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UGA63wyIcSxh2QpojtdOWmfPEdKTMQqUlRH5tPDXZ2qiwYRm3P+uwctXjZGqPFRChyaJv9d8dw/zs/WWrqt4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:57.536547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4703","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:586ec111e3d140515f66af36aa90f18a436137598cedaeed442f2462d7889346","sha256:ef83dff160ab8812f2f8a692ed06618b35b0602d4260e37b2225d090a50f2cf3"],"state_sha256":"b2e2d804e9462104aba4bc004093468c3fb27d73b5becf1cb5e4bf05f896e5ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogyAyRGdgxR3ZvuAtmxPxB1jhsKkIquxR/oflAABdF1z8DOSDZGoM4/v+ASTEo+ffR38u4xhpGVnqGQzWVWQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:43:13.112204Z","bundle_sha256":"ed993e196c3d72a346d823876081d4e4fd812a6785069aab64a77254241b713d"}}