Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1802.03504.
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-15T06:32:42.880941+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-14T14:45:51.725782Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-14T05:44:01.482969Z
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 bd52e1b2-b746-4633-be93-bac5f9a36172 · inbound
Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization cites this paper.
Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T14:45:51.725782Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b083b574-d58a-4f4a-82c1-e404a09ef02f · inbound
Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization cites this paper.
Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
Reference 19
- Resolution
- verified exact
- local_arxiv, observed 2026-08-14T05:44:01.488564Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.