Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.15793.
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-14T06:32:32.682623+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:14:29.755901Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-03T12:28:07.375542Z
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 c1f6c164-b125-413a-a005-de9dfdb6e915 · inbound
Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization cites this paper.
Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
Reference 33
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T17:14:29.755901Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1daa95ff-99c3-42a1-98c9-3f1b0ddb6370 · inbound
Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm cites this paper.
Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:15:01.954866Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4bea80a0-51a8-4647-86b7-8aaff6f5d31f · inbound
bAdag: an adaptive block coordinate gradient method for smooth nonconvex functions cites this paper.
bAdag: an adaptive block coordinate gradient method for smooth nonconvex functions Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
Reference 34
- Resolution
- verified exact
- arxiv_id, observed 2026-07-03T12:28:07.377213Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.