{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:63WPHPV22UCWOMZK23MMCAKCRA","short_pith_number":"pith:63WPHPV2","canonical_record":{"source":{"id":"1808.10623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-31T08:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"b28d504730c92a4f3a9c5db736bd477ec615a3ec35d0e1875e49e74d082018d5","abstract_canon_sha256":"6adc41d12dbc9869092f8ff2db1c39bab74e7108d8dd9372f68e37cf202bb84a"},"schema_version":"1.0"},"canonical_sha256":"f6ecf3bebad50567332ad6d8c1014288327beca6c6cfa9bef8aa3a270cdc4787","source":{"kind":"arxiv","id":"1808.10623","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10623","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10623v2","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10623","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"63WPHPV22UCW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"63WPHPV22UCWOMZK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"63WPHPV2","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:63WPHPV22UCWOMZK23MMCAKCRA","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-31T08:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"b28d504730c92a4f3a9c5db736bd477ec615a3ec35d0e1875e49e74d082018d5","abstract_canon_sha256":"6adc41d12dbc9869092f8ff2db1c39bab74e7108d8dd9372f68e37cf202bb84a"},"schema_version":"1.0"},"canonical_sha256":"f6ecf3bebad50567332ad6d8c1014288327beca6c6cfa9bef8aa3a270cdc4787","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:05.226126Z","signature_b64":"ZbOlsZdvWif37l6qIVaahm3rHW2mNw+QZqzbLOEsR7JFXTb8XQz4vYT/YU3OdLimA6nu0EqkJU62+HEobv5KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6ecf3bebad50567332ad6d8c1014288327beca6c6cfa9bef8aa3a270cdc4787","last_reissued_at":"2026-05-17T23:56:05.225475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:05.225475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10623","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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8xxxxvBEc9cS6KWEPS745a+oMoyjSpES1Ztb1xp1p9ABWiJ9VfFeNOwamzclybTmUBAKQ0lPqaBpsvCN+UpOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:28:37.988378Z"},"content_sha256":"55f486af90b69c278e1b56a0e901bfac498ab461d04a1170ab878266080acb8b","schema_version":"1.0","event_id":"sha256:55f486af90b69c278e1b56a0e901bfac498ab461d04a1170ab878266080acb8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:63WPHPV22UCWOMZK23MMCAKCRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Bit Multilevel Algorithms for Stochastic Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Klaus Ritter, Lukas Mayer, Mario Hefter, Michael B. Giles","submitted_at":"2018-08-31T08:15:30Z","abstract_excerpt":"We study the approximation of expectations $\\E(f(X))$ for solutions $X$ of SDEs and functionals $f \\colon C([0,1],\\R^r) \\to \\R$ by means of restricted Monte Carlo algorithms that may only use random bits instead of random numbers. We consider the worst case setting for functionals $f$ from the Lipschitz class w.r.t.\\ the supremum norm. We construct a random bit multilevel Euler algorithm and establish upper bounds for its error and cost. Furthermore, we derive matching lower bounds, up to a logarithmic factor, that are valid for all random bit Monte Carlo algorithms, and we show that, for the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10623","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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAcdCLrL9S32vuj24woqBoVOZqlkQ7E7PnYsD9ijzkkAi7Ps2W6igNGcWMxtWxqsuIVCrRFth1iRHf/vGDRtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:28:37.988737Z"},"content_sha256":"2add6717857da9875ca270525b2b8efa2a1b2091383aeacb411a4d9019e6f241","schema_version":"1.0","event_id":"sha256:2add6717857da9875ca270525b2b8efa2a1b2091383aeacb411a4d9019e6f241"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/bundle.json","state_url":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63WPHPV22UCWOMZK23MMCAKCRA/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-30T05:28:37Z","links":{"resolver":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA","bundle":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/bundle.json","state":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63WPHPV22UCWOMZK23MMCAKCRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:63WPHPV22UCWOMZK23MMCAKCRA","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":"6adc41d12dbc9869092f8ff2db1c39bab74e7108d8dd9372f68e37cf202bb84a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-31T08:15:30Z","title_canon_sha256":"b28d504730c92a4f3a9c5db736bd477ec615a3ec35d0e1875e49e74d082018d5"},"schema_version":"1.0","source":{"id":"1808.10623","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10623","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10623v2","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10623","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"63WPHPV22UCW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"63WPHPV22UCWOMZK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"63WPHPV2","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:2add6717857da9875ca270525b2b8efa2a1b2091383aeacb411a4d9019e6f241","target":"graph","created_at":"2026-05-17T23:56:05Z","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 study the approximation of expectations $\\E(f(X))$ for solutions $X$ of SDEs and functionals $f \\colon C([0,1],\\R^r) \\to \\R$ by means of restricted Monte Carlo algorithms that may only use random bits instead of random numbers. We consider the worst case setting for functionals $f$ from the Lipschitz class w.r.t.\\ the supremum norm. We construct a random bit multilevel Euler algorithm and establish upper bounds for its error and cost. Furthermore, we derive matching lower bounds, up to a logarithmic factor, that are valid for all random bit Monte Carlo algorithms, and we show that, for the ","authors_text":"Klaus Ritter, Lukas Mayer, Mario Hefter, Michael B. Giles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-31T08:15:30Z","title":"Random Bit Multilevel Algorithms for Stochastic Differential Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10623","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:55f486af90b69c278e1b56a0e901bfac498ab461d04a1170ab878266080acb8b","target":"record","created_at":"2026-05-17T23:56:05Z","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":"6adc41d12dbc9869092f8ff2db1c39bab74e7108d8dd9372f68e37cf202bb84a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-31T08:15:30Z","title_canon_sha256":"b28d504730c92a4f3a9c5db736bd477ec615a3ec35d0e1875e49e74d082018d5"},"schema_version":"1.0","source":{"id":"1808.10623","kind":"arxiv","version":2}},"canonical_sha256":"f6ecf3bebad50567332ad6d8c1014288327beca6c6cfa9bef8aa3a270cdc4787","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6ecf3bebad50567332ad6d8c1014288327beca6c6cfa9bef8aa3a270cdc4787","first_computed_at":"2026-05-17T23:56:05.225475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:05.225475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZbOlsZdvWif37l6qIVaahm3rHW2mNw+QZqzbLOEsR7JFXTb8XQz4vYT/YU3OdLimA6nu0EqkJU62+HEobv5KBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:05.226126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10623","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55f486af90b69c278e1b56a0e901bfac498ab461d04a1170ab878266080acb8b","sha256:2add6717857da9875ca270525b2b8efa2a1b2091383aeacb411a4d9019e6f241"],"state_sha256":"780df9e306bf56df0f846247a9b670b51fb1a2737ae35fac01e5f17f36c50ab6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69Cv1KDds3tsUtOPJxZpSU2C5cL7fhRz51FZo48xtrGy1ohq8jFOYOuWrMvGVoJN2zP+HJTIixqafJIlk0CQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:28:37.990696Z","bundle_sha256":"d1ba96faa39f8a396938291e31ba9984239855dc55ab88f4399fde95349783a6"}}