{"as_of":"2026-08-18T22:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d82ce8e048708c904b67abd7074248f7bdaffff201cba69175768e38d548e0c9","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:06:00.466723Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T09:01:49.886920Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T09:04:32.592558Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"cited_work":{"arxiv_id":"2501.11743","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.11743","snapshot_observed_at":"2026-06-30T09:04:32.592558Z","title":"Non- reversible Langevin algorithms for constrained sampling","venue":null,"work_id":"e56a9421-6a7a-42b4-a3f2-e56ea8bac657","year":null},"citing_paper":{"arxiv_id":"2503.19066","last_updated":"2026-05-20T13:26:10Z","snapshot_observed_at":"2026-08-14T15:30:04.966356Z","submitted_at":"2025-03-24T18:52:45Z","title":"Accelerating Langevin Monte Carlo Sampling: A Large Deviations Analysis","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T22:24:25.071972Z"},"links":{"cited_paper":"/paper/2501.11743","citing_paper":"/paper/2503.19066"},"observation_digest":"sha256:439f79e318817b7086f74eba473131190e69b9862f0283d8343e2c9e434ad034","observation_id":"be4e5de5-725e-48cd-ae83-0a25981983aa","resolution":{"observed_at":"2026-05-22T22:25:12.026504Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"cited_work":{"arxiv_id":"2501.11743","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.11743","snapshot_observed_at":"2026-06-30T09:04:32.592558Z","title":"Non- reversible Langevin algorithms for constrained sampling","venue":null,"work_id":"e56a9421-6a7a-42b4-a3f2-e56ea8bac657","year":null},"citing_paper":{"arxiv_id":"2606.28808","last_updated":"2026-06-27T08:25:48Z","snapshot_observed_at":"2026-08-01T09:06:50.363900Z","submitted_at":"2026-06-27T08:25:48Z","title":"Variance Reduction for Stochastic Gradient Generalized Non-reversible Langevin Monte Carlo Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T09:01:49.886920Z"},"links":{"cited_paper":"/paper/2501.11743","citing_paper":"/paper/2606.28808"},"observation_digest":"sha256:626346ffb745dcb70ed681f78e46a80d171ac6a303daddd93be6ddd2a9f58e61","observation_id":"f7b77ea8-cfb3-42b2-89cd-50bb724696d0","resolution":{"observed_at":"2026-06-30T09:04:32.594181Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.11743/citation-record","integrity":"/paper/2501.11743/integrity","json":"/paper/2501.11743/citation-record.json","paper":"/paper/2501.11743"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:06:01.028262Z","title":"Efficient constrained sampling via the mirror- L angevin algorithm","venue":null,"work_id":"2658bb7b-c155-4048-b89e-e2592b63311c","year":2021},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.314152Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:0648358f4218a06b1126c9cf8aedb99f2a129ddd28129805b7c7fc87965b83a6","observation_id":"ee1ce4f3-7ea5-48ec-aede-84d61448113a","resolution":{"observed_at":"2026-08-10T18:06:01.031656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.319028Z","title":"An introduction to MCMC for machine learning","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.319028Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:8ff975800ff1300ae4fece4291dde2d20efaf9092883ec3e6ea3f495b6e6cf0d","observation_id":"733c6259-641e-4350-9b16-02d1946af357","resolution":{"observed_at":"2026-08-10T18:06:00.319028Z","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-10T18:06:01.012243Z","title":"A simple proof of the P oincar \\'e inequality for a large class of probability measures","venue":null,"work_id":"6cc0d2d7-5685-4961-930a-8553e31b8906","year":2008},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.322672Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:e7896afd7d566b8c01f22e62a1452ea848c70b35416917bf7909f11ef97c0a5a","observation_id":"d3ed3696-d36c-4f87-af06-df2f895eeb0e","resolution":{"observed_at":"2026-08-10T18:06:01.015737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:01.002030Z","title":"Sampling from a log-concave distribution with compact support with proximal L angevin M onte C arlo","venue":null,"work_id":"b95191f7-082a-4d08-ae67-e1f5d249a183","year":2017},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.326818Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:1f59ce6be49cbfae025583e309c2f5c26bb04db5c308ba5bc4e5766265aad9c5","observation_id":"a969fcc6-8066-48c2-969d-5669c1b35686","resolution":{"observed_at":"2026-08-10T18:06:01.005696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.990910Z","title":"Finite-time analysis of projected L angevin M onte C arlo","venue":null,"work_id":"9455b166-00ac-4dbe-bdb1-7811b56654dc","year":2015},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.330612Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:7cbeea9f6741986eff975abd5b5951ec37f51aa95745bb093ca278478d88822c","observation_id":"61b5a890-b692-4570-9533-6056b8ebe96f","resolution":{"observed_at":"2026-08-10T18:06:00.994749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.979797Z","title":"Sampling from a log-concave distribution with projected L angevin M onte C arlo","venue":null,"work_id":"09f5958a-6c89-434a-b648-147645a958c3","year":2018},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.334182Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:2b4a710be7508cdd2e0cc5188d465eef8ccbe82c1dcfc0fc92dff3c89766995d","observation_id":"3a6b3eb2-2a2c-4ac1-81b1-f2a5af157acb","resolution":{"observed_at":"2026-08-10T18:06:00.983715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.968897Z","title":"Analysis and Geometry of Markov Diffusion Operators , volume 103","venue":null,"work_id":"6e6f4db0-673f-47db-b7f2-8fd3e00e1223","year":2014},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.337898Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:47752a271c28a6cb9e849a899715564df958ea27dfbdc40700d69782843e05e6","observation_id":"1a6e47eb-9d67-4bc6-9701-fca4fa8a3b50","resolution":{"observed_at":"2026-08-10T18:06:00.972854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.958504Z","title":"A symmetrized E uler scheme for an efficient approximation of reflected diffusions","venue":null,"work_id":"14e17a9a-de95-458c-9202-5c7f4dae536f","year":2004},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.341275Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:130eb38347f32914836ff8b304c6ae02498e27e13400a4e9885440d0f3c5710f","observation_id":"64f7f9cd-8963-4744-a81b-3e39a2f5f113","resolution":{"observed_at":"2026-08-10T18:06:00.962226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.947096Z","title":"A note on T alagrand’s transportation inequality and logarithmic S obolev inequality","venue":null,"work_id":"8eef54a0-012b-4202-80cc-a7189dd5aad1","year":2010},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.344816Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:c931df2457f38a5170b74279ff232649f284aa1dfca8069e57303ca688a4e80f","observation_id":"85dc1903-3cfb-4431-bb0a-fdebbdf95fde","resolution":{"observed_at":"2026-08-10T18:06:00.951164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.935783Z","title":"Exponential ergodicity of mirror- L angevin diffusions","venue":null,"work_id":"dc184025-4443-4282-9ea7-beba6a0e3277","year":2020},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.348482Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:4a70e6b6ca89fa6685e3d07d70766ac612ee8d58908bd68b4bf3d2981e0f7c1c","observation_id":"9792065d-e46e-4f5d-b941-231f7e088e52","resolution":{"observed_at":"2026-08-10T18:06:00.939544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.924856Z","title":"The S korohod oblique reflection problem in domains with corners and application to stochastic differential equations","venue":null,"work_id":"d862ed84-8f2c-43d3-86ca-4a780375d70d","year":1992},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.352058Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:0044be868b2da28b9f4ba854e322be45c08e9b88c0dcafb23b636a1e35bfa56e","observation_id":"bd03eb52-7cec-42d0-a531-5c106dc0c681","resolution":{"observed_at":"2026-08-10T18:06:00.928965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.913848Z","title":"SDE s with oblique reflection on nonsmooth domains","venue":null,"work_id":"60883010-7874-479b-b944-9da2c664782d","year":1993},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.356031Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:1658a24ea520a615f28af17da90a0ff53ff5a89c2dd2a4877395e3581403500d","observation_id":"ba4d4bc9-6571-4ef6-964a-0c2b6d64d7ac","resolution":{"observed_at":"2026-08-10T18:06:00.917730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.902806Z","title":"Duncan, Tony Leli\\` e vre, and Grigoris A","venue":null,"work_id":"8ab4a561-00b0-4a7b-804f-8c093d6fe8dd","year":2016},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.359351Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:bb06719da962d998a094e0b070dd3e2071eafd9259c9f7fed7d36611d81c2658","observation_id":"3f4ded61-8b77-49e9-82a3-bdb876ec426c","resolution":{"observed_at":"2026-08-10T18:06:00.906563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.04247","last_updated":"2017-01-16T11:28:50Z","snapshot_observed_at":"2026-08-15T05:05:08.405762Z","submitted_at":"2017-01-16T11:28:50Z","title":"Nonreversible Langevin Samplers: Splitting Schemes, Analysis and Implementation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.04247","snapshot_observed_at":"2026-08-10T18:06:00.362994Z","title":"Duncan, Grigoris A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.362994Z"},"links":{"cited_paper":"/paper/1701.04247","citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:7aede83ef543b0b9cb2de079c9040ae97569216613b4dfa1e4f759b13c6fbc17","observation_id":"070625b9-55dd-4c86-9420-35a29fb96168","resolution":{"observed_at":"2026-08-10T18:06:00.362994Z","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-10T18:06:00.892087Z","title":"Accelerating the diffusion-based ensemble sampling by non-reversible dynamics","venue":null,"work_id":"de7a5556-bd8d-4b22-b086-ff8b9a1bc75c","year":2020},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.366949Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:d5da3870eeaf3124396eb7f96566bb731d41c55d3d21f96a9a40e42a22686f54","observation_id":"0d1ec060-b0e1-4ed4-86fb-141da4392b5d","resolution":{"observed_at":"2026-08-10T18:06:00.895488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.370482Z","title":"Bayesian Data Analysis","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.370482Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:7201dcdf72750e1fe4bf157dd03dcc975d396268fcb206b1400f02674421a94a","observation_id":"3d14bbd2-a886-40c8-96bb-ce25fc70a12e","resolution":{"observed_at":"2026-08-10T18:06:00.370482Z","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-10T18:06:00.875984Z","title":"Decentralized stochastic gradient L angevin dynamics and H amiltonian M onte C arlo","venue":null,"work_id":"5a2301ba-5f41-4013-9829-50d760f32253","year":2021},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.373680Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:64139cf6424e62f32efdd737f2c841f2f5995ff320066f56718f148f241ec004","observation_id":"8782bde9-4032-4f79-8d41-d3c7a80b5c66","resolution":{"observed_at":"2026-08-10T18:06:00.879210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.865895Z","title":"Breaking reversibility accelerates L angevin dynamics for global non-convex optimization","venue":null,"work_id":"a0e71fe2-9d1f-4d68-868e-a150f43d247e","year":2020},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.377000Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:ed1df7b9cbb0b03853c745f8638c474616ecb5f2d7262307286a8f0dbe760dd6","observation_id":"864ed354-2872-4cdf-a4bb-ee83cb3c2d88","resolution":{"observed_at":"2026-08-10T18:06:00.869257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.855887Z","title":"Penalized overdamped and underdamped L angevin M onte C arlo algorithms for constrained sampling","venue":null,"work_id":"8220be71-5e41-4ad7-8a61-8e65d0a1d300","year":2024},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.380243Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:b184a7496f23d40e8c9c425700c74a1c94c0889003863aacc2e4454980b65b8b","observation_id":"750ad0d4-71a9-4c8d-a1fa-03423b72b162","resolution":{"observed_at":"2026-08-10T18:06:00.859431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.383854Z","title":"Generalized EXTRA stochastic gradient L angevin dynamics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.383854Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:14947199c3cf234c8255446a28944752cd8a77d32ed33d9e98ca7438d0d74874","observation_id":"5207e77f-9771-4678-a04e-3b35591bc24e","resolution":{"observed_at":"2026-08-10T18:06:00.383854Z","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-10T18:06:00.845246Z","title":"Gibbs and Francis Edward Su","venue":null,"work_id":"e0c24415-a147-4eab-9abf-499201a69eec","year":2002},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.387515Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:ba9680084970a03ec5cda8d985ae4d1b64d413fb0256bbc9ecf34d8153887249","observation_id":"79225882-42e3-4bce-89e5-8df44332a129","resolution":{"observed_at":"2026-08-10T18:06:00.849222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.834854Z","title":"Accelerating G aussian diffusions","venue":null,"work_id":"c8ae00a4-0de8-47cc-ae63-a28668571918","year":1993},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.390994Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:2b362db1dfb6b267e2dd414795c4ffedf85f744e490632d3e78a695564a9014f","observation_id":"f3cc1289-7d48-4f3f-9e95-74c384ae9eec","resolution":{"observed_at":"2026-08-10T18:06:00.838524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.823917Z","title":"Accelerating diffusions","venue":null,"work_id":"cd06dc40-3a66-4210-8274-1a2d131c5f67","year":2005},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.394464Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:4eba8f74ec5b18f572c67f53261af0e6e1f14e09975ab60855e2e54dfce93139","observation_id":"095e25c8-fea3-40b2-8612-ed6ec15bfc3b","resolution":{"observed_at":"2026-08-10T18:06:00.827551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.812970Z","title":"Mirrored L angevin dynamics","venue":null,"work_id":"6a5f4416-3ac8-4295-857f-ed5bba7c8f12","year":2018},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.397783Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:c4b8bd28c9fd2bcd6ffcb42ebc9dd996fbc108fd307ea94c2f11013be6c2e58b","observation_id":"e08a9310-2099-4ea0-bf5e-c20ba44a438b","resolution":{"observed_at":"2026-08-10T18:06:00.816624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.02823","last_updated":"2020-06-02T20:49:37Z","snapshot_observed_at":"2026-08-13T23:04:59.744844Z","submitted_at":"2020-04-06T17:11:03Z","title":"Non-Convex Optimization via Non-Reversible Stochastic Gradient Langevin Dynamics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.02823","snapshot_observed_at":"2026-08-10T18:06:00.401114Z","title":"Non-convex stochastic optimization via non-reversible stochastic gradient L angevin dynamics","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.401114Z"},"links":{"cited_paper":"/paper/2004.02823","citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:e5e4099085701a56be5be66d89eb861cb46e4842dbe13f158e1bc324a7df4945","observation_id":"4b9b8c99-3313-41d4-a705-c3b425c0891a","resolution":{"observed_at":"2026-08-10T18:06:00.401114Z","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-10T18:06:00.802529Z","title":"Projected stochastic gradient L angevin algorithms for constrained sampling and non-convex learning","venue":null,"work_id":"c3361917-c68d-4a6c-b752-940c166ec145","year":2021},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.404827Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:cc2c4f57c53efb79942a76ed96e72fda46a56044705ff4203e1cc36924018fee","observation_id":"22c631d6-f974-4d67-9e40-13fca34d7e97","resolution":{"observed_at":"2026-08-10T18:06:00.806152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.792122Z","title":"On the H \\\"o lder gradient estimate for solutions of nonlinear elliptic and parabolic oblique boundary value problems","venue":null,"work_id":"e0ce398c-3672-4393-bc90-ee1fb52bcaf3","year":1990},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.408318Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:ddba862a589828186953241f9d74dd8dbfbe0f54ec5804df2cf54d07a5a489e0","observation_id":"df6ec576-4656-4413-a7d2-ead29efb072d","resolution":{"observed_at":"2026-08-10T18:06:00.795915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.781563Z","title":"Optimal non-reversible linear drift for the convergence to equilibrium of a diffusion","venue":null,"work_id":"1fa2f806-d6f8-4243-89f7-f0e083d8c64a","year":2013},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.411730Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:4b330d8206b304ab4019149ea5a1df12f70c6893106349b48d67ff998780c0dc","observation_id":"1b282d87-c3a0-4c8c-922b-287ba6cc4206","resolution":{"observed_at":"2026-08-10T18:06:00.785327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.771276Z","title":"Stochastic differential equations with reflecting boundary conditions","venue":null,"work_id":"53ac14de-c227-42e6-a17d-fa00cbec72cd","year":1984},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.415079Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:01555b5c8c90aca3048c76e42ba6a1114be11fb3723efd369f9cdfbdda83e377","observation_id":"94b1395a-47b0-4cb4-86c8-999902dc6dee","resolution":{"observed_at":"2026-08-10T18:06:00.774989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.760843Z","title":"Vempala, and Andre Wibisono","venue":null,"work_id":"98dc4589-952e-4043-a4fb-4216a6c8e5d0","year":2022},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.418246Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:1d0330f35b5cae4edfb4ba8f50f338ac209e72a2f710d7b3935ea8d52c96c659","observation_id":"ae7b75c7-367c-471f-b770-4d764ed2629b","resolution":{"observed_at":"2026-08-10T18:06:00.764564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.749588Z","title":"Irreversible L angevin samplers and variance reduction: a large deviation approach","venue":null,"work_id":"e5438d00-f743-4677-ae32-bcf380a68d9f","year":2015},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.421260Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:0117b1044c1b619ff814d84915969c4124d2a6dd86e58e88a265903afe585917","observation_id":"4decede0-32e2-4a64-bd19-ae50b2ade637","resolution":{"observed_at":"2026-08-10T18:06:00.753712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.738082Z","title":"Variance reduction for irreversible L angevin samplers and diffusion on graphs","venue":null,"work_id":"f209cb6b-0896-4885-9d42-c0e9aea210d7","year":2015},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.424448Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:c4b5df26015f1155d11017f67dc8146958b890645a81ebec1521c79055fd72ac","observation_id":"7fa3adc6-cf9d-4b52-967e-1870287eeae3","resolution":{"observed_at":"2026-08-10T18:06:00.741746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.727051Z","title":"Improving the convergence of reversible samplers","venue":null,"work_id":"2a231615-8a03-42f7-83c1-f52df7fe86bf","year":2016},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.427290Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:05121da5389122b67d70509d60d119d572d6ec427e04016834299c672652ab5c","observation_id":"a9488f52-384c-45e3-a891-b85a72154f49","resolution":{"observed_at":"2026-08-10T18:06:00.730821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.717200Z","title":"Weak P oincar\\' e inequalities and L^ 2 -convergence rates of M arkov semigroups","venue":null,"work_id":"1c7f08b8-73df-460f-bdf6-7ed4c57ee35b","year":2001},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.430364Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:9c7b9888e2c0bdc05900c40ddc36969e063e5911d6401416783424395e2b236a","observation_id":"289b709d-1efc-4a70-8314-02d0678a9d3d","resolution":{"observed_at":"2026-08-10T18:06:00.720622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.706310Z","title":"Primal dual interpretation of the proximal stochastic gradient L angevin algorithm","venue":null,"work_id":"36282d61-87a9-478e-80e8-ec0a3945f32a","year":2020},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.433426Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:32bfbe51829a24110bac1a53d23272a43ad0a229cee29cc365e3184a6f7a06f1","observation_id":"f1080c04-022a-49bd-a69a-bf7ec2fc7ffb","resolution":{"observed_at":"2026-08-10T18:06:00.710430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.695412Z","title":"( N onsymmetric) D irichlet operators on L ^1 : existence, uniqueness and associated M arkov processes","venue":null,"work_id":"97d484ee-822e-4b6e-9444-ad2ccf9449a7","year":1999},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.436545Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:bae6f2236f4ed45c0791735f3c45454a1bd8a18f0ced5541cb5d0cd0952e641c","observation_id":"ebe69948-cc49-4d2a-9903-055c6532b88e","resolution":{"observed_at":"2026-08-10T18:06:00.699324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.439574Z","title":"Inverse problems: A B ayesian perspective","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.439574Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:41c56264e593b07e030f624aeaf7286f27447b10a143115fa9360921231013ab","observation_id":"167ed521-d7cd-4a44-9484-36e34654c426","resolution":{"observed_at":"2026-08-10T18:06:00.439574Z","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-10T18:06:00.678576Z","title":"Stochastic differential equations with reflecting boundary condition in convex regions","venue":null,"work_id":"1b1c1be8-32fe-49ab-962f-9b6d82003684","year":1979},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.442507Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:57bd39b8424749f5905d1b6d731ba58c73ca7d57df60a896bf0411ad15ca3de3","observation_id":"b61d0791-431e-47ad-a3f7-c600c840e006","resolution":{"observed_at":"2026-08-10T18:06:00.682256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.667935Z","title":"Operator reverse monotonicity of the inverse","venue":null,"work_id":"13f832a4-85f1-45db-bdc1-ed44cf714907","year":2011},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.445844Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:a3d91efa3132cbd41492a5fbece75a0c18c27b16bd15034a86049ee7057c32ba","observation_id":"c412f636-3c3a-490e-a950-f8607179b77e","resolution":{"observed_at":"2026-08-10T18:06:00.671608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.656050Z","title":"Consistency and fluctuations for stochastic gradient L angevin dynamics","venue":null,"work_id":"c70f7de1-de50-4942-9f7e-5128f9148af8","year":2016},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.448912Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:0df1844a043db0c95e5807fd4d94afa5b1be14c345654439638488058b101f10","observation_id":"c6d7b378-9d0d-4a7d-82c7-57ad7ca7b4fa","resolution":{"observed_at":"2026-08-10T18:06:00.660342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.643396Z","title":"On estimation of the logarithmic S obolev constant and gradient estimates of heat semigroups","venue":null,"work_id":"2f4087da-a32b-48b2-a287-f35888c93576","year":1997},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.452503Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:acf8cd8959468cd9988778a4b5fa553de63f5636fff89e179544b02a0cd07a29","observation_id":"57fdad62-523d-4093-87ad-9874efbd79f5","resolution":{"observed_at":"2026-08-10T18:06:00.647710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.631658Z","title":null,"venue":null,"work_id":"928caa66-acd1-40bc-b63e-73c0f1513241","year":2014},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.455934Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:10fc5b5ea1d3b90e94d234948e0a3915e10f25407113e41b0ea1a368e46fa960","observation_id":"b4ca503c-5b8a-4d83-8e51-6efdd2d8984f","resolution":{"observed_at":"2026-08-10T18:06:00.635350Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.619187Z","title":"Constrained exploration via reflected replica exchange stochastic gradient L angevin dynamics","venue":null,"work_id":"c94e4f70-8265-48a3-9cf4-9b5eee399c00","year":2024},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.459233Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:dd0ca37684f6dd673bc30b1d4ac1384210b95c33a18a13cc2b550259c332ab66","observation_id":"8e6a622b-ac7b-413c-a775-387da526e4a0","resolution":{"observed_at":"2026-08-10T18:06:00.623521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.606529Z","title":"Constrained L angevin algorithms with L -mixing external random variables","venue":null,"work_id":"1d03730e-1980-44a7-a270-f6c120b8a768","year":2022},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.463032Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:8697e36edc48640b743e1b959e0e7d821990cb86834670995ddb44ad01f26269","observation_id":"61e1974f-eef4-4310-8c2c-be7188c63a69","resolution":{"observed_at":"2026-08-10T18:06:00.610715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T18:06:00.592593Z","title":"Wasserstein control of mirror L angevin M onte C arlo","venue":null,"work_id":"0efce289-7f6c-41a6-90a5-e7eaad33bc0b","year":2020},"citing_paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T18:06:00.466723Z"},"links":{"citing_paper":"/paper/2501.11743"},"observation_digest":"sha256:306a4b14133c464dc1eced9874db65ada8baca6d2c5c3666441a07535fc8852b","observation_id":"386d3aaa-cb35-48f7-b0be-42893101af34","resolution":{"observed_at":"2026-08-10T18:06:00.598495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.11743","last_updated":"2025-04-15T02:04:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T03:01:26.706031Z","submitted_at":"2025-01-20T21:04:29Z","title":"Non-Reversible Langevin Algorithms for Constrained Sampling"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":38},"total_outbound_references":45},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 2 inbound Pith citation observations for arXiv:2501.11743."}