{"as_of":"2026-08-20T04:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9a01a255d0650849b749276cc8be39dfc140da4540ed172cf8152ebafebe549","coverage":[{"denominator":115,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:15:02.864259Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T09:22:47.640653Z","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-05-22T09:24:45.848994Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"cited_work":{"arxiv_id":"2504.18911","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.18911","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Li, G., Lin, G., Zhang, Z., and Zhou, Q","venue":null,"work_id":"1220b54a-496a-4d5b-bdd7-550b1be080de","year":null},"citing_paper":{"arxiv_id":"2605.21765","last_updated":"2026-05-20T21:57:21Z","snapshot_observed_at":"2026-08-18T16:05:56.361904Z","submitted_at":"2026-05-20T21:57:21Z","title":"Position: The Time for Sampling Is Now! Charting a New Course for Bayesian Deep Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T09:22:47.640653Z"},"links":{"cited_paper":"/paper/2504.18911","citing_paper":"/paper/2605.21765"},"observation_digest":"sha256:567f00486b2212d3f0470e6f8dd4ff21869a4fc0ce2d63f2914ff60a5b041f9a","observation_id":"a7ec4f75-a630-4c0e-9a37-66b17d21894a","resolution":{"observed_at":"2026-05-22T09:24:45.851119Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.18911/citation-record","integrity":"/paper/2504.18911/integrity","json":"/paper/2504.18911/citation-record.json","paper":"/paper/2504.18911"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.271162Z","title":"TensorFlow: Large-scale machine learning on heterogeneous systems, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.271162Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:096b053f0960c8e9acaf8a1d0c27fa473991f7b008e246ddddcd7c580f927a1c","observation_id":"c16da9c4-11fc-43a3-95d2-b7e603529888","resolution":{"observed_at":"2026-08-16T10:15:02.271162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.448191Z","title":"Adaptive batch sizes for active learning: a probabilistic numerics approach","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.448191Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:2e54f3ea1f2433f508b3774aafe3d33e241c62529d8d33ccd49779fb7977f6e4","observation_id":"43449a06-0938-4c32-ac39-07b70e8b146e","resolution":{"observed_at":"2026-08-16T10:15:02.448191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.452908Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.452908Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:f11313189a1fe7d97a6bc42f97647c61e099d31985b95bf84bc51243df56318e","observation_id":"600836c6-acfe-4814-a672-b1e27a2d1ead","resolution":{"observed_at":"2026-08-16T10:15:02.452908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.09411","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.448411Z","title":"Benefits of learning rate annealing for tuning-robustness in stochastic optimization","venue":null,"work_id":"9e7a7568-b2a0-4934-b7f7-27870e641026","year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.456916Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:84f36b4d047938bb132f89f17ff864ef28b7284db347e902af16c1607bddf82a","observation_id":"822d7b43-b0df-45c2-8f21-191e3b165f15","resolution":{"observed_at":"2026-08-16T10:15:03.456074Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15155","last_updated":"2025-04-05T09:24:48Z","snapshot_observed_at":"2026-08-14T07:24:52.562859Z","submitted_at":"2025-01-25T09:37:59Z","title":"Sampling with time-changed Markov processes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15155","snapshot_observed_at":"2026-08-16T10:15:02.461542Z","title":"Sampling with time-changed Markov processes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.461542Z"},"links":{"cited_paper":"/paper/2501.15155","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:7a294627e6e0c24b612480b9f572f039d70142fc5388fe695cecc82cf53f552f","observation_id":"de321f37-c627-4be8-9180-5ec7a8082a5a","resolution":{"observed_at":"2026-08-16T10:15:02.461542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.466499Z","title":"The fundamental incompatibility of scalable Hamiltonian Monte Carlo and naive data subsampling","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.466499Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:8bd8d06479443125c92bab95f8a0695ddeb6533183ef37f1e96d0aa3da331aec","observation_id":"b00ebad5-b526-4c66-9f89-eebb126a56b8","resolution":{"observed_at":"2026-08-16T10:15:02.466499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.471905Z","title":"AdamMCMC: combining Metropolis-adjusted Langevin with momentum-based optimization, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.471905Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:d9044b500e75c70ee0c32db0b850933d9ce9cb234019d1c7c5500ed5c42b0c29","observation_id":"97b9a478-d0d6-4845-a157-d93c5f038c8b","resolution":{"observed_at":"2026-08-16T10:15:02.471905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.477632Z","title":"Covertype","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.477632Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:f45706e83540b0827a9c7ce9f4e64707cfe5aab02f09537b006815cfe4cda495","observation_id":"2d72e991-c53e-4f5c-b98b-56de61b0e230","resolution":{"observed_at":"2026-08-16T10:15:02.477632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08259","last_updated":"2024-08-15T16:59:22Z","snapshot_observed_at":"2026-08-16T13:26:12.377132Z","submitted_at":"2024-08-15T16:59:22Z","title":"Incorporating Local Step-Size Adaptivity into the No-U-Turn Sampler using Gibbs Self Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08259","snapshot_observed_at":"2026-08-16T10:15:02.482579Z","title":"Incorporating local step-size adaptivity into the No-U-Turn Sampler using Gibbs self tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.482579Z"},"links":{"cited_paper":"/paper/2408.08259","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:36cefc9806801e541817186dd1cf319e8cc2f5cf99879d4bd026934dd625772e","observation_id":"602903e0-d6bd-4b40-bf72-baf46670c484","resolution":{"observed_at":"2026-08-16T10:15:02.482579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15253","last_updated":"2025-06-24T21:42:56Z","snapshot_observed_at":"2026-08-16T13:58:26.887748Z","submitted_at":"2024-04-23T17:39:20Z","title":"GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlo","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15253","snapshot_observed_at":"2026-08-16T10:15:02.488745Z","title":"GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlo","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.488745Z"},"links":{"cited_paper":"/paper/2404.15253","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:86afc9f867fe8cc3d387b5674a25ea5ba74a3e15a9b3ab438e6f28a7185ab032","observation_id":"561ffee0-0b70-469f-8256-4455fdd60047","resolution":{"observed_at":"2026-08-16T10:15:02.488745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.492978Z","title":"Long-run accuracy of variational integrators in the stochastic context","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.492978Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:e457571afae8dc24c0a326606a96f54cff8f3e018f0281defc263f57ba12478f","observation_id":"188bcaa2-d938-41c5-8296-01f9e541f2d6","resolution":{"observed_at":"2026-08-16T10:15:02.492978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.496714Z","title":"Randomized Hamiltonian Monte Carlo","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.496714Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:364099b970e4abbc989d6440b43ef183ebb0a0ec71bcaaf006d6c563a6d3e051","observation_id":"8bfb8ddd-7246-46d7-bd19-339f2895a36e","resolution":{"observed_at":"2026-08-16T10:15:02.496714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.500410Z","title":"Handbook of Markov chain Monte Carlo","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.500410Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:e126d3168d26a8f1085dffbd2738513d0264ea816b8c7b4fdbf90faaaa2f1434","observation_id":"6a15592d-d69f-4d95-9785-8c972865f7d0","resolution":{"observed_at":"2026-08-16T10:15:02.500410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.504257Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.504257Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:3912031f1c2be74c4c7a35a45ca7c6e31de49668b9c1536718dc0fb3ce077283","observation_id":"6d590cfa-68ed-43e4-bd38-8e5afb25f862","resolution":{"observed_at":"2026-08-16T10:15:02.504257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.508088Z","title":"Stochastic boundary conditions for molecular dynamics simulations of ST2 water","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.508088Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:92abeea94a937bcd169cc9dc62614792a93e3a4aea14d113c7869846169495ad","observation_id":"c258e0dd-113a-4840-8fb9-e2438bfaa6de","resolution":{"observed_at":"2026-08-16T10:15:02.508088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.511778Z","title":"Accurate sampling using Langevin dynamics","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.511778Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:6851eefa27a1b4a58b1287e11f0940b35c4d60da490952ca175c25e1209331d4","observation_id":"7cebf363-4322-4789-a9b0-94a75bffe7ff","resolution":{"observed_at":"2026-08-16T10:15:02.511778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.515569Z","title":"Cariñena, Eduardo Martínez, and Miguel C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.515569Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:292b4760a74aba96a585e6f978f87967298b869268836ec4521baf8a0b88f0de","observation_id":"f2497e3a-a223-4954-9c75-7ebd82e17841","resolution":{"observed_at":"2026-08-16T10:15:02.515569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.519432Z","title":"Statistical practice: Markov chain Monte Carlo in practice","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.519432Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:a0e68c567c1ef7cb864144e96aa8c166f0356738199383aefd2b12cf6e1fc0d1","observation_id":"6cd57754-a694-4b08-bf32-87f327ed8fbc","resolution":{"observed_at":"2026-08-16T10:15:02.519432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.523236Z","title":"Unbiased kinetic Langevin Monte Carlo with inexact gradients","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.523236Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:9f2b61ae66c5e0aa0d1cd71de21bc9cefc98842cfdf4fbd7618945ea33e0b514","observation_id":"771ff04b-f128-485c-b6b5-39756d7d17ec","resolution":{"observed_at":"2026-08-16T10:15:02.523236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.528350Z","title":"Fox, and Carlos Guestrin","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.528350Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:2f54b754e191054981bcc9edd819cb5c5c8e5564b556d825f5c9b3a0dc8d4acb","observation_id":"2c20a560-bd0c-4d62-9fee-a5a828c5d092","resolution":{"observed_at":"2026-08-16T10:15:02.528350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.532736Z","title":"On the convergence of a class of adam-type algorithms for non-convex optimization, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.532736Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:df81675b0bb744f37660b0f7bb395af24a918d6daed92c0b6aa2cc6ce7fdd149","observation_id":"b179e430-500f-4a57-baa9-c6826db410c5","resolution":{"observed_at":"2026-08-16T10:15:02.532736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11479","last_updated":"2026-06-18T08:58:43Z","snapshot_observed_at":"2026-08-16T12:49:58.832323Z","submitted_at":"2025-03-14T15:05:52Z","title":"Towards practical PDMP sampling: Metropolis adjustments, locally adaptive step-sizes, and NUTS-based time lengths","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.11479","snapshot_observed_at":"2026-08-16T10:15:02.537137Z","title":"Towards practical PDMP sampling: Metropolis adjust- ments, locally adaptive step-sizes, and NUTS-based time lengths","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.537137Z"},"links":{"cited_paper":"/paper/2503.11479","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:865ef5ac1527f93748be43a871e6f88052e1d1b264e887e478e512f768b84322","observation_id":"26ba2992-c0fa-4831-8ae6-e34731411a2b","resolution":{"observed_at":"2026-08-16T10:15:02.537137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.541823Z","title":"A general system of differential equations to model first-order adaptive algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.541823Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:a8971bdb7a0e115a0556ed4eecd1d228fe61bb4274da86db0d0b448906397a87","observation_id":"d4432329-36e2-4cde-a47c-6a274e8d47bf","resolution":{"observed_at":"2026-08-16T10:15:02.541823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.546688Z","title":"On sampling from a log-concave density using kinetic langevin diffusions","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.546688Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:57941f43ea06284d2f9d4abf0ad273ace16515d022b657533641d4904fc78ef7","observation_id":"be280fe3-ef0d-42da-a1ef-9aabd49cc043","resolution":{"observed_at":"2026-08-16T10:15:02.546688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.551333Z","title":"Note on learning rate schedules for stochastic optimization","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.551333Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:63de58ffe68997c27528f3906cc1a0a65e54bac7174dd21f593e94fb9bb82a71","observation_id":"9d07e91a-8772-40fa-9f0a-45f054c3683e","resolution":{"observed_at":"2026-08-16T10:15:02.551333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.555906Z","title":"Role of molecular dynamics and related methods in drug discovery","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.555906Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:2ed6fc9940c6a9dd778e491db0d93dd11435c04df03c8d9bff8fd30d96eb2191","observation_id":"113610a8-c927-475d-a0f5-b0a9e60120c9","resolution":{"observed_at":"2026-08-16T10:15:02.555906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.560808Z","title":"Optimal linear decay learning rate schedules and further refinements, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.560808Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:b7e28a9b302e853fb488dca21a715fbaca65ca4889cee2b24012e822b5ee10ad","observation_id":"4e88d0ae-3dd4-45d3-afdd-0bb98c471773","resolution":{"observed_at":"2026-08-16T10:15:02.560808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.566416Z","title":"A simple convergence proof of Adam and Adagrad","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.566416Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:79aa1b77f611a8f9f3b1db89d11334d393a1b167ca82ddba3092072ecf595c45","observation_id":"ba888e33-b844-4302-929c-2f759b49fc13","resolution":{"observed_at":"2026-08-16T10:15:02.566416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.571135Z","title":"The mnist database of handwritten digit images for machine learning research","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.571135Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:1b7d90ce634d7fb1a74888e30c711e24d8ce05e93e0cc3575aee72ea5d192762","observation_id":"775904cf-d31d-4a11-a7ea-7306fb0ef0d9","resolution":{"observed_at":"2026-08-16T10:15:02.571135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.574899Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.574899Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:542b18f388c9923f0b19a2485d6fe93a6cb0434530511bf3b0159fe274b9fb3a","observation_id":"c32c2a6b-0fe5-4a20-b80d-003c5b3a2ca1","resolution":{"observed_at":"2026-08-16T10:15:02.574899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.578576Z","title":"Bayesian sam- pling using stochastic gradient thermostats","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.578576Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:06092f164196fefbdb90a777419b119d1831e2844c7b4c0cc07d141222887167","observation_id":"426246b9-c718-415b-a66b-19413b7294ec","resolution":{"observed_at":"2026-08-16T10:15:02.578576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.582499Z","title":"Incorporating Nesterov Momentum into Adam","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.582499Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:3c25386383891803ee6d57839943ce3ed2375ffc902fd4b695181e356644df54","observation_id":"4c940ee3-4928-490c-9b19-5d7ab753b1c6","resolution":{"observed_at":"2026-08-16T10:15:02.582499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.586466Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.586466Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:a4ec2fc9791fcf61be932d5e481972d830c15d18b6d90174a8cbcc20abf91351","observation_id":"674189ed-24c0-45a9-b25b-8904c8e42a1a","resolution":{"observed_at":"2026-08-16T10:15:02.586466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.590131Z","title":"Adaptive subgradient methods for online learning and stochastic optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.590131Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:2dd4326c6400dd33cb95d48414760b98b2e2edd0d89f4afd1f14d8606f7905fb","observation_id":"30abee3c-a53f-499f-8bbf-377bb9541e27","resolution":{"observed_at":"2026-08-16T10:15:02.590131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.14542","last_updated":"2023-04-21T17:06:30Z","snapshot_observed_at":"2026-08-16T18:06:22.587474Z","submitted_at":"2021-07-30T10:45:03Z","title":"Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics","version":3},"cited_work":{"arxiv_id":"2107.14542","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.14542","snapshot_observed_at":"2026-08-16T10:15:03.261602Z","title":"Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics","venue":"math.PR","work_id":"b2a13827-7f5c-4392-a8a0-0b435b95193d","year":2021},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.594156Z"},"links":{"cited_paper":"/paper/2107.14542","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:0a8b0e2503e322ff83fa37a68590286f71479c766b225f3cf2d9d4a36ec103fc","observation_id":"9ae8b4fa-96d5-43e7-b3a7-2cc07f876d21","resolution":{"observed_at":"2026-08-16T10:15:03.267003Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.598247Z","title":"Peláez, Charlles R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.598247Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:118c69104c35b19cca988d977681cef6be1d54173033e3d41a76362a115fc878","observation_id":"8092d7f3-cd92-44fe-87d2-8cf29e4533f5","resolution":{"observed_at":"2026-08-16T10:15:02.598247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.601934Z","title":"New high-order runge-kutta formulas with step size control for systems of first and second-order differential equations","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.601934Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:784c402a1017770034a57aeeffd6dc8c654171ef75109602211e6ba6507aec9a","observation_id":"97239e07-0284-4d34-8168-1930a869a2c3","resolution":{"observed_at":"2026-08-16T10:15:02.601934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2311.14201","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.235569Z","title":"On the convergence of adaptive approximations for stochastic differential equations","venue":null,"work_id":"c15a60b7-72b2-45ff-95bf-035ad1b354b4","year":2023},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.605592Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:9181920a886107cc39314ea32219f067429eea8d1dfb9445b90d9906a6b44f4f","observation_id":"044d7134-fc58-4fb8-a2f1-9ae411f5c2f4","resolution":{"observed_at":"2026-08-16T10:15:03.242973Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.609253Z","title":"Riemann manifold langevin and hamiltonian monte carlo methods","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.609253Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:28a865b25b14cfca42ecb5b368f16b0abf041f4fea97c1f388fdc1105e2541d8","observation_id":"1ccbdbb2-0152-4c2f-9b2d-39e7172c95aa","resolution":{"observed_at":"2026-08-16T10:15:02.609253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.612981Z","title":"Velocity jumps for molecular dynamics","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.612981Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:3efb42913e4702ac5f932e5cadd968c1abbd4014968f05b280cb78cc01e31f53","observation_id":"f47e80e7-f6c8-4c12-87de-472d6195b9ce","resolution":{"observed_at":"2026-08-16T10:15:02.612981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.617012Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.617012Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:26d8ff1085aee52be20a06b343cb3ad413ca94656841ae1a5153bdff71747373","observation_id":"dc883e66-2c32-4367-aed5-39ce93de3532","resolution":{"observed_at":"2026-08-16T10:15:02.617012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.620555Z","title":"Hopkins, Scott Le Grand, Ross C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.620555Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:b3e546fd502122df61fa68ff086240886930a4eaf9ff5bd0f5231e17e9eca823","observation_id":"1051967c-f0fb-4080-b6f1-15ecd1db4abe","resolution":{"observed_at":"2026-08-16T10:15:02.620555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.624579Z","title":"Horowitz","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.624579Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:75bedfdde4aee04b07c74e7706c1a9ba0a2caa4434c4713d5eeee0f22e64d4a3","observation_id":"fd794bea-4192-4778-a53a-e1963a5abb74","resolution":{"observed_at":"2026-08-16T10:15:02.624579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.628471Z","title":"The adaptive verlet method","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.628471Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:f1cba83d085b9f673532a916c04237f263f91273f8dfc9bf477101ecb1eadae4","observation_id":"50bcb021-266b-492b-b1ee-16f4adcab78b","resolution":{"observed_at":"2026-08-16T10:15:02.628471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.359848Z","title":"Binarized neural networks","venue":null,"work_id":"3b63b1ab-6b04-458c-a180-0a6b1d61d94e","year":2016},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.632056Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:a626e68387a7e95918e6276fa6d2350f22ebb5887a3e93c1327274ad188cc39e","observation_id":"608b371f-715c-44bb-9709-c8b5089e5442","resolution":{"observed_at":"2026-08-16T10:15:04.365100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.636086Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.636086Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:31471e7c7a81f042139d616b77bdeee6aae2c4fb86151f29e9da20f630cd465f","observation_id":"d31000de-5878-41a2-adc2-2a130fdd40d1","resolution":{"observed_at":"2026-08-16T10:15:02.636086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.640139Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.640139Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:71ccdfdf1ae0aebfb8871a677c93e970a3727c7fe326850aceb86f423e645480","observation_id":"6ed22500-9caf-442b-9558-d8c04ca0508d","resolution":{"observed_at":"2026-08-16T10:15:02.640139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.644166Z","title":"Single-seed generation of Brownian paths and integrals for adaptive and high order SDE solvers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.644166Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:b90cd45d0bb48efb163927b17dd435cfd6dbe4a9e9923f4a7f875f7f1d1dbf49","observation_id":"a4220cf6-785a-4742-8fc3-754ef7c27fc4","resolution":{"observed_at":"2026-08-16T10:15:02.644166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.328966Z","title":"Adaptive stochastic methods for sampling driven molecular systems","venue":null,"work_id":"6074d096-ca36-4d09-985e-849bdf56247f","year":2011},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.648414Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:55d7c3118077fc354aa0c7e8a39c132c406ca0fc317425196b53565bec4df15b","observation_id":"6d8c6d22-ad80-401f-a483-38df438fb6f0","resolution":{"observed_at":"2026-08-16T10:15:04.332816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.314569Z","title":"Hands-on Bayesian neural networks—a tutorial for deep learning users","venue":null,"work_id":"48e21de4-f8c0-4da5-b35d-0c937ea0d065","year":2022},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.652323Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:6a3aa9b70a789298a7cd002952ae6b6abd3fc45974936c26c450007c1e7516ac","observation_id":"b25e8029-8baf-4c85-ba34-65f9d20f5745","resolution":{"observed_at":"2026-08-16T10:15:04.319557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.300478Z","title":"Higher-order damping mechanisms with applications in optimisation and machine learning","venue":null,"work_id":"5e3dff32-bc72-4a80-8b28-034e0c98d195","year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.656782Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:c5b9a593cff1b78b52a25529ebe1f12cef5f7da9ad0fd506a9eeaae00debac3d","observation_id":"78c38a5b-3d73-4002-8b2a-993dde316bd6","resolution":{"observed_at":"2026-08-16T10:15:04.304879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.286075Z","title":"Analyzing and improving the training dynamics of diffusion models","venue":null,"work_id":"bceecd15-cb07-4bc1-a9d2-949341c4fa5a","year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.660837Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:e5e554e8af9ac7c6ef26e4d3c78c235bb8c46c3f124e172ca4d67c06728f92e1","observation_id":"e70a2dd6-71ea-4f15-9b61-55c29aced220","resolution":{"observed_at":"2026-08-16T10:15:04.290775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.664937Z","title":"A style-based generator architecture for generative adversarial networks, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.664937Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:f70c1cf193bbd3db1dcf94ca9faf68f0edaf47386aca093054c9a6c11c35756d","observation_id":"25cccefd-b0a3-4967-bf44-2c0e3491a169","resolution":{"observed_at":"2026-08-16T10:15:02.664937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.669455Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.669455Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:18c81ad3ae7ca6689275c3b81db0ec97040ee1c13e2cd03a90265ed10ff9bdda","observation_id":"5b0ff181-3988-4029-bee0-93c6bd110f35","resolution":{"observed_at":"2026-08-16T10:15:02.669455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.251193Z","title":"Computational methods in ordinary differential equations","venue":null,"work_id":"9e0f4dd6-b212-4ee1-ac7d-a7229a1dc38b","year":1973},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.673767Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:6643b572e8396c5e6328f6bc258a6a180eb2bccfa5d9d87ab21c79aeed40e0f3","observation_id":"0b74f05a-7104-49fc-bce9-919f699507b3","resolution":{"observed_at":"2026-08-16T10:15:04.256450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.237003Z","title":"Rational construction of stochastic numerical methods for molecular sampling","venue":null,"work_id":"1b58980a-f114-490b-9351-b7587fd7758b","year":2012},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.678110Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:9cf08771ecd8d15ad0572703291ca0c149e51cd7f244e7179b6f8fc4c3f629f7","observation_id":"b5ca6e3b-7ff2-4eba-82cf-79880ee05e9c","resolution":{"observed_at":"2026-08-16T10:15:04.241280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.224415Z","title":"Efficient molecular dynamics using geodesic integration and solvent–solute splitting","venue":null,"work_id":"4b70aa47-5ce7-4756-85b6-ad17f1b14a99","year":2016},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.682886Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:79fd842f27b2205eb969edc1d577b0fd07ec20ac10eee925744af10ba8c1bcd8","observation_id":"e19820ac-95b6-475d-8999-9f1e2aeefdb5","resolution":{"observed_at":"2026-08-16T10:15:04.228348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.210191Z","title":"The computation of averages from equilibrium and nonequilibrium Langevin molecular dynamics","venue":null,"work_id":"4eec2291-414a-47d5-9695-5335abf4e650","year":2016},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.687364Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:9dfdf29c608fd69c484cd3145f20167715630f05f141b3ea083799ce3f77df53","observation_id":"a6ef8470-34db-4862-918a-9f307e380b29","resolution":{"observed_at":"2026-08-16T10:15:04.215084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.195760Z","title":"Ensemble preconditioning for Markov chain Monte Carlo simulation","venue":null,"work_id":"816024b9-3f61-4f7e-b8de-001be3882d94","year":2018},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.692560Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:15a36cfa0cde2f066371cd983fe1e23d96103ff62066bd8ce50f0c563619f4c1","observation_id":"7e502444-5572-4861-82f6-aa20fe30028c","resolution":{"observed_at":"2026-08-16T10:15:04.200419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.181034Z","title":"Molecular Dynamics: With Deterministic and Stochastic Numerical Methods","venue":null,"work_id":"b4298f7b-ce23-4ae4-a50e-238856cb6410","year":2015},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.697250Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:7f57cb59bf4f3c70ec1c25d65b05d261da7be945d5c23efdf11d68c40365f1ff","observation_id":"c4656043-a3aa-4e28-bd7d-13c7815e16be","resolution":{"observed_at":"2026-08-16T10:15:04.185684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.166791Z","title":null,"venue":null,"work_id":"fd655ca7-c18f-41c5-9a92-e496597c7ac0","year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.702033Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:9f64cd31b689544fe840713b41cbd318c223ff34d0272537cc062ea077295c39","observation_id":"bec2e060-1f7b-4ad3-b65b-210799cdc9fd","resolution":{"observed_at":"2026-08-16T10:15:04.171215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.152351Z","title":null,"venue":null,"work_id":"44daa712-cd82-49fd-aa19-4ebd419812ac","year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.706276Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:3a96f286c8ca635958a7180cab11599e2eb51b43d190572390f13a26455cb648","observation_id":"293009fb-a179-473c-93a9-d5a48b63ec7d","resolution":{"observed_at":"2026-08-16T10:15:04.157089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.137930Z","title":"How do adam and training strategies help bnns optimization","venue":null,"work_id":"5a6e6f2c-5ccb-49c1-9998-c8c59ea7477c","year":2021},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.709903Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:a59d3ac9a430a0bc2c68712d93c225ba3adbcea974ee4cccbf719e827cb1ffad","observation_id":"a5061662-1c5b-4e21-8f4d-e9a12f3247f5","resolution":{"observed_at":"2026-08-16T10:15:04.142008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.124396Z","title":"Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise","venue":null,"work_id":"534b8de9-14dd-4bee-969c-71caf622918c","year":2002},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.713691Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:d8eef28db921a8e91802d6e1fd6af6b4de49ec2eba411753cdf9e2d9e9c0cae9","observation_id":"9e7e7263-2c79-4dc8-abb9-f50b78cc2014","resolution":{"observed_at":"2026-08-16T10:15:04.128925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.06162","last_updated":"2018-12-14T20:49:09Z","snapshot_observed_at":"2026-08-14T17:43:20.166812Z","submitted_at":"2018-12-14T20:49:09Z","title":"An Empirical Model of Large-Batch Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.06162","snapshot_observed_at":"2026-08-16T10:15:02.717474Z","title":"An empirical model of large-batch training","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.717474Z"},"links":{"cited_paper":"/paper/1812.06162","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:853323096bd376981c23968b80048805dca602316e4019274d3c0bce26ed4094","observation_id":"8c521396-6745-4578-85a6-180a5a6cfee2","resolution":{"observed_at":"2026-08-16T10:15:02.717474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.108740Z","title":"Adaptive bound optimization for online convex optimization, 2010","venue":null,"work_id":"2a9292a7-9fbe-4703-9a4e-c349886def2d","year":2010},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.721389Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:4bfa7426443d80b162f0dadecb21c1af1e0a5e1d990ac0647b4ed515296ba0e4","observation_id":"10e5138a-2b92-49fa-ac39-2c031d9205ea","resolution":{"observed_at":"2026-08-16T10:15:04.114064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.092990Z","title":"Design of quasisymplectic propagators for langevin dynamics","venue":null,"work_id":"bfcd2b05-f9a0-4875-8adb-bc2de31af212","year":2007},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.725222Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:ca712c85a4d54cd136fb4f311efa32567d77e43c444df80a86e93f99e2fdf9eb","observation_id":"4809fbae-970b-4f26-927b-62707718ad64","resolution":{"observed_at":"2026-08-16T10:15:04.098592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.078297Z","title":"Rosenbluth, Marshall N","venue":null,"work_id":"40cfbf50-d8a7-4b17-8af0-28e1a9fa0869","year":1953},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.728836Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:9b613bce311e1e360ccab11f288e14a8a989cb7a985be5d2c53cbb67ac7edd15","observation_id":"6cdd6788-c0ba-4431-a86e-ccc5c581f23a","resolution":{"observed_at":"2026-08-16T10:15:04.083535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.064083Z","title":"Numerical integration of stochastic differential equations with nonglobally lipschitz coefficients","venue":null,"work_id":"8a2aebd0-8ed4-4cfc-8bab-e80ec4381820","year":2005},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.732472Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:50acb7adb005630a09a11b532670cf08e977fc83428b1643ee86975077cf8c7f","observation_id":"84363ede-fa6f-4fa6-9fc8-3174e4bde9b3","resolution":{"observed_at":"2026-08-16T10:15:04.068727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.049308Z","title":"High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion","venue":null,"work_id":"bd3b1da3-9daf-4f2f-8aa4-359dac79df8a","year":2021},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.736176Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:48c5b0ea44cefd3c1ef2d579bfe6f8d3c9535c0b532381ba4938d4622869d9eb","observation_id":"83876ff5-dd89-4cc8-b5ad-f70734f7617a","resolution":{"observed_at":"2026-08-16T10:15:04.054092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.036349Z","title":"Monnahan, James T","venue":null,"work_id":"178438d3-b1a3-4649-8b0d-706833d793c4","year":2017},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.740126Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:1b490cd812a6eb829139754b63f140ccd6dc6476048edd6cfa8dac19809c75ea","observation_id":"b87ec630-aeb6-4af1-be3c-2c0d5a04ce02","resolution":{"observed_at":"2026-08-16T10:15:04.040245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.022148Z","title":"Bayesian neural networks, 2018","venue":null,"work_id":"ac10ae85-98d4-4c36-9e54-0b5ef5d85f03","year":2018},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.744090Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:59abc1fcf4104e3a89c06bd77814a155d28383e7bbc765d1ce9aae77092941d5","observation_id":"8499b3f1-0a2c-4494-b82d-24f923dfbb1d","resolution":{"observed_at":"2026-08-16T10:15:04.026471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:04.006549Z","title":null,"venue":null,"work_id":"32d32ea8-af06-4cc1-a844-fbda0ec9b15b","year":1996},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.747926Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:5fb8e7f7fcb5ca0ad5b1e0d7ea878525b8bea4e82145169e8c3e093860503aa1","observation_id":"95fa15f9-85b9-4543-bb6b-ce761856c0ce","resolution":{"observed_at":"2026-08-16T10:15:04.011585Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.989644Z","title":null,"venue":null,"work_id":"b55243dc-92a6-4034-96cf-5f98806da221","year":2001},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.752402Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:9b3a9978b7fc3a3f53e4e0912988d6d65b80ccb3bc6317204837ac91234ae13a","observation_id":"41296582-ba34-4798-ac5a-601302a9491e","resolution":{"observed_at":"2026-08-16T10:15:03.994113Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.974431Z","title":"PyTorch: An imperative style, high-performance deep learning library","venue":null,"work_id":"11ab6103-d868-42ba-99dd-096928cdb81b","year":2019},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.756301Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:339d7cb26f5b82b91d75b5922f004f150f4115ff4683c2b1eee7c749bb7633df","observation_id":"1bc9e479-9e58-4f50-bb8d-8d46e24a4572","resolution":{"observed_at":"2026-08-16T10:15:03.979480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.960517Z","title":"Sampling from Bayesian neural network posteriors with symmetric minibatch splitting Langevin dynamics","venue":null,"work_id":"783d11f6-572c-4ad3-b41a-f43324fd12a0","year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.760085Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:e96870a2da17023676dd67c523e1b988de49a9332edf099e3867f16e12049ca6","observation_id":"56b81ff7-90a3-4952-ab0e-f1fa42db6c38","resolution":{"observed_at":"2026-08-16T10:15:03.964786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.945711Z","title":"Stochastic processes and applications: diffusion processes, the Fokker-Planck and Langevin equations","venue":null,"work_id":"253f49d3-4737-4888-b9d4-fff006156678","year":2014},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.763839Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:bdd67f7f8bcb3c34819bed4d7b5d7a2b1012e4312f346b4b82ff4e426447d72b","observation_id":"1560ef3e-a8de-4537-8eca-20301a93e9fe","resolution":{"observed_at":"2026-08-16T10:15:03.950507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.929418Z","title":"Numerics with coordinate transforms for efficient Brownian dynamics simulations","venue":null,"work_id":"c066f2af-f6c7-4d67-9671-d36bfee4e27e","year":2024},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.767855Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:1594e2049253da47274bbce8e24f1a89937f9e599f5ae15f0e59309442be5581","observation_id":"3cb8eef1-a9b6-42a8-83b7-5fabb121d2bf","resolution":{"observed_at":"2026-08-16T10:15:03.935077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.772475Z","title":"Unsupervised representation learning with deep convolutional generative adversarial networks, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.772475Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:cd1149e41c0531e4336cc30be3e34348434a9d5a6d6067886f8778a97af1f514","observation_id":"84b7ef6d-c366-4040-bef0-261e089f0aa6","resolution":{"observed_at":"2026-08-16T10:15:02.772475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.904981Z","title":"Improving language understanding by generative pre-training [openai blog]., 2018","venue":null,"work_id":"d4e00176-b0e6-45ac-9a96-1a49514361de","year":2018},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.776607Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:a8ec7c2ff8bf800e02c9a6cc1b74e866ba2ccb802434462947d9c0b27856c1f3","observation_id":"0caff4c7-393d-4347-a3fc-497d51cf8df2","resolution":{"observed_at":"2026-08-16T10:15:03.909778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.780365Z","title":"Reddi, Satyen Kale, and Sanjiv Kumar","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.780365Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:a71c96f2aa9f1149d6ce4ef622acae40620f736e6b470d0305bb7befcadb3789","observation_id":"a0fcef43-2c62-474b-8c3b-d3cfc731edbf","resolution":{"observed_at":"2026-08-16T10:15:02.780365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.880898Z","title":"Sarhan, and M","venue":null,"work_id":"6f735018-2e6c-4ea9-a681-a57f3f483dc1","year":2023},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.784085Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:d5542832747349a9926b74994c4b6d7075dbaa00704a81ea4acb8cb76a03fc53","observation_id":"20736a53-2459-4478-8c8a-857f5d336034","resolution":{"observed_at":"2026-08-16T10:15:03.885177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.864898Z","title":"Metropolis adjusted Langevin trajectories: a robust alternative to Hamiltonian Monte Carlo, 2023","venue":null,"work_id":"105ab7cf-1e21-4d8c-bef0-eb8faa3cf424","year":2023},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.788615Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:fcbb1fbb360fc279f10ce3c8cf2e06a6c8daeab3c885124eb0dbbce56e489f5c","observation_id":"c4ee9b66-a47e-489d-9274-08d10b1f7397","resolution":{"observed_at":"2026-08-16T10:15:03.870813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.851313Z","title":"A Stochastic Approximation Method","venue":null,"work_id":"a7a5af0b-0b90-4066-9622-5b9a66595c2c","year":1951},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.792832Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:cc98a0a75a89041500b573dee1ba0cd5fc3aff558b3017a77472b11ce4f0d076","observation_id":"791e67fc-ba4b-4521-a7c6-b4c2887e3760","resolution":{"observed_at":"2026-08-16T10:15:03.855575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.797235Z","title":"Optimal scaling of discrete approximations to Langevin diffusions","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.797235Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:23280d940b2fc3dea834eb07e42655d140806b8969e642a38d1e414beeab62ce","observation_id":"c5adfdda-0dd8-4012-ae2b-536bffbef94b","resolution":{"observed_at":"2026-08-16T10:15:02.797235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:02.801574Z","title":"Roberts and Richard L","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.801574Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:56fde7790e14664fb68b0755e1c3424c6e7fd397fd49b3c5ce37dafd0c190bb8","observation_id":"342cb840-466f-4f15-b671-ca3ded3b02ac","resolution":{"observed_at":"2026-08-16T10:15:02.801574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.818808Z","title":"An adaptive discretization algorithm for the weak approximation of stochastic differential equations","venue":null,"work_id":"95c46fbc-cc3a-43f3-b40f-c59ca01156e1","year":2004},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.805832Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:242930ab83b3ef12acf27d850e4e56def8044d3cda31020e13a3f0fac62fd17c","observation_id":"16bba334-0fb2-4c0f-bc10-c2d42662068d","resolution":{"observed_at":"2026-08-16T10:15:03.823198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.805105Z","title":"Langevin dynamics with variable coefficients and nonconservative forces: from stationary states to numerical methods","venue":null,"work_id":"4ed2a5b4-208d-4e14-a57c-d9649eb2b8be","year":2017},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.810312Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:c4b5322589411e3c34e8b03aba9e2f1ec6a79924ca597c5504cf7f2daf589fc1","observation_id":"20869330-43e2-493a-9765-42a967d25dc3","resolution":{"observed_at":"2026-08-16T10:15:03.809637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.792270Z","title":"Biomolecular dynamics at long timesteps","venue":null,"work_id":"90a22c54-d25e-47f3-9df1-45ab1743f9d4","year":1997},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.814549Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:26cbb10a0c0fe000a6116a8016003131ca714ab36087a508004060fb4f06bbb3","observation_id":"b9f5c713-9d98-49f6-88b6-642cafcc128c","resolution":{"observed_at":"2026-08-16T10:15:03.796147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.779735Z","title":"Covariance-controlled adaptive langevin thermostat for large-scale bayesian sampling","venue":null,"work_id":"5a511bfa-d93b-43ce-9213-660cb4499109","year":2015},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.818809Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:27715f71d106f5575723c36b97ab5fb041199c2fac80a13ae3c1fb4b211ef4ad","observation_id":"d40ee48f-1914-4785-85f3-b5ae302a3eba","resolution":{"observed_at":"2026-08-16T10:15:03.783718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2501.16055","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.083284Z","title":"Random reshuffling for stochastic gradient Langevin dynamics","venue":null,"work_id":"58b4172b-2f91-43cc-8610-164079bd41fe","year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.823396Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:d5d817358a6bd3670916e1c9406b8cc7631bad5149e9f10d75ad0ffa7586347f","observation_id":"1b48f3d8-34cd-465a-a9d5-8758f92e4a1c","resolution":{"observed_at":"2026-08-16T10:15:03.093138Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04274","last_updated":"2025-04-05T20:07:34Z","snapshot_observed_at":"2026-08-19T14:37:43.842882Z","submitted_at":"2025-04-05T20:07:34Z","title":"Randomised Splitting Methods and Stochastic Gradient Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04274","snapshot_observed_at":"2026-08-16T10:15:02.827928Z","title":"Randomised splitting methods and stochastic gradient descent","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.827928Z"},"links":{"cited_paper":"/paper/2504.04274","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:4232249864ec1a8f66a08cce4496a6f13cab8d45d2c690652825a7e55ff1556f","observation_id":"47e9c28c-ce5e-4c84-ad0d-cb2694f26fd5","resolution":{"observed_at":"2026-08-16T10:15:02.827928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.765643Z","title":"Integration schemes for molecular dynamics and related applications","venue":null,"work_id":"b6609600-1b8d-4887-b78c-384f27cd07bf","year":1999},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.832634Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:2482ba4d071d1ac2135417b8388b8619ea4909d91f3ab32edef29c512edb27da","observation_id":"43c3f446-1540-4ea4-8709-80a854ed6f81","resolution":{"observed_at":"2026-08-16T10:15:03.770442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.751592Z","title":"An impulse integrator for Langevin dynamics","venue":null,"work_id":"8ec8b7b0-856b-4445-a384-c4b9bb6e35ea","year":2002},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.836940Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:71db9eb393aacbf58258fc58fe140d022b9ffaa67325217b804d991138afc646","observation_id":"80c37ae4-9bdf-49f0-87fc-444dc94a3ef9","resolution":{"observed_at":"2026-08-16T10:15:03.756209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00489","last_updated":"2018-02-24T00:16:12Z","snapshot_observed_at":"2026-08-14T20:17:53.425800Z","submitted_at":"2017-11-01T18:04:31Z","title":"Don't Decay the Learning Rate, Increase the Batch Size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00489","snapshot_observed_at":"2026-08-16T10:15:02.841384Z","title":"Smith, Pieter-Jan Kindermans, and Quoc V","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.841384Z"},"links":{"cited_paper":"/paper/1711.00489","citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:ba673662eea17613eede67abddb7e5d7de472625f94c5081dab4c7b096f017c8","observation_id":"92dd7fa0-90d0-4bc9-a501-d30bfa369ae0","resolution":{"observed_at":"2026-08-16T10:15:02.841384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.737381Z","title":"Variable steps for reversible integration methods","venue":null,"work_id":"2533f819-3b6e-48fb-b475-14c6f43f1e89","year":1995},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.845995Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:bfe9319093b7758d47b007b68df6f7463f2eded31f70e40ff89f76b8b9d1c778","observation_id":"7d629361-d8b4-4822-9ddd-331346e07d2c","resolution":{"observed_at":"2026-08-16T10:15:03.742014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.722877Z","title":"Mémoire sur le problème des trois corps","venue":null,"work_id":"bbe4e88f-9c38-4b81-9a33-75b1142f6763","year":1912},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.850587Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:8eb91059f46dfd6c4b6e1a75dce625946f6971571b14ffe2659ff4a679996ee2","observation_id":"9d802ba7-b7c0-4f48-afdb-c8e2a559de4d","resolution":{"observed_at":"2026-08-16T10:15:03.727455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.707831Z","title":"Adaptive weak approximation of stochastic differential equations","venue":null,"work_id":"dff91d0f-5a8b-4665-bd3e-469225d9a2ed","year":2001},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.855007Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:ac910ad3146f853b2354fcc2eb060eaf917e7fdeec8d17acddf381048ff03831","observation_id":"dd0a885b-d9c2-4f02-be61-177035c05528","resolution":{"observed_at":"2026-08-16T10:15:03.713116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.694204Z","title":"Stochastic hamiltonian systems: exponential convergence to the invariant measure, and discretization by the implicit euler scheme","venue":null,"work_id":"2a52bfa6-aa06-409d-a2e6-c2a5dffa1b03","year":2002},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.859763Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:4cb82d448916dcce5203785775f0c70cebf1514a2eb6ebb330441747f25a540b","observation_id":"dbe1d9d5-507b-4439-a070-7684c5b1e73f","resolution":{"observed_at":"2026-08-16T10:15:03.698223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:15:03.680037Z","title":"Lecture 6.5 - rmsprop, coursera: Neural networks for machine learning., 2012","venue":null,"work_id":"2839cfdb-ebe0-445f-94cc-92a9db8c9867","year":2012},"citing_paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-16T10:15:02.864259Z"},"links":{"citing_paper":"/paper/2504.18911"},"observation_digest":"sha256:6ef63e51059fd2847ff4feb4fd10cbfe6d5737b25fa2127ed0f6a8e37f86d762","observation_id":"e719f93f-fed7-42db-ab3a-b322137b5db7","resolution":{"observed_at":"2026-08-16T10:15:03.684842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.18911","last_updated":"2025-05-26T12:19:39Z","latest_version":2,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-19T22:15:09.359983Z","submitted_at":"2025-04-26T12:57:57Z","title":"A Langevin sampling algorithm inspired by the Adam optimizer"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":57,"verified_exact":4,"verified_fuzzy":39},"total_outbound_references":115},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 100 of 115 outbound references and 1 inbound Pith citation observation for arXiv:2504.18911."}