{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6R3QPIL4OIGKI63EEKXUSWW5SY","short_pith_number":"pith:6R3QPIL4","schema_version":"1.0","canonical_sha256":"f47707a17c720ca47b6422af495add962efbc3bfa324ae945fb4dfcc3c8d3340","source":{"kind":"arxiv","id":"1501.06365","version":1},"attestation_state":"computed","paper":{"title":"Central limit theorem for the multilevel Monte Carlo Euler method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ahmed Kebaier, Mohamed Ben Alaya","submitted_at":"2015-01-26T12:47:34Z","abstract_excerpt":"This paper focuses on studying the multilevel Monte Carlo method recently introduced by Giles [Oper. Res. 56 (2008) 607-617] which is significantly more efficient than the classical Monte Carlo one. Our aim is to prove a central limit theorem of Lindeberg-Feller type for the multilevel Monte Carlo method associated with the Euler discretization scheme. To do so, we prove first a stable law convergence theorem, in the spirit of Jacod and Protter [Ann. Probab. 26 (1998) 267-307], for the Euler scheme error on two consecutive levels of the algorithm. This leads to an accurate description of the o"},"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":"1501.06365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-26T12:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"1edccbcb2e31d5bdc0d40629e66cfaed32db2014d42b016350f6835de1714ab5","abstract_canon_sha256":"5ff838991fee18aa8b109b82ab29860e0ff29860d219d9375669e08d6a52c991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:41.669427Z","signature_b64":"/BJ5DSDWLmxeca8GL6YWVJvZQvxByegoPUCWYp4nlZUwx4smGtPaGLL0cZTaUbaDGKq7gcxUvG0FLFe0LS7bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f47707a17c720ca47b6422af495add962efbc3bfa324ae945fb4dfcc3c8d3340","last_reissued_at":"2026-05-18T02:28:41.668886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:41.668886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Central limit theorem for the multilevel Monte Carlo Euler method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ahmed Kebaier, Mohamed Ben Alaya","submitted_at":"2015-01-26T12:47:34Z","abstract_excerpt":"This paper focuses on studying the multilevel Monte Carlo method recently introduced by Giles [Oper. Res. 56 (2008) 607-617] which is significantly more efficient than the classical Monte Carlo one. Our aim is to prove a central limit theorem of Lindeberg-Feller type for the multilevel Monte Carlo method associated with the Euler discretization scheme. To do so, we prove first a stable law convergence theorem, in the spirit of Jacod and Protter [Ann. Probab. 26 (1998) 267-307], for the Euler scheme error on two consecutive levels of the algorithm. This leads to an accurate description of the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06365","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":"1501.06365","created_at":"2026-05-18T02:28:41.668968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06365v1","created_at":"2026-05-18T02:28:41.668968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06365","created_at":"2026-05-18T02:28:41.668968+00:00"},{"alias_kind":"pith_short_12","alias_value":"6R3QPIL4OIGK","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6R3QPIL4OIGKI63E","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6R3QPIL4","created_at":"2026-05-18T12:29:07.941421+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/6R3QPIL4OIGKI63EEKXUSWW5SY","json":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY.json","graph_json":"https://pith.science/api/pith-number/6R3QPIL4OIGKI63EEKXUSWW5SY/graph.json","events_json":"https://pith.science/api/pith-number/6R3QPIL4OIGKI63EEKXUSWW5SY/events.json","paper":"https://pith.science/paper/6R3QPIL4"},"agent_actions":{"view_html":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY","download_json":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY.json","view_paper":"https://pith.science/paper/6R3QPIL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06365&json=true","fetch_graph":"https://pith.science/api/pith-number/6R3QPIL4OIGKI63EEKXUSWW5SY/graph.json","fetch_events":"https://pith.science/api/pith-number/6R3QPIL4OIGKI63EEKXUSWW5SY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY/action/storage_attestation","attest_author":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY/action/author_attestation","sign_citation":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY/action/citation_signature","submit_replication":"https://pith.science/pith/6R3QPIL4OIGKI63EEKXUSWW5SY/action/replication_record"}},"created_at":"2026-05-18T02:28:41.668968+00:00","updated_at":"2026-05-18T02:28:41.668968+00:00"}