Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Lower Bound for Randomized First Order Convex Optimization
As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1709.03594.
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-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T23:30:24.992058Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-15T21:53:54.481823Z
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 169bd41b-dcaa-489f-a398-2a81204853fc · inbound
Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness cites this paper.
Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness Lower Bound for Randomized First Order Convex Optimization
Reference 2020
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T23:30:24.992058Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5ca7a3b8-2976-4994-bf62-63600b6252ed · inbound
The Adaptive Complexity of Finding a Stationary Point cites this paper.
The Adaptive Complexity of Finding a Stationary Point Lower Bound for Randomized First Order Convex Optimization
Reference 50
- Resolution
- verified exact
- local_arxiv, observed 2026-08-15T21:53:54.486234Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 5ca466e7-de04-40e9-996e-ddc101175466 · inbound
Near-Optimal Lower Bounds for Randomized Algorithms in Exact Value Zeroth-Order Convex Optimization cites this paper.
Near-Optimal Lower Bounds for Randomized Algorithms in Exact Value Zeroth-Order Convex Optimization Lower Bound for Randomized First Order Convex Optimization
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T20:45:28.179176Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.