{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:234225VKS65IWOMLN4AL45QGLM","short_pith_number":"pith:234225VK","schema_version":"1.0","canonical_sha256":"d6f9ad76aa97ba8b398b6f00be76065b00bf3d9ad9a01a7d1b96074dfbd5257f","source":{"kind":"arxiv","id":"1907.01198","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous Parareal Algorithm Applied to European Option Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Frederic Magoules, Guillaume Gbikpi-Benissan, Qinmeng Zou","submitted_at":"2019-07-02T07:01:19Z","abstract_excerpt":"Asynchronous iterations arise naturally in parallel computing if one wants to solve large problems with a minimization of the idle times. This paper presents an original model of asynchronous iterations for a time-domain decomposition method, namely the parareal method. The asynchronous parareal algorithm is here applied to European option pricing, and numerical experiments performed on a parallel supercomputer, illustrate the performance and efficiency of this new method."},"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":"1907.01198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-02T07:01:19Z","cross_cats_sorted":[],"title_canon_sha256":"27d5047ca031551d880394e981febbf287e1a14a5fca2f8a4b21a277bf59914d","abstract_canon_sha256":"493b7eea49f8ec41d38c97a305815c20a1f36070a5bcf8964f71c8ecda9530c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:54.943299Z","signature_b64":"Yuaekdzk+Wit4fYOOhRyN4cFKE2U4IrYOhHWaClKtruVVgj4yIDnPetaJ4zOmNinkYpHUdTrgoTKJ3yXGEMFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6f9ad76aa97ba8b398b6f00be76065b00bf3d9ad9a01a7d1b96074dfbd5257f","last_reissued_at":"2026-05-17T23:40:54.942646Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:54.942646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Parareal Algorithm Applied to European Option Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Frederic Magoules, Guillaume Gbikpi-Benissan, Qinmeng Zou","submitted_at":"2019-07-02T07:01:19Z","abstract_excerpt":"Asynchronous iterations arise naturally in parallel computing if one wants to solve large problems with a minimization of the idle times. This paper presents an original model of asynchronous iterations for a time-domain decomposition method, namely the parareal method. The asynchronous parareal algorithm is here applied to European option pricing, and numerical experiments performed on a parallel supercomputer, illustrate the performance and efficiency of this new method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01198","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":""},"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":"1907.01198","created_at":"2026-05-17T23:40:54.942750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01198v1","created_at":"2026-05-17T23:40:54.942750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01198","created_at":"2026-05-17T23:40:54.942750+00:00"},{"alias_kind":"pith_short_12","alias_value":"234225VKS65I","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"234225VKS65IWOML","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"234225VK","created_at":"2026-05-18T12:33:07.085635+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/234225VKS65IWOMLN4AL45QGLM","json":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM.json","graph_json":"https://pith.science/api/pith-number/234225VKS65IWOMLN4AL45QGLM/graph.json","events_json":"https://pith.science/api/pith-number/234225VKS65IWOMLN4AL45QGLM/events.json","paper":"https://pith.science/paper/234225VK"},"agent_actions":{"view_html":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM","download_json":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM.json","view_paper":"https://pith.science/paper/234225VK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01198&json=true","fetch_graph":"https://pith.science/api/pith-number/234225VKS65IWOMLN4AL45QGLM/graph.json","fetch_events":"https://pith.science/api/pith-number/234225VKS65IWOMLN4AL45QGLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM/action/storage_attestation","attest_author":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM/action/author_attestation","sign_citation":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM/action/citation_signature","submit_replication":"https://pith.science/pith/234225VKS65IWOMLN4AL45QGLM/action/replication_record"}},"created_at":"2026-05-17T23:40:54.942750+00:00","updated_at":"2026-05-17T23:40:54.942750+00:00"}