Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Exact Convergence rate of the subgradient method by using Polyak step size
As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.15195.
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-19T06:32:44.657259+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-04T23:25:19.765126Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T09:56:03.825882Z
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 d3059cc5-fa47-47f6-86b8-9b016d440807 · inbound
On the convergence rate of the Douglas-Rachford splitting algorithm cites this paper.
On the convergence rate of the Douglas-Rachford splitting algorithm Exact Convergence rate of the subgradient method by using Polyak step size
Reference 30
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T23:25:19.765126Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6795d28c-57ab-47a2-b63e-0eabc8755724 · inbound
Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients cites this paper.
Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients Exact Convergence rate of the subgradient method by using Polyak step size
Reference 2023
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T19:10:48.716290Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1039132d-2ff0-4e8e-b7e3-4b072b19d40c · inbound
Last Iterate Convergence of AdaGrad-Norm for Convex Non-Smooth Optimization cites this paper.
Last Iterate Convergence of AdaGrad-Norm for Convex Non-Smooth Optimization Exact Convergence rate of the subgradient method by using Polyak step size
Reference 36
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T09:56:03.829104Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.