{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BS54JJ5CWJPA5Y3HIDAZNZB2UJ","short_pith_number":"pith:BS54JJ5C","canonical_record":{"source":{"id":"1412.4045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-12-12T16:32:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d71da963f9398089c296f3c6801fcec8c8c4a7fabfb0874e81e19fd050fa2538","abstract_canon_sha256":"9ab203b7814247a1e52891fb59c664787c8841100931813940deef932c09d675"},"schema_version":"1.0"},"canonical_sha256":"0cbbc4a7a2b25e0ee36740c196e43aa2778cb87168a7160db5bf11cd38627d20","source":{"kind":"arxiv","id":"1412.4045","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4045","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4045v2","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4045","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"BS54JJ5CWJPA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BS54JJ5CWJPA5Y3H","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BS54JJ5C","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BS54JJ5CWJPA5Y3HIDAZNZB2UJ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-12-12T16:32:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d71da963f9398089c296f3c6801fcec8c8c4a7fabfb0874e81e19fd050fa2538","abstract_canon_sha256":"9ab203b7814247a1e52891fb59c664787c8841100931813940deef932c09d675"},"schema_version":"1.0"},"canonical_sha256":"0cbbc4a7a2b25e0ee36740c196e43aa2778cb87168a7160db5bf11cd38627d20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:55.181979Z","signature_b64":"KJ3T5Of0aEJQ5uEUtwR2da2osVwICTjyKwaGCrBAp+NkPYuHVwoXzueK0qZWHNN2I3mQ2z1KkkSWDuK2dodQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cbbc4a7a2b25e0ee36740c196e43aa2778cb87168a7160db5bf11cd38627d20","last_reissued_at":"2026-05-18T00:48:55.181189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:55.181189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4045","source_version":2,"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-18T00:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhRcITMp9Ou/+2+wvp/LaOCDKCim5Psgdn/dIkx5ebhLeut7xtQe7mB3GfeS4fPhFEfO0V/k/CxnSSh+Fk6wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:31:50.066900Z"},"content_sha256":"cbe4c15a49c0b0599bd93d1a7e563753f8a46d0e5e56b0afa703b15c331b029e","schema_version":"1.0","event_id":"sha256:cbe4c15a49c0b0599bd93d1a7e563753f8a46d0e5e56b0afa703b15c331b029e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BS54JJ5CWJPA5Y3HIDAZNZB2UJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variance reduced multilevel path simulation: going beyond the complexity $\\varepsilon^{-2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"q-fin.CP","authors_text":"Denis Belomestny, Tigran Nagapetyan","submitted_at":"2014-12-12T16:32:55Z","abstract_excerpt":"In this paper a novel modification of the multilevel Monte Carlo approach, allowing for further significant complexity reduction, is proposed. The idea of the modification is to use the method of control variates to reduce variance at level zero. We show that, under a proper choice of control variates, one can reduce the complexity order of the modified MLMC algorithm down to $\\varepsilon^{-2+\\delta}$ for any $\\delta\\in [0,1)$ with $\\varepsilon$ being the precision to be achieved. These theoretical results are illustrated by several numerical examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4045","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":""},"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-18T00:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnKEC7MB4oIEIUIzyoi+g4q5zNx4+0/v5Y4JqpTyjqKWwewgPNQOXM5iSXvXkGGlG41LBA1+S1zJiolLW6uXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:31:50.067247Z"},"content_sha256":"1290cc50276df70866c37c075ff3fcbf524b1842d3f320bc6f548720e469cbeb","schema_version":"1.0","event_id":"sha256:1290cc50276df70866c37c075ff3fcbf524b1842d3f320bc6f548720e469cbeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BS54JJ5CWJPA5Y3HIDAZNZB2UJ/bundle.json","state_url":"https://pith.science/pith/BS54JJ5CWJPA5Y3HIDAZNZB2UJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BS54JJ5CWJPA5Y3HIDAZNZB2UJ/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-03T04:31:50Z","links":{"resolver":"https://pith.science/pith/BS54JJ5CWJPA5Y3HIDAZNZB2UJ","bundle":"https://pith.science/pith/BS54JJ5CWJPA5Y3HIDAZNZB2UJ/bundle.json","state":"https://pith.science/pith/BS54JJ5CWJPA5Y3HIDAZNZB2UJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BS54JJ5CWJPA5Y3HIDAZNZB2UJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BS54JJ5CWJPA5Y3HIDAZNZB2UJ","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":"9ab203b7814247a1e52891fb59c664787c8841100931813940deef932c09d675","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-12-12T16:32:55Z","title_canon_sha256":"d71da963f9398089c296f3c6801fcec8c8c4a7fabfb0874e81e19fd050fa2538"},"schema_version":"1.0","source":{"id":"1412.4045","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4045","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4045v2","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4045","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"BS54JJ5CWJPA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BS54JJ5CWJPA5Y3H","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BS54JJ5C","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:1290cc50276df70866c37c075ff3fcbf524b1842d3f320bc6f548720e469cbeb","target":"graph","created_at":"2026-05-18T00:48:55Z","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 a novel modification of the multilevel Monte Carlo approach, allowing for further significant complexity reduction, is proposed. The idea of the modification is to use the method of control variates to reduce variance at level zero. We show that, under a proper choice of control variates, one can reduce the complexity order of the modified MLMC algorithm down to $\\varepsilon^{-2+\\delta}$ for any $\\delta\\in [0,1)$ with $\\varepsilon$ being the precision to be achieved. These theoretical results are illustrated by several numerical examples.","authors_text":"Denis Belomestny, Tigran Nagapetyan","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-12-12T16:32:55Z","title":"Variance reduced multilevel path simulation: going beyond the complexity $\\varepsilon^{-2}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4045","kind":"arxiv","version":2},"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:cbe4c15a49c0b0599bd93d1a7e563753f8a46d0e5e56b0afa703b15c331b029e","target":"record","created_at":"2026-05-18T00:48:55Z","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":"9ab203b7814247a1e52891fb59c664787c8841100931813940deef932c09d675","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2014-12-12T16:32:55Z","title_canon_sha256":"d71da963f9398089c296f3c6801fcec8c8c4a7fabfb0874e81e19fd050fa2538"},"schema_version":"1.0","source":{"id":"1412.4045","kind":"arxiv","version":2}},"canonical_sha256":"0cbbc4a7a2b25e0ee36740c196e43aa2778cb87168a7160db5bf11cd38627d20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cbbc4a7a2b25e0ee36740c196e43aa2778cb87168a7160db5bf11cd38627d20","first_computed_at":"2026-05-18T00:48:55.181189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:55.181189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KJ3T5Of0aEJQ5uEUtwR2da2osVwICTjyKwaGCrBAp+NkPYuHVwoXzueK0qZWHNN2I3mQ2z1KkkSWDuK2dodQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:55.181979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4045","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbe4c15a49c0b0599bd93d1a7e563753f8a46d0e5e56b0afa703b15c331b029e","sha256:1290cc50276df70866c37c075ff3fcbf524b1842d3f320bc6f548720e469cbeb"],"state_sha256":"fa997d7ec2ee071b207a16bcf67a810d5e8ee815238f4fbb5a1260b856d04791"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hU+XpWuHy/Pu1pOVth80zhne5VZmHdLDkDcUmIZuahRsj58y63b/B/clNTtHnuROKPabRcCiBtVaWdL0MJ9uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:31:50.069218Z","bundle_sha256":"63b42aeedbfe7c1bc2958811647e1c6e8b7ccb8557d7c90b8da78c31e14e042f"}}