Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
First-order methods for constrained convex programming based on linearized augmented Lagrangian function
As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1711.08020.
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-14T15:09:34.388367Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-05-24T16:56:16.375330Z
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 f218e67d-be26-4c2a-8fbc-97d9741cc907 · inbound
Contraction Analysis on Primal-Dual Gradient Optimization cites this paper.
Contraction Analysis on Primal-Dual Gradient Optimization First-order methods for constrained convex programming based on linearized augmented Lagrangian function
Reference 29
- Resolution
- verified exact
- local_arxiv, observed 2026-05-24T16:56:16.378935Z
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 902ef5a6-9fec-4d47-9fe4-d4cc56b22e18 · inbound
Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints cites this paper.
Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints First-order methods for constrained convex programming based on linearized augmented Lagrangian function
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:09:34.388367Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d5a04289-91bc-49d9-bb3d-1008f8f7f6f7 · inbound
Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization cites this paper.
Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization First-order methods for constrained convex programming based on linearized augmented Lagrangian function
Reference 73
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T10:22:25.717836Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.