{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZNA5KC6IFXS7YVXMTFWVUXN64Y","short_pith_number":"pith:ZNA5KC6I","canonical_record":{"source":{"id":"1703.04866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-15T01:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"af1454c995b9b91c845b9efd4eb9cf7c80ca61e4807d8aaea0a085113e2b441d","abstract_canon_sha256":"51596f77a867f34b3a8a4cf0107863b622ab1efa3c079a3728afb905abf71a1b"},"schema_version":"1.0"},"canonical_sha256":"cb41d50bc82de5fc56ec996d5a5dbee605c8d22e55cc979ae001a23354e5a4db","source":{"kind":"arxiv","id":"1703.04866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04866","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04866v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04866","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZNA5KC6IFXS7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNA5KC6IFXS7YVXM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNA5KC6I","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZNA5KC6IFXS7YVXMTFWVUXN64Y","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-15T01:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"af1454c995b9b91c845b9efd4eb9cf7c80ca61e4807d8aaea0a085113e2b441d","abstract_canon_sha256":"51596f77a867f34b3a8a4cf0107863b622ab1efa3c079a3728afb905abf71a1b"},"schema_version":"1.0"},"canonical_sha256":"cb41d50bc82de5fc56ec996d5a5dbee605c8d22e55cc979ae001a23354e5a4db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:39.065366Z","signature_b64":"YpBRSU5izscher8C2jBAb1kA71E40MrXk7dGzVSKRvvE3/8eB1k+dxBUXeMxowdtzwpbX7jXs//+Ct2cxppuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb41d50bc82de5fc56ec996d5a5dbee605c8d22e55cc979ae001a23354e5a4db","last_reissued_at":"2026-05-18T00:48:39.064882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:39.064882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04866","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0NQBvmY5A3g1sZzjhRuVO7gXYWT+QsXdFRhtFhBeMb21H0+f9faIYsgMXHIVHkt3lfUwr0AGpTF0/WQCQlpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:24:24.473549Z"},"content_sha256":"e1ce68da34dfe62e6fc993f713c41a0927a3efe94f457e8a71a44f1de105a946","schema_version":"1.0","event_id":"sha256:e1ce68da34dfe62e6fc993f713c41a0927a3efe94f457e8a71a44f1de105a946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZNA5KC6IFXS7YVXMTFWVUXN64Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilevel Sequential Monte Carlo with Dimension-Independent Likelihood-Informed Proposals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Alexandros Beskos, Kody Law, Yan Zhou, Youssef Marzouk","submitted_at":"2017-03-15T01:18:57Z","abstract_excerpt":"In this article we develop a new sequential Monte Carlo (SMC) method for multilevel (ML) Monte Carlo estimation. In particular, the method can be used to estimate expectations with respect to a target probability distribution over an infinite-dimensional and non-compact space as given, for example, by a Bayesian inverse problem with Gaussian random field prior. Under suitable assumptions the MLSMC method has the optimal $O(\\epsilon^{-2})$ bound on the cost to obtain a mean-square error of $O(\\epsilon^2)$. The algorithm is accelerated by dimension-independent likelihood-informed (DILI) proposal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04866","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0jlegBcPHdaF7SXqi9chTVXr9K8hzh59jcycmM/KSJsLLQUG77IwuAcCi2RGtr9Alljl61u3g28Lp/bqJbtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:24:24.473909Z"},"content_sha256":"8261f6b384b5a2741b2652191bd642bb7c04f096b2b239e48ef47743f043a87f","schema_version":"1.0","event_id":"sha256:8261f6b384b5a2741b2652191bd642bb7c04f096b2b239e48ef47743f043a87f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNA5KC6IFXS7YVXMTFWVUXN64Y/bundle.json","state_url":"https://pith.science/pith/ZNA5KC6IFXS7YVXMTFWVUXN64Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNA5KC6IFXS7YVXMTFWVUXN64Y/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-28T10:24:24Z","links":{"resolver":"https://pith.science/pith/ZNA5KC6IFXS7YVXMTFWVUXN64Y","bundle":"https://pith.science/pith/ZNA5KC6IFXS7YVXMTFWVUXN64Y/bundle.json","state":"https://pith.science/pith/ZNA5KC6IFXS7YVXMTFWVUXN64Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNA5KC6IFXS7YVXMTFWVUXN64Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZNA5KC6IFXS7YVXMTFWVUXN64Y","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":"51596f77a867f34b3a8a4cf0107863b622ab1efa3c079a3728afb905abf71a1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-15T01:18:57Z","title_canon_sha256":"af1454c995b9b91c845b9efd4eb9cf7c80ca61e4807d8aaea0a085113e2b441d"},"schema_version":"1.0","source":{"id":"1703.04866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04866","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04866v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04866","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZNA5KC6IFXS7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNA5KC6IFXS7YVXM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNA5KC6I","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:8261f6b384b5a2741b2652191bd642bb7c04f096b2b239e48ef47743f043a87f","target":"graph","created_at":"2026-05-18T00:48:39Z","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 article we develop a new sequential Monte Carlo (SMC) method for multilevel (ML) Monte Carlo estimation. In particular, the method can be used to estimate expectations with respect to a target probability distribution over an infinite-dimensional and non-compact space as given, for example, by a Bayesian inverse problem with Gaussian random field prior. Under suitable assumptions the MLSMC method has the optimal $O(\\epsilon^{-2})$ bound on the cost to obtain a mean-square error of $O(\\epsilon^2)$. The algorithm is accelerated by dimension-independent likelihood-informed (DILI) proposal","authors_text":"Ajay Jasra, Alexandros Beskos, Kody Law, Yan Zhou, Youssef Marzouk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-15T01:18:57Z","title":"Multilevel Sequential Monte Carlo with Dimension-Independent Likelihood-Informed Proposals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04866","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:e1ce68da34dfe62e6fc993f713c41a0927a3efe94f457e8a71a44f1de105a946","target":"record","created_at":"2026-05-18T00:48:39Z","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":"51596f77a867f34b3a8a4cf0107863b622ab1efa3c079a3728afb905abf71a1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-15T01:18:57Z","title_canon_sha256":"af1454c995b9b91c845b9efd4eb9cf7c80ca61e4807d8aaea0a085113e2b441d"},"schema_version":"1.0","source":{"id":"1703.04866","kind":"arxiv","version":1}},"canonical_sha256":"cb41d50bc82de5fc56ec996d5a5dbee605c8d22e55cc979ae001a23354e5a4db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb41d50bc82de5fc56ec996d5a5dbee605c8d22e55cc979ae001a23354e5a4db","first_computed_at":"2026-05-18T00:48:39.064882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:39.064882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YpBRSU5izscher8C2jBAb1kA71E40MrXk7dGzVSKRvvE3/8eB1k+dxBUXeMxowdtzwpbX7jXs//+Ct2cxppuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:39.065366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1ce68da34dfe62e6fc993f713c41a0927a3efe94f457e8a71a44f1de105a946","sha256:8261f6b384b5a2741b2652191bd642bb7c04f096b2b239e48ef47743f043a87f"],"state_sha256":"8321d97a83a6c32613cc489b369babd19aa78d3b17751c74d1da37542cb67290"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dGkCn4/xZ8nR+HSoyTzFg7Rf2CDZSC0ei9VxXPyZ5C0aNasBpQI3cz/uum+8rpt08hGLZkUEcQN/vdKEdMACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:24:24.475901Z","bundle_sha256":"c7c7dd629dcf93150f76220ab3ebb1b0b73b8ab0e37e5deb1db269b157065106"}}