{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:U55RLRYILB5EC5CZVRSHTZ6RKJ","short_pith_number":"pith:U55RLRYI","schema_version":"1.0","canonical_sha256":"a77b15c708587a417459ac6479e7d15245feca7079a132b7c09193511795455f","source":{"kind":"arxiv","id":"1903.11275","version":2},"attestation_state":"computed","paper":{"title":"Variance Reduction Applied to Machine Learning for Pricing Bermudan/American Options in High Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Andrea Molent, Antonino Zanette, Ludovic Gouden\\`ege","submitted_at":"2019-03-27T07:33:35Z","abstract_excerpt":"In this paper we propose an efficient method to compute the price of multi-asset American options, based on Machine Learning, Monte Carlo simulations and variance reduction technique. Specifically, the options we consider are written on a basket of assets, each of them following a Black-Scholes dynamics. In the wake of Ludkovski's approach (2018), we implement here a backward dynamic programming algorithm which considers a finite number of uniformly distributed exercise dates. On these dates, the option value is computed as the maximum between the exercise value and the continuation value, whi"},"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":"1903.11275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2019-03-27T07:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"af4d0ed134e0f1518742debb93c4f961ab6c2bb6ae0c52e86981e142d0950e4a","abstract_canon_sha256":"c36bd1744ba830e7655c8a4119a8e360552e952c465fc22b92ad70bd539a83e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:21.516229Z","signature_b64":"SUmGQSUAOmg1XWr5mpDlOJJCX89QPkaUfelEcytsTo5eK5voDfWmTp3JaNz6R3pnOrSP3sY4ZmALNAUqmYUUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a77b15c708587a417459ac6479e7d15245feca7079a132b7c09193511795455f","last_reissued_at":"2026-07-05T00:23:21.515704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:21.515704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variance Reduction Applied to Machine Learning for Pricing Bermudan/American Options in High Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Andrea Molent, Antonino Zanette, Ludovic Gouden\\`ege","submitted_at":"2019-03-27T07:33:35Z","abstract_excerpt":"In this paper we propose an efficient method to compute the price of multi-asset American options, based on Machine Learning, Monte Carlo simulations and variance reduction technique. Specifically, the options we consider are written on a basket of assets, each of them following a Black-Scholes dynamics. In the wake of Ludkovski's approach (2018), we implement here a backward dynamic programming algorithm which considers a finite number of uniformly distributed exercise dates. On these dates, the option value is computed as the maximum between the exercise value and the continuation value, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11275","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/1903.11275/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":"1903.11275","created_at":"2026-07-05T00:23:21.515763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11275v2","created_at":"2026-07-05T00:23:21.515763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11275","created_at":"2026-07-05T00:23:21.515763+00:00"},{"alias_kind":"pith_short_12","alias_value":"U55RLRYILB5E","created_at":"2026-07-05T00:23:21.515763+00:00"},{"alias_kind":"pith_short_16","alias_value":"U55RLRYILB5EC5CZ","created_at":"2026-07-05T00:23:21.515763+00:00"},{"alias_kind":"pith_short_8","alias_value":"U55RLRYI","created_at":"2026-07-05T00:23:21.515763+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.10828","citing_title":"Deep neural network approximations for Monte Carlo algorithms","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ","json":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ.json","graph_json":"https://pith.science/api/pith-number/U55RLRYILB5EC5CZVRSHTZ6RKJ/graph.json","events_json":"https://pith.science/api/pith-number/U55RLRYILB5EC5CZVRSHTZ6RKJ/events.json","paper":"https://pith.science/paper/U55RLRYI"},"agent_actions":{"view_html":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ","download_json":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ.json","view_paper":"https://pith.science/paper/U55RLRYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11275&json=true","fetch_graph":"https://pith.science/api/pith-number/U55RLRYILB5EC5CZVRSHTZ6RKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U55RLRYILB5EC5CZVRSHTZ6RKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ/action/storage_attestation","attest_author":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ/action/author_attestation","sign_citation":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ/action/citation_signature","submit_replication":"https://pith.science/pith/U55RLRYILB5EC5CZVRSHTZ6RKJ/action/replication_record"}},"created_at":"2026-07-05T00:23:21.515763+00:00","updated_at":"2026-07-05T00:23:21.515763+00:00"}