{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AOH5CMERX5ZHHGX6CSLDFLLIUW","short_pith_number":"pith:AOH5CMER","canonical_record":{"source":{"id":"1402.2463","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-11T11:57:42Z","cross_cats_sorted":[],"title_canon_sha256":"5c45808cd2ecff3466b74b1c470946a3f090aba72ed345b9d3503fc1ca9ed020","abstract_canon_sha256":"c1bd4f4ed5f0db048e3835f6f8f840eb3da753717ff7c0fbaae9d4f347995150"},"schema_version":"1.0"},"canonical_sha256":"038fd13091bf72739afe149632ad68a5b34bd99ff31f33541e045ff2bcc174b4","source":{"kind":"arxiv","id":"1402.2463","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2463","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2463v3","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2463","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"AOH5CMERX5ZH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOH5CMERX5ZHHGX6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOH5CMER","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AOH5CMERX5ZHHGX6CSLDFLLIUW","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2463","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-11T11:57:42Z","cross_cats_sorted":[],"title_canon_sha256":"5c45808cd2ecff3466b74b1c470946a3f090aba72ed345b9d3503fc1ca9ed020","abstract_canon_sha256":"c1bd4f4ed5f0db048e3835f6f8f840eb3da753717ff7c0fbaae9d4f347995150"},"schema_version":"1.0"},"canonical_sha256":"038fd13091bf72739afe149632ad68a5b34bd99ff31f33541e045ff2bcc174b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:55.684158Z","signature_b64":"2aSIOB8mbu7R6Y1mzbh8ox1N6vC+NeCwjHmISUBvXaEjDxumTVbef01713akIJMUJHNMJJmmdkvGBdB/1QW3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"038fd13091bf72739afe149632ad68a5b34bd99ff31f33541e045ff2bcc174b4","last_reissued_at":"2026-05-18T02:03:55.683566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:55.683566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2463","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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fem4J9DXOrzz7iR5dnkMXw+ihk3T5ZsaqX/ORgkq5+5sRiBrkUCoeMeCSKlg52YQPawynPdpL2b5M7xmXIt1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:48:20.410846Z"},"content_sha256":"bd9578498f183d8732c78bc63fa33a03f1bd0763180895beb1c59f7b11c6d633","schema_version":"1.0","event_id":"sha256:bd9578498f183d8732c78bc63fa33a03f1bd0763180895beb1c59f7b11c6d633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AOH5CMERX5ZHHGX6CSLDFLLIUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Continuation Multilevel Monte Carlo algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Abdul-Lateef Haji-Ali, Erik von Schwerin, Fabio Nobile, Nathan Collier, Raul Tempone","submitted_at":"2014-02-11T11:57:42Z","abstract_excerpt":"We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolerance is satisfied. CMLMC assumes discretization hierarchies that are defined a priori for each level and are geometrically refined across levels. The actual choice of computational work across levels is based on parametric models for the average cost per sample and the corresponding weak and strong errors. These parameters are calibrated using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2463","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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEnhech5BA3Q78eKC/A5n93p9Hkm4oD3BNQJ6hQIZmxIXRfCX4AyRm+NRBKD9TBqsEWRMxJ40hiyOv/B7HPTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:48:20.411241Z"},"content_sha256":"f74cc275ea887661241e03a96672e90696d1ab708e0dd299c9704c4ade2aef5d","schema_version":"1.0","event_id":"sha256:f74cc275ea887661241e03a96672e90696d1ab708e0dd299c9704c4ade2aef5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOH5CMERX5ZHHGX6CSLDFLLIUW/bundle.json","state_url":"https://pith.science/pith/AOH5CMERX5ZHHGX6CSLDFLLIUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOH5CMERX5ZHHGX6CSLDFLLIUW/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-29T14:48:20Z","links":{"resolver":"https://pith.science/pith/AOH5CMERX5ZHHGX6CSLDFLLIUW","bundle":"https://pith.science/pith/AOH5CMERX5ZHHGX6CSLDFLLIUW/bundle.json","state":"https://pith.science/pith/AOH5CMERX5ZHHGX6CSLDFLLIUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOH5CMERX5ZHHGX6CSLDFLLIUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AOH5CMERX5ZHHGX6CSLDFLLIUW","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":"c1bd4f4ed5f0db048e3835f6f8f840eb3da753717ff7c0fbaae9d4f347995150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-11T11:57:42Z","title_canon_sha256":"5c45808cd2ecff3466b74b1c470946a3f090aba72ed345b9d3503fc1ca9ed020"},"schema_version":"1.0","source":{"id":"1402.2463","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2463","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2463v3","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2463","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"AOH5CMERX5ZH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOH5CMERX5ZHHGX6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOH5CMER","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:f74cc275ea887661241e03a96672e90696d1ab708e0dd299c9704c4ade2aef5d","target":"graph","created_at":"2026-05-18T02:03: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":"We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolerance is satisfied. CMLMC assumes discretization hierarchies that are defined a priori for each level and are geometrically refined across levels. The actual choice of computational work across levels is based on parametric models for the average cost per sample and the corresponding weak and strong errors. These parameters are calibrated using","authors_text":"Abdul-Lateef Haji-Ali, Erik von Schwerin, Fabio Nobile, Nathan Collier, Raul Tempone","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-11T11:57:42Z","title":"A Continuation Multilevel Monte Carlo algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2463","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:bd9578498f183d8732c78bc63fa33a03f1bd0763180895beb1c59f7b11c6d633","target":"record","created_at":"2026-05-18T02:03: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":"c1bd4f4ed5f0db048e3835f6f8f840eb3da753717ff7c0fbaae9d4f347995150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-11T11:57:42Z","title_canon_sha256":"5c45808cd2ecff3466b74b1c470946a3f090aba72ed345b9d3503fc1ca9ed020"},"schema_version":"1.0","source":{"id":"1402.2463","kind":"arxiv","version":3}},"canonical_sha256":"038fd13091bf72739afe149632ad68a5b34bd99ff31f33541e045ff2bcc174b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"038fd13091bf72739afe149632ad68a5b34bd99ff31f33541e045ff2bcc174b4","first_computed_at":"2026-05-18T02:03:55.683566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:55.683566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2aSIOB8mbu7R6Y1mzbh8ox1N6vC+NeCwjHmISUBvXaEjDxumTVbef01713akIJMUJHNMJJmmdkvGBdB/1QW3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:55.684158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2463","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd9578498f183d8732c78bc63fa33a03f1bd0763180895beb1c59f7b11c6d633","sha256:f74cc275ea887661241e03a96672e90696d1ab708e0dd299c9704c4ade2aef5d"],"state_sha256":"73cd22f512c6c974cf48c99773182682510020c46a2261dcebe646296bfa2370"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oMGCdJ4seAmiFe2ha/yHNirO2qFiPtLwYxmCIJZAKG/+mR7VbL4FnRT1OcNcsoxJscvGRGt0rEhEuwYIwnECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:48:20.413645Z","bundle_sha256":"3cf2daccb0b28bf630214f537b32060a42521cac48ada87970b1b0799f52a365"}}