{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HTNWOP5ZLSHKWMUIFR4ODSA5DK","short_pith_number":"pith:HTNWOP5Z","canonical_record":{"source":{"id":"1406.2581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-06-10T15:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"b5d2bd2b06d10e70398fe6148de19eb8eba28cb0f793ef17500f6766b8e2c8e7","abstract_canon_sha256":"fee25e4636b861e1882c638fd1ab12bc4df7ecc9ba06186bcc13b08b5991e877"},"schema_version":"1.0"},"canonical_sha256":"3cdb673fb95c8eab32882c78e1c81d1a941e132f98eb715bd67da92fa13067f0","source":{"kind":"arxiv","id":"1406.2581","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2581","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2581v3","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2581","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"HTNWOP5ZLSHK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTNWOP5ZLSHKWMUI","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTNWOP5Z","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HTNWOP5ZLSHKWMUIFR4ODSA5DK","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-06-10T15:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"b5d2bd2b06d10e70398fe6148de19eb8eba28cb0f793ef17500f6766b8e2c8e7","abstract_canon_sha256":"fee25e4636b861e1882c638fd1ab12bc4df7ecc9ba06186bcc13b08b5991e877"},"schema_version":"1.0"},"canonical_sha256":"3cdb673fb95c8eab32882c78e1c81d1a941e132f98eb715bd67da92fa13067f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:03.493816Z","signature_b64":"GtA2cn0N2yBecDXDmzJPBSqpAH4ZPe4+wNjsvFjs5TYvegRikYT+269lrkDUKsUUdCIJHEDAxmVmB26QY04JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cdb673fb95c8eab32882c78e1c81d1a941e132f98eb715bd67da92fa13067f0","last_reissued_at":"2026-05-18T02:41:03.493268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:03.493268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2581","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFhbOMqFdK5nMwak1NoBU5hAeSFNDAtKQJ/uI/6tma3RAybUBUCfQoemxdClP/scpFkeTO7XVcmgBYAo6Rt+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:03:37.256375Z"},"content_sha256":"d8dae4272d6d4c1ea03c09925e046e0ce69bcfc2393a3619ddd70c8a737084b6","schema_version":"1.0","event_id":"sha256:d8dae4272d6d4c1ea03c09925e046e0ce69bcfc2393a3619ddd70c8a737084b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HTNWOP5ZLSHKWMUIFR4ODSA5DK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilevel path simulation for weak approximation schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Denis Belomestny, Tigran Nagapetyan","submitted_at":"2014-06-10T15:12:03Z","abstract_excerpt":"In this paper we discuss the possibility of using multilevel Monte Carlo (MLMC) methods for weak approximation schemes. It turns out that by means of a simple coupling between consecutive time discretisation levels, one can achieve the same complexity gain as under the presence of a strong convergence. We exemplify this general idea in the case of weak Euler scheme for L\\'evy driven stochastic differential equations, and show that, given a weak convergence of order $\\alpha\\geq 1/2,$ the complexity of the corresponding \"weak\" MLMC estimate is of order $\\varepsilon^{-2}\\log ^{2}(\\varepsilon).$ T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2581","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SKW+j9maUFJktAftNRD27jJty6hkkUTkDrRVtS5PaPF5qfFMsR8EIdFJsWBge6T58IczbZbxFdOo1XJhZWO6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:03:37.256729Z"},"content_sha256":"528327e2b6d551351447f00a2fe91e885af0d6fdc6320c40c3fe6807f896e9d7","schema_version":"1.0","event_id":"sha256:528327e2b6d551351447f00a2fe91e885af0d6fdc6320c40c3fe6807f896e9d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTNWOP5ZLSHKWMUIFR4ODSA5DK/bundle.json","state_url":"https://pith.science/pith/HTNWOP5ZLSHKWMUIFR4ODSA5DK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTNWOP5ZLSHKWMUIFR4ODSA5DK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T07:03:37Z","links":{"resolver":"https://pith.science/pith/HTNWOP5ZLSHKWMUIFR4ODSA5DK","bundle":"https://pith.science/pith/HTNWOP5ZLSHKWMUIFR4ODSA5DK/bundle.json","state":"https://pith.science/pith/HTNWOP5ZLSHKWMUIFR4ODSA5DK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTNWOP5ZLSHKWMUIFR4ODSA5DK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HTNWOP5ZLSHKWMUIFR4ODSA5DK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fee25e4636b861e1882c638fd1ab12bc4df7ecc9ba06186bcc13b08b5991e877","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-06-10T15:12:03Z","title_canon_sha256":"b5d2bd2b06d10e70398fe6148de19eb8eba28cb0f793ef17500f6766b8e2c8e7"},"schema_version":"1.0","source":{"id":"1406.2581","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2581","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2581v3","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2581","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"HTNWOP5ZLSHK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTNWOP5ZLSHKWMUI","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTNWOP5Z","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:528327e2b6d551351447f00a2fe91e885af0d6fdc6320c40c3fe6807f896e9d7","target":"graph","created_at":"2026-05-18T02:41:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we discuss the possibility of using multilevel Monte Carlo (MLMC) methods for weak approximation schemes. It turns out that by means of a simple coupling between consecutive time discretisation levels, one can achieve the same complexity gain as under the presence of a strong convergence. We exemplify this general idea in the case of weak Euler scheme for L\\'evy driven stochastic differential equations, and show that, given a weak convergence of order $\\alpha\\geq 1/2,$ the complexity of the corresponding \"weak\" MLMC estimate is of order $\\varepsilon^{-2}\\log ^{2}(\\varepsilon).$ T","authors_text":"Denis Belomestny, Tigran Nagapetyan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-06-10T15:12:03Z","title":"Multilevel path simulation for weak approximation schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2581","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d8dae4272d6d4c1ea03c09925e046e0ce69bcfc2393a3619ddd70c8a737084b6","target":"record","created_at":"2026-05-18T02:41:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fee25e4636b861e1882c638fd1ab12bc4df7ecc9ba06186bcc13b08b5991e877","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-06-10T15:12:03Z","title_canon_sha256":"b5d2bd2b06d10e70398fe6148de19eb8eba28cb0f793ef17500f6766b8e2c8e7"},"schema_version":"1.0","source":{"id":"1406.2581","kind":"arxiv","version":3}},"canonical_sha256":"3cdb673fb95c8eab32882c78e1c81d1a941e132f98eb715bd67da92fa13067f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cdb673fb95c8eab32882c78e1c81d1a941e132f98eb715bd67da92fa13067f0","first_computed_at":"2026-05-18T02:41:03.493268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:03.493268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtA2cn0N2yBecDXDmzJPBSqpAH4ZPe4+wNjsvFjs5TYvegRikYT+269lrkDUKsUUdCIJHEDAxmVmB26QY04JDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:03.493816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2581","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8dae4272d6d4c1ea03c09925e046e0ce69bcfc2393a3619ddd70c8a737084b6","sha256:528327e2b6d551351447f00a2fe91e885af0d6fdc6320c40c3fe6807f896e9d7"],"state_sha256":"54d466b9b89515fcfc4e5ee1a31a8a379569749e98fba26d2877a2f15fe4631f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlUF5OZNXYdnifEOxIbzApHOkNIFnKapLXXSBZaSmAoDFPx7ip8iy4Utnl6QVhL9+1aE3n+Ts7F7EHagOAEbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:03:37.258618Z","bundle_sha256":"e5be097cd4e6e3140381b18202aafecf0db97655b27706f907f33e0a2c68672e"}}