Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:24:28.611408Z
Paper Citation Record · LEDGER
Online Learning-guided Learning Rate Adaptation via Gradient Alignment
As of 8 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2506.08419.
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-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
3 of 3 outbound references displayed
- verified exact0
- verified fuzzy1
- unresolved2
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 66452ae3-c590-49df-a718-1e1660c260f2 · outbound
This paper cites Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent.
Online Learning-guided Learning Rate Adaptation via Gradient Alignment Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:24:28.587566Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation db71fd12-d1b0-41b3-a719-d93ce2f7bdae · outbound
This paper cites High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize.
Online Learning-guided Learning Rate Adaptation via Gradient Alignment High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T05:24:28.734231Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 1a7f0fb7-aca2-4c02-842a-88d3e1c121da · outbound
This paper cites A simple uniformly optimal method without line search for convex optimization.
Online Learning-guided Learning Rate Adaptation via Gradient Alignment A simple uniformly optimal method without line search for convex optimization
Reference 2024
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:24:28.611408Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.