Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2203.16615.
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-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T17:52:28.589968Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T02:40:56.084712Z
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 b4569818-7732-4293-8fd7-b3e425d9550e · inbound
Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions cites this paper.
Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T17:52:28.589968Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 833674a7-da9a-4004-aba0-49a9c4915b61 · inbound
Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems cites this paper.
Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization
Reference 11
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T02:40:56.091190Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 7e3c1a6e-c745-40f7-9e8e-981b325c81db · inbound
Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis cites this paper.
Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization
Reference 94
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T00:57:11.936962Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.