{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TYBV6VY4NOCJYENERLEISTCTR3","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":"3ecfbd6bc8f0e25913397e64659167793c35195eed4469826d0c84ad64f54656","cross_cats_sorted":["cs.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-22T14:22:54Z","title_canon_sha256":"cffb6689d0592d9bbabad2fa9b6bb1e085a924d8445565aa058aa4d773681e55"},"schema_version":"1.0","source":{"id":"2003.09906","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.09906","created_at":"2026-07-05T04:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"2003.09906v3","created_at":"2026-07-05T04:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.09906","created_at":"2026-07-05T04:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"TYBV6VY4NOCJ","created_at":"2026-07-05T04:21:01Z"},{"alias_kind":"pith_short_16","alias_value":"TYBV6VY4NOCJYENE","created_at":"2026-07-05T04:21:01Z"},{"alias_kind":"pith_short_8","alias_value":"TYBV6VY4","created_at":"2026-07-05T04:21:01Z"}],"graph_snapshots":[{"event_id":"sha256:9fd435857a1ad8a48eac80184cf21899442e004b2004af62019c391bc3250f02","target":"graph","created_at":"2026-07-05T04:21:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.09906/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We establish an information complexity lower bound of randomized algorithms for simulating underdamped Langevin dynamics. More specifically, we prove that the worst $L^2$ strong error is of order $\\Omega(\\sqrt{d}\\, N^{-3/2})$, for solving a family of $d$-dimensional underdamped Langevin dynamics, by any randomized algorithm with only $N$ queries to $\\nabla U$, the driving Brownian motion and its weighted integration, respectively. The lower bound we establish matches the upper bound for the randomized midpoint method recently proposed by Shen and Lee [NIPS 2019], in terms of both parameters $N","authors_text":"Jianfeng Lu, Lihan Wang, Yu Cao","cross_cats":["cs.NA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-22T14:22:54Z","title":"Complexity of randomized algorithms for underdamped Langevin dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.09906","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:bab381c87c5f054d887d0940ce519d5a31656790e5e7dbdde6d3c6758ac4a123","target":"record","created_at":"2026-07-05T04:21:01Z","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":"3ecfbd6bc8f0e25913397e64659167793c35195eed4469826d0c84ad64f54656","cross_cats_sorted":["cs.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-22T14:22:54Z","title_canon_sha256":"cffb6689d0592d9bbabad2fa9b6bb1e085a924d8445565aa058aa4d773681e55"},"schema_version":"1.0","source":{"id":"2003.09906","kind":"arxiv","version":3}},"canonical_sha256":"9e035f571c6b849c11a48ac8894c538ee60ff0d7e37bc7cbbcd7f24fc54a31bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e035f571c6b849c11a48ac8894c538ee60ff0d7e37bc7cbbcd7f24fc54a31bc","first_computed_at":"2026-07-05T04:21:01.094195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:21:01.094195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"geHmz2ce2NpVj7Bb3LitbbZ5uVUN6dv9iW52czIe7HhHacTJ5OdXi/jqzC/ShvJpSg4e09CjTCLLr0WEvgcQCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:21:01.094669Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.09906","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bab381c87c5f054d887d0940ce519d5a31656790e5e7dbdde6d3c6758ac4a123","sha256:9fd435857a1ad8a48eac80184cf21899442e004b2004af62019c391bc3250f02"],"state_sha256":"def146e3102bff97fddbe1ec5f3b02da5dd489c0eee13bc11a06deacc1368525"}