{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:63WPHPV22UCWOMZK23MMCAKCRA","short_pith_number":"pith:63WPHPV2","schema_version":"1.0","canonical_sha256":"f6ecf3bebad50567332ad6d8c1014288327beca6c6cfa9bef8aa3a270cdc4787","source":{"kind":"arxiv","id":"1808.10623","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.10623","created_at":"2026-05-17T23:56:05.225573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10623v2","created_at":"2026-05-17T23:56:05.225573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10623","created_at":"2026-05-17T23:56:05.225573+00:00"},{"alias_kind":"pith_short_12","alias_value":"63WPHPV22UCW","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"63WPHPV22UCWOMZK","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"63WPHPV2","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA","json":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA.json","graph_json":"https://pith.science/api/pith-number/63WPHPV22UCWOMZK23MMCAKCRA/graph.json","events_json":"https://pith.science/api/pith-number/63WPHPV22UCWOMZK23MMCAKCRA/events.json","paper":"https://pith.science/paper/63WPHPV2"},"agent_actions":{"view_html":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA","download_json":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA.json","view_paper":"https://pith.science/paper/63WPHPV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10623&json=true","fetch_graph":"https://pith.science/api/pith-number/63WPHPV22UCWOMZK23MMCAKCRA/graph.json","fetch_events":"https://pith.science/api/pith-number/63WPHPV22UCWOMZK23MMCAKCRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/action/storage_attestation","attest_author":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/action/author_attestation","sign_citation":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/action/citation_signature","submit_replication":"https://pith.science/pith/63WPHPV22UCWOMZK23MMCAKCRA/action/replication_record"}},"created_at":"2026-05-17T23:56:05.225573+00:00","updated_at":"2026-05-17T23:56:05.225573+00:00"}