{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LM7W2FPM4MWFAF4IOHHMZPLMUG","short_pith_number":"pith:LM7W2FPM","schema_version":"1.0","canonical_sha256":"5b3f6d15ece32c50178871ceccbd6ca1a56a5310c12784bbf3e001ba0d02c122","source":{"kind":"arxiv","id":"1302.4676","version":3},"attestation_state":"computed","paper":{"title":"Analysis of multilevel Monte Carlo path simulation using the Milstein discretisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Andreas R\\\"o{\\ss}ler, Kristian Debrabant, Michael B. Giles","submitted_at":"2013-02-19T17:07:46Z","abstract_excerpt":"The multilevel Monte Carlo path simulation method introduced by Giles ({\\it Operations Research}, 56(3):607-617, 2008) exploits strong convergence properties to improve the computational complexity by combining simulations with different levels of resolution. In this paper we analyse its efficiency when using the Milstein discretisation; this has an improved order of strong convergence compared to the standard Euler-Maruyama method, and it is proved that this leads to an improved order of convergence of the variance of the multilevel estimator. Numerical results are also given for basket optio"},"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":"1302.4676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2013-02-19T17:07:46Z","cross_cats_sorted":[],"title_canon_sha256":"2ddd9d6230fec84621bcbaf06c45a8c093662e31a85def9a29d4cea390b8cb3a","abstract_canon_sha256":"686ebc78de487967dafda34e5001f90209f11b301716751564f3328ebac742cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:57.124543Z","signature_b64":"GfpmBGxUU/Lt91flKzsAmpLoLtbD7ur89l5bWb6a2IvzD9m6caQp3U1UZYof1DzQNQmgoeaCLD6sNd8pwbHKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b3f6d15ece32c50178871ceccbd6ca1a56a5310c12784bbf3e001ba0d02c122","last_reissued_at":"2026-05-17T23:41:57.123977Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:57.123977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of multilevel Monte Carlo path simulation using the Milstein discretisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Andreas R\\\"o{\\ss}ler, Kristian Debrabant, Michael B. Giles","submitted_at":"2013-02-19T17:07:46Z","abstract_excerpt":"The multilevel Monte Carlo path simulation method introduced by Giles ({\\it Operations Research}, 56(3):607-617, 2008) exploits strong convergence properties to improve the computational complexity by combining simulations with different levels of resolution. In this paper we analyse its efficiency when using the Milstein discretisation; this has an improved order of strong convergence compared to the standard Euler-Maruyama method, and it is proved that this leads to an improved order of convergence of the variance of the multilevel estimator. Numerical results are also given for basket optio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4676","kind":"arxiv","version":3},"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":"1302.4676","created_at":"2026-05-17T23:41:57.124049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4676v3","created_at":"2026-05-17T23:41:57.124049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4676","created_at":"2026-05-17T23:41:57.124049+00:00"},{"alias_kind":"pith_short_12","alias_value":"LM7W2FPM4MWF","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LM7W2FPM4MWFAF4I","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LM7W2FPM","created_at":"2026-05-18T12:27:51.066281+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/LM7W2FPM4MWFAF4IOHHMZPLMUG","json":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG.json","graph_json":"https://pith.science/api/pith-number/LM7W2FPM4MWFAF4IOHHMZPLMUG/graph.json","events_json":"https://pith.science/api/pith-number/LM7W2FPM4MWFAF4IOHHMZPLMUG/events.json","paper":"https://pith.science/paper/LM7W2FPM"},"agent_actions":{"view_html":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG","download_json":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG.json","view_paper":"https://pith.science/paper/LM7W2FPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4676&json=true","fetch_graph":"https://pith.science/api/pith-number/LM7W2FPM4MWFAF4IOHHMZPLMUG/graph.json","fetch_events":"https://pith.science/api/pith-number/LM7W2FPM4MWFAF4IOHHMZPLMUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG/action/storage_attestation","attest_author":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG/action/author_attestation","sign_citation":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG/action/citation_signature","submit_replication":"https://pith.science/pith/LM7W2FPM4MWFAF4IOHHMZPLMUG/action/replication_record"}},"created_at":"2026-05-17T23:41:57.124049+00:00","updated_at":"2026-05-17T23:41:57.124049+00:00"}