Pith. sign in

Paper Citation Record · LEDGER

On the query complexity of sampling from non-log-concave distributions

As of 9 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 2 inbound Pith citation observations for arXiv:2502.06200.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.06200 v3

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T16:31:00.171252Z

measured 40 of 40 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-30T12:30:53.400656Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T11:16:03.235051Z

Reference resolution

38 of 38 outbound references displayed

  • verified exact1
  • verified fuzzy33
  • unresolved4
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9c001a58-0b54-4949-ae5b-f4e70e279f7f · outbound

This paper cites Faster high-accuracy log-concave sampling via algorithmic warm starts.

On the query complexity of sampling from non-log-concave distributions Faster high-accuracy log-concave sampling via algorithmic warm starts

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.651959Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:30:59.982502Z digest=sha256:88ceeefbbd545f5883bed2ec1bf0f97c47475ddbc35f6b6f11092c4542775ab1

Observation 2961944f-352b-49b0-b8e1-8cae0d43b1f9 · outbound

This paper cites An introduction to MCMC for machine learning.

On the query complexity of sampling from non-log-concave distributions An introduction to MCMC for machine learning

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.641681Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:30:59.987610Z digest=sha256:ac989976d3bcb5a3e8bf8f1dcb72e1a6b00dd3a96ab3224cdc0529eccc91765d

Observation 9ba5e1d3-9b28-4682-b927-ca38e1dda26f · outbound

This paper cites Nearly d-linear convergence bounds for diffusion models via stochastic localization.

On the query complexity of sampling from non-log-concave distributions Nearly d-linear convergence bounds for diffusion models via stochastic localization

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.630264Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:30:59.992614Z digest=sha256:e1d96ff540df0eb21bb647ffca70c914ce6f4a8e9deb7f1126a2ffa18c04d0f4

Observation ed16ab5d-3924-4537-b575-99cf4efc430c · outbound

This paper cites Towards a theory of non-log-concave sampling:first-order stationarity guarantees for Langevin Monte Carlo.

On the query complexity of sampling from non-log-concave distributions Towards a theory of non-log-concave sampling:first-order stationarity guarantees for Langevin Monte Carlo

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.615326Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:30:59.997199Z digest=sha256:66c3da1250f0a7007a45c4c06714615e89482d8268d6fa970407555e7825dd2f

Observation 25b36be9-fe92-491d-80eb-d2dee3ac9f9e · outbound

This paper cites On extensions of the Brunn-Minkowski and Prékopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation.

On the query complexity of sampling from non-log-concave distributions On extensions of the Brunn-Minkowski and Prékopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.604702Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.002069Z digest=sha256:3baebc73d816e4be0548b28f5eaf29d6ab706148b053c2eff8c46b7eb21eb9dc

Observation 0347a2ad-9cb3-415f-bb13-5dd88bdffc42 · outbound

This paper cites Convergence of Langevin MCMC in KL-divergence.

On the query complexity of sampling from non-log-concave distributions Convergence of Langevin MCMC in KL-divergence

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.594171Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.006907Z digest=sha256:0e05fc8a1c03afac5a74f111388b77b0f5be99232fd772ac959c0f264848e4da

Observation e5e9efd9-60e1-4738-bf26-9eb6dd4d55e0 · outbound

This paper cites Chatterji, Peter L.

On the query complexity of sampling from non-log-concave distributions Chatterji, Peter L

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.583131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.013849Z digest=sha256:b58150b242526e7b15af1d2db1278bc54cd4ed8f00e4550bf11aa1320091b8b9

Observation 0e80bf46-c2dd-4340-b358-215660e20763 · outbound

This paper cites The probability flow ODE is provably fast.

On the query complexity of sampling from non-log-concave distributions The probability flow ODE is provably fast

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.571601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.019954Z digest=sha256:77fe03c93738382362538ca5446cd3da840e55a950754477a29a7cab40904cf4

Observation e8113617-f6a6-4d66-ad21-a2b347f447ba · outbound

This paper cites Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions.

On the query complexity of sampling from non-log-concave distributions Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.560807Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.025421Z digest=sha256:20935119dfe4d4839f7725565e7e1e0f93e5829d85a998b761923072ad0b6041

Observation 9be334e9-9092-4ac2-bb78-d441b310713e · outbound

This paper cites Analysis of Langevin Monte Carlo from Poincar \'e to log-Sobolev.

On the query complexity of sampling from non-log-concave distributions Analysis of Langevin Monte Carlo from Poincar \'e to log-Sobolev

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.548213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.035352Z digest=sha256:827b96789bc8afa6b95154a13f9dc05ef757ec02ee327aed273556fcfbff21a5

Observation ca829c05-ef81-47d2-a01d-98b5b8a5d1a2 · outbound

This paper cites On theoretical guarantees and a blessing of dimensionality for nonconvex sampling.

On the query complexity of sampling from non-log-concave distributions On theoretical guarantees and a blessing of dimensionality for nonconvex sampling

Reference 11

Resolution
verified exact
local_arxiv, observed 2026-08-08T16:31:00.277231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.041323Z digest=sha256:460640168a4982afd8b03e82df9a825ffe2b0ab3ae6c381adff093a4fe6c28d4

Observation ac6fae17-459e-4326-a0cf-00ed2403e25e · outbound

This paper cites Log-concave Sampling.

On the query complexity of sampling from non-log-concave distributions Log-concave Sampling

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.537805Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.053801Z digest=sha256:b44aace74ae5abc0aec3a7f804200cacfd92dee4cd79b5392c8278fc9ad00c26

Observation c9efbd34-4fed-4710-8fb2-9bb9878a7fe6 · outbound

This paper cites Optimal dimension dependence of the Metropolis-adjusted Langevin algorithm.

On the query complexity of sampling from non-log-concave distributions Optimal dimension dependence of the Metropolis-adjusted Langevin algorithm

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.526595Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.059382Z digest=sha256:f1f59947216f199e0c786d71ae390d2404c6735f0dbbb03e3d8350a558cce889

Observation b59898e2-6ccf-45d1-8e26-6a1cb77b72ea · outbound

This paper cites Improved analysis of score-based generative modeling: User-friendly bounds under minimal smoothness assumptions.

On the query complexity of sampling from non-log-concave distributions Improved analysis of score-based generative modeling: User-friendly bounds under minimal smoothness assumptions

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.513234Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.066277Z digest=sha256:63a121de1538b4c5e7cff53a8bbffbb6b606094fe1e7e3208aeabddb046001bb

Observation 765a7124-0858-4cbe-9ac6-db03debec5d7 · outbound

This paper cites Simulation and Monte Carlo : With applications in finance and MCMC.

On the query complexity of sampling from non-log-concave distributions Simulation and Monte Carlo : With applications in finance and MCMC

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.498161Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.071096Z digest=sha256:1b71b64d7f97263196e84f05f734edf025c643c1577b713143c811e79a3dbefe

Observation 0cb617ca-fe7a-40a4-adfe-f8859cd0c543 · outbound

This paper cites Log-concave sampling: Metropolis-Hastings algorithms are fast.

On the query complexity of sampling from non-log-concave distributions Log-concave sampling: Metropolis-Hastings algorithms are fast

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.487592Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.074338Z digest=sha256:84150025172d64740904642bb18037c157e463f7adaeb7ba21543db9ea147017

Observation ecc2382f-1edb-4d78-bcc2-9251c8053e9e · outbound

This paper cites On sampling from Ising models with spectral constraints.

On the query complexity of sampling from non-log-concave distributions On sampling from Ising models with spectral constraints

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.477081Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.078273Z digest=sha256:41b18e4add1b37cddcb7880a0c82f0e6c647611fc795ea5fb30fd2cae12673b7

Observation d480154c-89af-4370-ba85-5a13d4b2edea · outbound

This paper cites Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling.

On the query complexity of sampling from non-log-concave distributions Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-08T16:31:00.082076Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T16:31:00.082076Z digest=sha256:26372e6bb63434a9bf37efbfd600f7a813244bbd452c912ac2dcf84c8ef63506

Observation 2ec0331f-ff3c-43dd-8846-c6ae4e9e11d2 · outbound

This paper cites Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation.

On the query complexity of sampling from non-log-concave distributions Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-08T16:31:00.085779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T16:31:00.085779Z digest=sha256:789887911db69086be1dd284ee9e759f4da22245000cd8f9189d61cc67449226

Observation 3fd34f8c-e0f6-4f47-970d-a39e7a5c30b3 · outbound

This paper cites A separation in heavy-tailed sampling: Gaussian vs.

On the query complexity of sampling from non-log-concave distributions A separation in heavy-tailed sampling: Gaussian vs

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.468331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.090669Z digest=sha256:c8083b6314c6826420d15b802416b68722c5ac080c4dbe46d490552b1d646542

Observation 76adaa45-f03a-49af-b956-9f88c7b8dc24 · outbound

This paper cites Weak Poincar\'e Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses.

On the query complexity of sampling from non-log-concave distributions Weak Poincar\'e Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-08T16:31:00.094068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T16:31:00.094068Z digest=sha256:40963d2c1673259b61ad9f7d7ce406db4abbaa856ec9c3b309c2bf6894c2635a

Observation d1bcc525-2f9b-48ae-9d5e-e5762aae540a · outbound

This paper cites Zeroth-order sampling methods for non-log-concave distributions: Alleviating metastability by denoising diffusion.

On the query complexity of sampling from non-log-concave distributions Zeroth-order sampling methods for non-log-concave distributions: Alleviating metastability by denoising diffusion

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.458225Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.098402Z digest=sha256:a73b2cd6382ffa0b67ea1bb3e5938b3c6e3e4d8d65e805ba91fefd7bb28f6a09

Observation a8cfb972-2cbf-490e-86e6-c8b534eb8373 · outbound

This paper cites Faster sampling without isoperimetry via diffusion-based Monte Carlo.

On the query complexity of sampling from non-log-concave distributions Faster sampling without isoperimetry via diffusion-based Monte Carlo

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.448910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.102387Z digest=sha256:9ac6b4a296671808eff4eb83be237f9e00020612cb3ac2a60c4c517ea6c83fa8

Observation d9085ed3-6883-4ef3-a299-2f81f350f17b · outbound

This paper cites Sampling approximately low-rank Ising models: MCMC meets variational methods.

On the query complexity of sampling from non-log-concave distributions Sampling approximately low-rank Ising models: MCMC meets variational methods

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.439362Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.107105Z digest=sha256:69993191149879c2bb295c854efe46904b72e88ab7175ee8762709a1d6045189

Observation 5cb68c46-51dd-48b9-b0eb-7f9c3fac4329 · outbound

This paper cites Statistical mechanics: algorithms and computations , volume 13.

On the query complexity of sampling from non-log-concave distributions Statistical mechanics: algorithms and computations , volume 13

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.429266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.112176Z digest=sha256:f6b934fc8463d9ba974c5708011da547b5270ee1006f3ad314a9afd42aeccb7d

Observation 1526721d-2721-4b5c-8f37-cbce81c96429 · outbound

This paper cites A guide to Monte Carlo simulations in statistical physics.

On the query complexity of sampling from non-log-concave distributions A guide to Monte Carlo simulations in statistical physics

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.417438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.116609Z digest=sha256:d8100afe5de74d82b997bc38cdb5c31b7cac3830b8637a01d5dbf00fdffbff38

Observation 7c6b3965-b468-46e8-b617-3507cca333f6 · outbound

This paper cites Concise formulas for the area and volume of a hyperspherical cap.

On the query complexity of sampling from non-log-concave distributions Concise formulas for the area and volume of a hyperspherical cap

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.406006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.121103Z digest=sha256:3278396de07c3c1ca701245c3c57374e0b6cc1c49cdaca0c858126b12de99da6

Observation eb7f09c2-6421-44fe-b4ba-4d832ed100ce · outbound

This paper cites Convergence of score-based generative modeling for general data distributions.

On the query complexity of sampling from non-log-concave distributions Convergence of score-based generative modeling for general data distributions

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.395305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.125704Z digest=sha256:8e9d42b7451de43506563ad361499678531fc6ba46cfc78f3a50c7b01396a113

Observation cd03e1b3-1d19-4edc-922b-69107111e2f2 · outbound

This paper cites Universal approximation using well-conditioned normalizing flows.

On the query complexity of sampling from non-log-concave distributions Universal approximation using well-conditioned normalizing flows

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.384081Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.130381Z digest=sha256:077f823c48034b0a6ddb4dad0ca2f501a97de318b6d5af8971983559a4cffc1a

Observation ca7f4fa0-d7ce-44dd-a6f7-9d72995da74c · outbound

This paper cites Contraction and convergence rates for discretized kinetic Langevin dynamics.

On the query complexity of sampling from non-log-concave distributions Contraction and convergence rates for discretized kinetic Langevin dynamics

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.371973Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.135034Z digest=sha256:8a74900bf3f8e2c8e723236e7d58ce27fa50bb6d802e476dc281d771cea376dd

Observation cb97a0a0-673f-4cf8-9e9d-6b7aa4b5510a · outbound

This paper cites Beyond log-concavity: Provable guarantees for sampling multi-modal distributions using simulated tempering Langevin Monte Carlo.

On the query complexity of sampling from non-log-concave distributions Beyond log-concavity: Provable guarantees for sampling multi-modal distributions using simulated tempering Langevin Monte Carlo

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.361152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.138797Z digest=sha256:5b858a05fda4da4b860d528843c415e7b2118148a6e6791c1a8bf89e69e9cef8

Observation 961fbe79-ea14-4fd8-ba4c-cdbf87c948b8 · outbound

This paper cites Sampling can be faster than optimization.

On the query complexity of sampling from non-log-concave distributions Sampling can be faster than optimization

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.351192Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.143636Z digest=sha256:e05774e5c5efa936851cfec6f6282d2fb84fe4de8d90066ba4ddd258e758fac2

Observation 24cffbfe-fa0e-441f-a00c-13bbe7276015 · outbound

This paper cites Towards a complete analysis of Langevin Monte Carlo : Beyond Poincar \'e inequality.

On the query complexity of sampling from non-log-concave distributions Towards a complete analysis of Langevin Monte Carlo : Beyond Poincar \'e inequality

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.336557Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.147500Z digest=sha256:3b29e4d3068862cac83e19c4b76266533a6945ebdffd48ca596b830fdbc51a5a

Observation 0dd09a11-69fe-470e-96bc-c7b1b5633f96 · outbound

This paper cites Exponential convergence of Langevin distributions and their discrete approximations.

On the query complexity of sampling from non-log-concave distributions Exponential convergence of Langevin distributions and their discrete approximations

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.324654Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.152273Z digest=sha256:0ca0b6660d66af458dc476f21eb76a160f89a9c17ca0d09550006a6b529dbbaf

Observation 2b5a4a62-4659-423a-97fb-b97732b33ae1 · outbound

This paper cites The randomized midpoint method for log-concave sampling.

On the query complexity of sampling from non-log-concave distributions The randomized midpoint method for log-concave sampling

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.312555Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.157332Z digest=sha256:cadbbfc76ec224b3bc7be25d2cb64cbaffa19334e6d11b5931d0b12bfa991566

Observation 8d82ce4c-c6c2-4b8c-be2e-250a39b001a7 · outbound

This paper cites Rapid convergence of the unadjusted Langevin algorithm: Isoperimetry suffices.

On the query complexity of sampling from non-log-concave distributions Rapid convergence of the unadjusted Langevin algorithm: Isoperimetry suffices

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.300574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.161847Z digest=sha256:0918a9dff0624136046c7384a089f26210af73afc44226b7598f80851bcd43c4

Observation 132f6fe9-86e2-488a-97b9-cb07c7e62d77 · outbound

This paper cites Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry.

On the query complexity of sampling from non-log-concave distributions Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-08T16:31:00.166278Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T16:31:00.166278Z digest=sha256:8f7dadebaa94e5ea51463654d26c1b4e70e6417292c15d1863652046eaa137fa

Observation 276fad87-7d66-47c2-a7ef-2174e5252bcd · outbound

This paper cites Improved discretization analysis for underdamped Langevin Monte Carlo.

On the query complexity of sampling from non-log-concave distributions Improved discretization analysis for underdamped Langevin Monte Carlo

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T16:31:00.289359Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T16:31:00.171252Z digest=sha256:1e3cca4fe19da01c365a3d03f605787add6114301711524cc1814d081bb44d2d

Pith citing papers

Observation ebb8ed3b-a941-4fc0-8283-d8c74157268e · inbound

Query Lower Bounds for Diffusion Sampling cites this paper.

Query Lower Bounds for Diffusion Sampling On the query complexity of sampling from non-log-concave distributions

Reference 10

Resolution
verified exact
arxiv_id, observed 2026-05-11T11:16:03.245743Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-05-10T15:04:29.421000Z digest=sha256:72c559cd35a5bcb2021dd1ae80434ac94af9288e8abdc6fc5710b848cd1b3c9a

Observation a800f7a2-45d5-4a63-a277-c0cd9828c65e · inbound

The Universal Warmup Path: Automatic Preconditioner Selection for HMC cites this paper.

The Universal Warmup Path: Automatic Preconditioner Selection for HMC On the query complexity of sampling from non-log-concave distributions

Reference 37

Resolution
unresolved
no resolver link, observed 2026-07-30T12:30:53.400656Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T12:30:53.400656Z digest=sha256:a122114d9f70dab55c9f0ec3a76b304cc40e3e1b16700dfd1513c78615dae51d