{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:T2AFBHTFCA4YI7GSKH7G7G36KA","short_pith_number":"pith:T2AFBHTF","canonical_record":{"source":{"id":"1806.09754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-26T01:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"ae89127166c135136d322a17edbfdab35dd762f69f4ff0cc3ad8e20e516bcbe9","abstract_canon_sha256":"b09504286518777227b22b329b9ec6b9ef21997ebe66b5a8f6ffb0f8d448538d"},"schema_version":"1.0"},"canonical_sha256":"9e80509e651039847cd251fe6f9b7e501a4a68c08e891a408ece861ef8b63951","source":{"kind":"arxiv","id":"1806.09754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09754","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09754v1","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09754","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"T2AFBHTFCA4Y","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T2AFBHTFCA4YI7GS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T2AFBHTF","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:T2AFBHTFCA4YI7GSKH7G7G36KA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-26T01:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"ae89127166c135136d322a17edbfdab35dd762f69f4ff0cc3ad8e20e516bcbe9","abstract_canon_sha256":"b09504286518777227b22b329b9ec6b9ef21997ebe66b5a8f6ffb0f8d448538d"},"schema_version":"1.0"},"canonical_sha256":"9e80509e651039847cd251fe6f9b7e501a4a68c08e891a408ece861ef8b63951","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:23.482021Z","signature_b64":"XwZnVgoL6CSZqYnVMCVLCAqylrOUx2duVIypi15EcF/unD6TjcdEoFBGpieoboKEktU4vbKg8l7Q3/+nZniTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e80509e651039847cd251fe6f9b7e501a4a68c08e891a408ece861ef8b63951","last_reissued_at":"2026-05-18T00:12:23.481292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:23.481292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09754","source_version":1,"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:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+RsFZl7wWql4ZLzPxhSQSBWZrau5AXyJGXoRcZC7AsF419Av6FN7qoBtxsTDXHz8vS/tGGPrNgeZ5WDUsqiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:12.918041Z"},"content_sha256":"7dfcfb750f7c316995d383481d0f40411cdcd7fde7c282b24a26b4ae2bd82076","schema_version":"1.0","event_id":"sha256:7dfcfb750f7c316995d383481d0f40411cdcd7fde7c282b24a26b4ae2bd82076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:T2AFBHTFCA4YI7GSKH7G7G36KA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov chain Simulation for Multilevel Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ajay Jasra, Kody Law, Yaxian Xu","submitted_at":"2018-06-26T01:51:52Z","abstract_excerpt":"This paper considers a new approach to using Markov chain Monte Carlo (MCMC) in contexts where one may adopt multilevel (ML) Monte Carlo. The underlying problem is to approximate expectations w.r.t. an underlying probability measure that is associated to a continuum problem, such as a continuous-time stochastic process. It is then assumed that the associated probability measure can only be used (e.g. sampled) under a discretized approximation. In such scenarios, it is known that to achieve a target error, the computational effort can be reduced when using MLMC relative to exact sampling from t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09754","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"},"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:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJid/1u9I40cVamSL+gAgJiaWhNwK79l7xOCGfCbqy/rhqVFLv03zIDq8MUfWr8TBhTd4EnRoG5ar8ZhNUbDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:12.918399Z"},"content_sha256":"f72eb3d1debbe6a0f40371df5d1eb683538b2c9546ec5df83faf153f8faa3a17","schema_version":"1.0","event_id":"sha256:f72eb3d1debbe6a0f40371df5d1eb683538b2c9546ec5df83faf153f8faa3a17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2AFBHTFCA4YI7GSKH7G7G36KA/bundle.json","state_url":"https://pith.science/pith/T2AFBHTFCA4YI7GSKH7G7G36KA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2AFBHTFCA4YI7GSKH7G7G36KA/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-05-28T12:46:12Z","links":{"resolver":"https://pith.science/pith/T2AFBHTFCA4YI7GSKH7G7G36KA","bundle":"https://pith.science/pith/T2AFBHTFCA4YI7GSKH7G7G36KA/bundle.json","state":"https://pith.science/pith/T2AFBHTFCA4YI7GSKH7G7G36KA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2AFBHTFCA4YI7GSKH7G7G36KA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T2AFBHTFCA4YI7GSKH7G7G36KA","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":"b09504286518777227b22b329b9ec6b9ef21997ebe66b5a8f6ffb0f8d448538d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-26T01:51:52Z","title_canon_sha256":"ae89127166c135136d322a17edbfdab35dd762f69f4ff0cc3ad8e20e516bcbe9"},"schema_version":"1.0","source":{"id":"1806.09754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09754","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09754v1","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09754","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"T2AFBHTFCA4Y","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T2AFBHTFCA4YI7GS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T2AFBHTF","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:f72eb3d1debbe6a0f40371df5d1eb683538b2c9546ec5df83faf153f8faa3a17","target":"graph","created_at":"2026-05-18T00:12:23Z","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":"This paper considers a new approach to using Markov chain Monte Carlo (MCMC) in contexts where one may adopt multilevel (ML) Monte Carlo. The underlying problem is to approximate expectations w.r.t. an underlying probability measure that is associated to a continuum problem, such as a continuous-time stochastic process. It is then assumed that the associated probability measure can only be used (e.g. sampled) under a discretized approximation. In such scenarios, it is known that to achieve a target error, the computational effort can be reduced when using MLMC relative to exact sampling from t","authors_text":"Ajay Jasra, Kody Law, Yaxian Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-26T01:51:52Z","title":"Markov chain Simulation for Multilevel Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09754","kind":"arxiv","version":1},"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:7dfcfb750f7c316995d383481d0f40411cdcd7fde7c282b24a26b4ae2bd82076","target":"record","created_at":"2026-05-18T00:12:23Z","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":"b09504286518777227b22b329b9ec6b9ef21997ebe66b5a8f6ffb0f8d448538d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-26T01:51:52Z","title_canon_sha256":"ae89127166c135136d322a17edbfdab35dd762f69f4ff0cc3ad8e20e516bcbe9"},"schema_version":"1.0","source":{"id":"1806.09754","kind":"arxiv","version":1}},"canonical_sha256":"9e80509e651039847cd251fe6f9b7e501a4a68c08e891a408ece861ef8b63951","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e80509e651039847cd251fe6f9b7e501a4a68c08e891a408ece861ef8b63951","first_computed_at":"2026-05-18T00:12:23.481292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:23.481292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XwZnVgoL6CSZqYnVMCVLCAqylrOUx2duVIypi15EcF/unD6TjcdEoFBGpieoboKEktU4vbKg8l7Q3/+nZniTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:23.482021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dfcfb750f7c316995d383481d0f40411cdcd7fde7c282b24a26b4ae2bd82076","sha256:f72eb3d1debbe6a0f40371df5d1eb683538b2c9546ec5df83faf153f8faa3a17"],"state_sha256":"ff71e9002b5348797769a00c7868b2846b3f481bbd9793d97075c1a7560cbfec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c86Q6IwBeHCaP8obJNXCQ2StQy70qWCGPbID8aKRPsmaI2Y6eRPNRTRdz4GJDMFhb1lgyZ5Sxu33UxKb3m+3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:46:12.920311Z","bundle_sha256":"6fc71075174ab741933dfc9e47ea86ff162c92d3d31c226af26f1ce374878b20"}}