Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems
As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2006.08048.
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-14T10:22:25.631160Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-23T23:03:34.386406Z
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 802c79d0-272a-4bde-a533-31ed01a22571 · inbound
Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization cites this paper.
Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems
Reference 49
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T10:22:25.631160Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 52443126-4b38-4c8c-81aa-9a3dfeaa93b9 · inbound
An Adaptive Proximal ADMM for Nonconvex Linearly Constrained Composite Programs cites this paper.
An Adaptive Proximal ADMM for Nonconvex Linearly Constrained Composite Programs Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems
Reference 39
- Resolution
- verified exact
- arxiv_id, observed 2026-05-23T23:03:34.389437Z
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.
Observation a3b7ed16-b895-4449-86de-5cc7430d0650 · inbound
A Damped Subspace Splitting Algorithm for Constrained Density Functional Theory cites this paper.
A Damped Subspace Splitting Algorithm for Constrained Density Functional Theory Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems
Reference 49
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T01:04:55.089513Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.