Pith. sign in

Paper Citation Record · LEDGER

Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry

As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1911.01469.

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

pith.paper-citation-record.v1
1911.01469 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-23T07:52:43.661204Z

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 679218c2-a295-4db1-ad4e-bf301e2ef3f5 · inbound

Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression cites this paper.

Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry

Reference 102

Resolution
verified exact
arxiv_id, observed 2026-05-23T07:52:43.664936Z

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.

source=pdf_text observed=2026-05-23T07:50:43.348358Z digest=sha256:53441e5a10c130a2c7c41f683751626fcc942a6c3958715f083d69f3f0745aac

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

On the query complexity of sampling from non-log-concave distributions cites this paper.

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:5866f613004dd2500ea32e90bde1539d04dcd3a4353304c5f18a2d02c126dfd2

Observation 982c4939-c5c4-4488-ba04-ddae3f8a3f65 · inbound

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

A proximal gradient algorithm for composite log-concave sampling Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry

Reference 40

Resolution
verified exact
arxiv_id, observed 2026-05-13T02:57:09.351005Z

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.

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