Pith. sign in

Paper Citation Record · LEDGER

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE

As of 17 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:1908.10426.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1908.10426 v1

Coverage vector

measured 10 of 10 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T10:51:26.444933Z

measured 10 of 10 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

10 of 10 outbound references displayed

  • verified exact2
  • verified fuzzy6
  • unresolved2
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 7595b69a-c089-40f2-858a-20d889c32bf4 · outbound

This paper cites Explicit Stabilised Gradient Descent for Faster Strongly Convex Optimisation.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE Explicit Stabilised Gradient Descent for Faster Strongly Convex Optimisation

Reference 1

Resolution
verified exact
local_arxiv, observed 2026-08-14T10:51:26.523274Z

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.

source=pdf_text observed=2026-08-14T10:51:26.401595Z digest=sha256:f2bb482a84a0706c71459861fc8921c047f2075dd09279c1349fb542e0de46e1

Observation a2154d14-c696-415c-b17a-a226c968c7c2 · outbound

This paper cites Stiffness of odes.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE Stiffness of odes

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T10:51:26.619892Z

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.

source=pdf_text observed=2026-08-14T10:51:26.407723Z digest=sha256:023d5e46ed1917ee94f51a414f583519d201ca8e781a1b69a5213821f3b32d12

Observation e963bd8e-c28d-42c7-a160-aa389d3f4634 · outbound

This paper cites A method for solving convex programming problems with convergence rate o(1/k2).

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE A method for solving convex programming problems with convergence rate o(1/k2)

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T10:51:26.605354Z

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.

source=pdf_text observed=2026-08-14T10:51:26.412332Z digest=sha256:d060d298a04ff94736217f498e32fedebaa3707c95e5561d3028df6211375e3c

Observation 9669d43c-8b0a-400b-9f62-b59e960a8c3b · outbound

This paper cites Accelerating the cubic regularization of newton’s method on convex problems.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE Accelerating the cubic regularization of newton’s method on convex problems

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-14T10:51:26.417376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T10:51:26.417376Z digest=sha256:f66306b16f36706d36374466092245670395a254d54037525369499a0d05cdb5

Observation 99b31ac2-6670-43c8-b050-417297560805 · outbound

This paper cites Understanding the Acceleration Phenomenon via High-Resolution Differential Equations.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE Understanding the Acceleration Phenomenon via High-Resolution Differential Equations

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-14T10:51:26.421704Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T10:51:26.421704Z digest=sha256:c0056db3d34b7cbba85ef7f22c443b3a0ba54797c5a28fa1c00bc86a243562e6

Observation bae4693e-12f4-4623-9c40-21e3f4d6ce90 · outbound

This paper cites Acceleration via Symplectic Discretization of High-Resolution Differential Equations.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE Acceleration via Symplectic Discretization of High-Resolution Differential Equations

Reference 6

Resolution
verified exact
local_arxiv, observed 2026-08-14T10:51:26.485877Z

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.

source=pdf_text observed=2026-08-14T10:51:26.426775Z digest=sha256:85d34601c3314c84202e9ff7454fad8b9bf0d0c057e9943465c3b4dadc47a606

Observation d770d0fd-8051-4434-a729-aecb54feeed2 · outbound

This paper cites A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T10:51:26.581883Z

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.

source=pdf_text observed=2026-08-14T10:51:26.432057Z digest=sha256:6468522e17dc91f19a9639e6a4bfc2f46a5e6a6bcc33fd4aef32a6e9e609d918

Observation ba8a7d87-e636-42d6-9f2e-f50012805bc9 · outbound

This paper cites Wilson, and Michael I.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE Wilson, and Michael I

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T10:51:26.567609Z

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.

source=pdf_text observed=2026-08-14T10:51:26.436496Z digest=sha256:69f67d67d1a828a81ed2de0070309bc8968bf67ca1c671f428b636431f9febc0

Observation 4089c4d7-f0ab-4fd5-899e-dcc794c1d195 · outbound

This paper cites Direct runge-kutta discretization achieves acceleration.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE Direct runge-kutta discretization achieves acceleration

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T10:51:26.552305Z

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.

source=pdf_text observed=2026-08-14T10:51:26.440854Z digest=sha256:f60fa623e48fb6d7fb0c25da0cb7dc51912473bd3ffa62a917f1f51cade74775

Observation cf41b3c4-0e65-4428-b12a-b6cd6e43558c · outbound

This paper cites We have 0 = det(M∞−λI) = lim k→∞ det ( 1− p k−λ p k −Cpϵ(k + 1)p−1(k−p k )A 1−Cpϵ(k + 1)p−1(p k)A−λ ) =λ2 +λ(Cp2ϵA− 2) + 1 =λ2 +λ(4CϵA− 2) + 1.

On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE We have 0 = det(M∞−λI) = lim k→∞ det ( 1− p k−λ p k −Cpϵ(k + 1)p−1(k−p k )A 1−Cpϵ(k + 1)p−1(p k)A−λ ) =λ2 +λ(Cp2ϵA− 2) + 1 =λ2 +λ(4CϵA− 2) + 1

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T10:51:26.538189Z

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.

source=pdf_text observed=2026-08-14T10:51:26.444933Z digest=sha256:34142b82fcdbbec0dd280983e9e7d877a2830efb28765e112631d9817918dc38

Pith citing papers

No inbound Pith citation observations are available.