{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BTAGRFY4EL7OEMXHUQIVT2WKA3","short_pith_number":"pith:BTAGRFY4","schema_version":"1.0","canonical_sha256":"0cc068971c22fee232e7a41159eaca06e697029ccfd5a255ef9449a094c0ead5","source":{"kind":"arxiv","id":"1901.05672","version":2},"attestation_state":"computed","paper":{"title":"Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"q-fin.CP","authors_text":"J\\'er\\^ome Lelong (DAO)","submitted_at":"2019-01-17T08:02:22Z","abstract_excerpt":"In this work, we propose a new policy iteration algorithm for pricing Bermudan options when the payoff process cannot be written as a function of a lifted Markov process. Our approach is based on a modification of the well-known Longstaff Schwartz algorithm, in which we basically replace the standard least square regression by a Wiener chaos expansion. Not only does it allow us to deal with a non Markovian setting, but it also breaks the bottleneck induced by the least square regression as the coefficients of the chaos expansion are given by scalar products on the L^2 space and can therefore b"},"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":"1901.05672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2019-01-17T08:02:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f6d22684b4c7061e0bcfafb8d81e5f5ae68a54c0fecdc536e101274467015f30","abstract_canon_sha256":"24a0cd9c9797c49eebe81fdbe14189d199bac40bf9568ba3e5f8d3f21e45239e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:45.382543Z","signature_b64":"jWnXP1BLsTVmTPrhMN4YK1IvBshPb+mAk/ZIGj5ahDD3FrenI5Iwovwq0dIy7PKDxehGnCke150ONA8nFOcpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc068971c22fee232e7a41159eaca06e697029ccfd5a255ef9449a094c0ead5","last_reissued_at":"2026-07-05T01:21:45.382097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:45.382097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"q-fin.CP","authors_text":"J\\'er\\^ome Lelong (DAO)","submitted_at":"2019-01-17T08:02:22Z","abstract_excerpt":"In this work, we propose a new policy iteration algorithm for pricing Bermudan options when the payoff process cannot be written as a function of a lifted Markov process. Our approach is based on a modification of the well-known Longstaff Schwartz algorithm, in which we basically replace the standard least square regression by a Wiener chaos expansion. Not only does it allow us to deal with a non Markovian setting, but it also breaks the bottleneck induced by the least square regression as the coefficients of the chaos expansion are given by scalar products on the L^2 space and can therefore b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05672","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.05672/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":"1901.05672","created_at":"2026-07-05T01:21:45.382153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05672v2","created_at":"2026-07-05T01:21:45.382153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05672","created_at":"2026-07-05T01:21:45.382153+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTAGRFY4EL7O","created_at":"2026-07-05T01:21:45.382153+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTAGRFY4EL7OEMXH","created_at":"2026-07-05T01:21:45.382153+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTAGRFY4","created_at":"2026-07-05T01:21:45.382153+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01602","citing_title":"Solving high-dimensional optimal stopping problems using deep learning","ref_index":72,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3","json":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3.json","graph_json":"https://pith.science/api/pith-number/BTAGRFY4EL7OEMXHUQIVT2WKA3/graph.json","events_json":"https://pith.science/api/pith-number/BTAGRFY4EL7OEMXHUQIVT2WKA3/events.json","paper":"https://pith.science/paper/BTAGRFY4"},"agent_actions":{"view_html":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3","download_json":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3.json","view_paper":"https://pith.science/paper/BTAGRFY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05672&json=true","fetch_graph":"https://pith.science/api/pith-number/BTAGRFY4EL7OEMXHUQIVT2WKA3/graph.json","fetch_events":"https://pith.science/api/pith-number/BTAGRFY4EL7OEMXHUQIVT2WKA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3/action/storage_attestation","attest_author":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3/action/author_attestation","sign_citation":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3/action/citation_signature","submit_replication":"https://pith.science/pith/BTAGRFY4EL7OEMXHUQIVT2WKA3/action/replication_record"}},"created_at":"2026-07-05T01:21:45.382153+00:00","updated_at":"2026-07-05T01:21:45.382153+00:00"}