Pith. sign in

Paper Citation Record · LEDGER

Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2210.08448.

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

pith.paper-citation-record.v1
2210.08448 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T10:22:55.716618Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-03T13:58:21.820647Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 0dd6cc6b-d3a8-4066-8e90-9925e605a708 · inbound

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

Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-05-24T09:54:18.375666Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-24T09:50:07.343966Z digest=sha256:d36d65bff057cdaca34aa91039d304543fd563bf62c142caa26ee58581126227

Observation 72d54a83-3e71-4d69-98dd-924717de9cbd · inbound

Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data cites this paper.

Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling

Reference 231

Resolution
metadata mismatch
arxiv_id, observed 2026-05-13T05:57:22.445591Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-05-13T05:56:38.042978Z digest=sha256:f981f2ad571109de5f861aa1eb0dd850148c5a30bf3d6ceb06671d40ad0e0baf

Observation 16712c30-9853-4937-be31-66462eef0374 · inbound

A proximal gradient algorithm for composite log-concave sampling cites this paper.

A proximal gradient algorithm for composite log-concave sampling Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling

Reference 27

Resolution
metadata mismatch
arxiv_id, observed 2026-05-13T02:57:09.357151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-05-13T02:52:53.741989Z digest=sha256:af47647f76e0fb2f3dc6b82ae1f23808ca476f130826da77a1fbacae25701ebb

Observation 8c9e079a-068f-4c74-80c4-9361c925a0db · inbound

Learning with Simulators: No Regret in a Computationally Bounded World cites this paper.

Learning with Simulators: No Regret in a Computationally Bounded World Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling

Reference 4

Resolution
metadata mismatch
arxiv_id, observed 2026-07-03T13:58:21.825098Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-06-27T07:22:21.729255Z digest=sha256:b606cf486ba72036bc7b0bed4fefe85da46995a4858ba9dea6315716a6551f0b

Observation d5ffed6f-91eb-4376-84f6-61ab5db6b80f · inbound

Sampling and Optimization meet Enhanced Flows cites this paper.

Sampling and Optimization meet Enhanced Flows Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-10T10:22:55.716618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T10:22:55.716618Z digest=sha256:59fc444a3998cec8b057f5462e76c39d336208f18e1ed3f588b126a81a786d0f