Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.15646.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-06T16:12:06.783864Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-10T10:19:20.660903Z
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 3677e9bf-1c6d-4879-b32c-1c420f913b9d · inbound
On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation cites this paper.
On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T16:12:06.783864Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1aa08b33-3f43-4d09-adff-8f88fb5da22e · inbound
Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles cites this paper.
Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization
Reference 36
- Resolution
- verified exact
- arxiv_id, observed 2026-05-10T10:19:20.663097Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.