Paper Citation Record · LEDGER

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient

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

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

pith.paper-citation-record.v1
2301.04431 v4

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-07T06:34:17.273281+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-06T10:32:29.867233Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-10T11:57:03.279012Z

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 87639928-5f7b-48d8-a397-1710003e9166 · inbound

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes cites this paper.

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient

Reference 25

Resolution: verified exact; arxiv_id, observed 2026-05-23T06:25:28.059606Z

Source-reported events for the cited work

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

Observation 400b61af-b8f5-478c-9a33-85c8495e5db5 · inbound

Adaptive Stepsize Selection in Decentralized Convex Optimization cites this paper.

Adaptive Stepsize Selection in Decentralized Convex Optimization Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-06T10:32:29.867233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c176c4d3-9315-4cbc-989e-0e2ed18df4b5 · inbound

Kahan's Automatic Step-Size Control for Unconstrained Optimization cites this paper.

Kahan's Automatic Step-Size Control for Unconstrained Optimization Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-05T23:05:49.702787Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9f42870-d830-455e-a45b-96af399e177c · inbound

Two Adaptive Accelerated Golden Ratio Primal--Dual Algorithms With an Application to Poisson Imaging Problem cites this paper.

Two Adaptive Accelerated Golden Ratio Primal--Dual Algorithms With an Application to Poisson Imaging Problem Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient

Reference 22

Resolution: metadata mismatch; local_arxiv, observed 2026-07-10T11:57:03.280526Z

Source-reported events for the cited work

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

Observation b9ec990e-91aa-4aa4-be06-8cde238dc506 · inbound

Two Adaptive Accelerated Golden Ratio Primal--Dual Algorithms With an Application to Poisson Imaging Problem cites this paper.

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T04:27:58.683439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.