Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2102.01583.
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-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T23:30:24.995999Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-15T14:39:15.571232Z
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 a5259fda-dac4-4253-a60d-3d3f72b8f65b · 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 The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
Reference 2017
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T23:30:24.995999Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f5ed05f4-26ed-4e27-8c68-78058ba3c861 · inbound
Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization cites this paper.
Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
Reference 277
- Resolution
- verified exact
- local_arxiv, observed 2026-08-15T14:39:15.574426Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.