Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
On the Optimal Lower and Upper Complexity Bounds for a Class of Composite Optimization Problems
As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2308.06470.
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-05T06:32:48.257954+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-26T20:02:45.082477Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-04T02:09:22.265174Z
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 4e7f283d-55ab-404f-949e-cc3e5c4725d9 · inbound
First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints cites this paper.
First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints On the Optimal Lower and Upper Complexity Bounds for a Class of Composite Optimization Problems
Reference 71
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T02:09:22.267541Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.