Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
The Communication Complexity of Optimization
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1906.05832.
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-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-04T00:28:36.469338Z
A source-named dated measurement, never combined with another source.
Source: cited_works
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 ada52d6b-492b-4383-9278-f2b219ea4f83 · inbound
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization cites this paper.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization The Communication Complexity of Optimization
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.469338Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.