Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling
As of 12 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.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-10T10:22:55.716618Z
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-12T06:34:41.77262+00:00.
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-12T06:34:41.77262+00:00.
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-12T06:34:41.77262+00:00.
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-12T06:34:41.77262+00:00.
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.