{"as_of":"2026-08-08T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5db3e3ff1a0f525d996949ba065d790d117956efdabcf58284fac65f98601102","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:49:29.190505Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T00:04:06.675072Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.09906","last_updated":"2021-01-17T19:49:06Z","snapshot_observed_at":"2026-08-08T12:55:24.663136Z","submitted_at":"2020-03-22T14:22:54Z","title":"Complexity of randomized algorithms for underdamped Langevin dynamics","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.09906","snapshot_observed_at":"2026-08-06T16:49:29.190505Z","title":"Complexity of randomized algorithms for underdamped Langevin dynamics","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.12791","last_updated":"2025-07-17T05:05:27Z","snapshot_observed_at":"2026-08-06T16:36:05.876844Z","submitted_at":"2025-07-17T05:05:27Z","title":"Analysis of Langevin midpoint methods using an anticipative Girsanov theorem","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:29.190505Z"},"links":{"cited_paper":"/paper/2003.09906","citing_paper":"/paper/2507.12791"},"observation_digest":"sha256:d06d7039c9968c6b4f6829fb2a9a356e7b7bd95278045c7e216004a40023ece9","observation_id":"660b1516-1a73-4669-bb2a-f65393c2a9a5","resolution":{"observed_at":"2026-08-06T16:49:29.190505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.09906","last_updated":"2021-01-17T19:49:06Z","snapshot_observed_at":"2026-08-08T12:55:24.663136Z","submitted_at":"2020-03-22T14:22:54Z","title":"Complexity of randomized algorithms for underdamped Langevin dynamics","version":3},"cited_work":{"arxiv_id":"2003.09906","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.09906","snapshot_observed_at":"2026-06-30T00:04:06.675072Z","title":"Complexity of randomized algorithms for underdamped langevin dynamics.arXiv preprint arXiv:2003.09906, 2020","venue":null,"work_id":"2afc3d6d-4d1b-4502-a3c7-469b574fa1e3","year":2003},"citing_paper":{"arxiv_id":"2605.24937","last_updated":"2026-05-24T08:35:24Z","snapshot_observed_at":"2026-08-06T12:30:11.722284Z","submitted_at":"2026-05-24T08:35:24Z","title":"Error estimates for tamed Euler and Randomized Euler schemes for SDEs with locally Lipschitz drift with applications to non-logconcave sampling and optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T23:54:31.232162Z"},"links":{"cited_paper":"/paper/2003.09906","citing_paper":"/paper/2605.24937"},"observation_digest":"sha256:24660e99faa1e7a223b31ac3f35c9071fffc9a607da3d5155434a78ea16faad0","observation_id":"13e95f07-e960-4cce-aca7-530d3ac60b65","resolution":{"observed_at":"2026-06-30T00:04:06.676701Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2003.09906/citation-record","integrity":"/paper/2003.09906/integrity","json":"/paper/2003.09906/citation-record.json","paper":"/paper/2003.09906"},"outbound":[],"paper":{"arxiv_id":"2003.09906","last_updated":"2021-01-17T19:49:06Z","latest_version":3,"primary_category":"math.NA","snapshot_observed_at":"2026-08-08T12:55:24.663136Z","submitted_at":"2020-03-22T14:22:54Z","title":"Complexity of randomized algorithms for underdamped Langevin dynamics"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2003.09906."}