Paper Citation Record · LEDGER

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions

As of 8 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 2 inbound Pith citation observations for arXiv:2506.01168.

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

pith.paper-citation-record.v1
2506.01168 v1

Coverage vector

measured 22 of 22 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:02:09.846505Z

measured 24 of 24 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T06:11:16.417514Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T06:11:16.712711Z

Reference resolution

22 of 22 outbound references displayed

verified exact0
verified fuzzy19
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 01de164f-1faf-404a-9b85-79d0aa9ab65f · outbound

This paper cites On the oracle complexity of smooth strongly convex minimization,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions On the oracle complexity of smooth strongly convex minimization,

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.091782Z

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 e0d0d32e-bca2-44d0-9d33-1d247342c11d · outbound

This paper cites Smooth strongly convex interpolation and exact worst-case performance of first-order methods,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Smooth strongly convex interpolation and exact worst-case performance of first-order methods,

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.081764Z

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 ffe92ee4-cc37-4219-ad14-ec0459335c78 · outbound

This paper cites Analysis and design of opti- mization algorithms via integral quadratic constraints,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Analysis and design of opti- mization algorithms via integral quadratic constraints,

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.071470Z

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 799a675e-b2d5-4edc-8676-289c6057fdb7 · outbound

This paper cites The analysis of optimization algorithms: A dissipativity approach,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions The analysis of optimization algorithms: A dissipativity approach,

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.061947Z

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 d5140639-976b-44fc-9ddd-1d3a10855b21 · outbound

This paper cites Robust and structure exploiting optimisation algorithms: An integral quadratic constraint approach,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Robust and structure exploiting optimisation algorithms: An integral quadratic constraint approach,

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.052502Z

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 78eb3a5d-0cd9-4c81-95d9-7cad64e7695e · outbound

This paper cites Convex synthesis of accelerated gradient algorithms,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Convex synthesis of accelerated gradient algorithms,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.041607Z

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 165ee448-48aa-4e87-9fce-e3ee77abcc0f · outbound

This paper cites Direct synthesis of iterative algorithms with bounds on achievable worst-case convergence rate,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Direct synthesis of iterative algorithms with bounds on achievable worst-case convergence rate,

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.030579Z

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 08d9d7fb-4958-4d77-a750-5abd2c5a52fa · outbound

This paper cites The fastest known globally convergent first-order method for minimizing strongly convex functions,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions The fastest known globally convergent first-order method for minimizing strongly convex functions,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.020588Z

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 de9cee0c-4b1d-49e1-a2f6-21cd162d3932 · outbound

This paper cites An optimal gradient method for smooth strongly convex minimization,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions An optimal gradient method for smooth strongly convex minimization,

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:10.009705Z

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 f58232fc-c7d1-49b0-80dc-d863fafdfc51 · outbound

This paper cites Information-based complexity of linear operator equations,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Information-based complexity of linear operator equations,

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.998537Z

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 1de7d933-1104-4fd0-8ae4-9b7b95fce612 · outbound

This paper cites Nesterov, Lectures on convex optimization.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Nesterov, Lectures on convex optimization

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.988933Z

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 8e91f9d1-cd55-4a95-9ba5-8dd76707d2c9 · outbound

This paper cites Some methods of speeding up the convergence of iteration methods,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Some methods of speeding up the convergence of iteration methods,

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T12:02:09.811532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c226094-ac33-41e2-be33-7707f2cb0b6d · outbound

This paper cites Global convergence and asymptotic optimality of the heavy ball method for a class of nonconvex optimization problems,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Global convergence and asymptotic optimality of the heavy ball method for a class of nonconvex optimization problems,

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.972808Z

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 740bb502-d27e-433e-aed5-f24b756eb4d5 · outbound

This paper cites A generalized accelerated gradient optimization method,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions A generalized accelerated gradient optimization method,

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.962946Z

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 c6fe49be-9302-4d70-93b8-99f3222a1292 · outbound

This paper cites Ortega and W.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Ortega and W

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.953248Z

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 6f3e2d25-97a7-4001-8c71-7bfeed9b37c0 · outbound

This paper cites System analysis via integral quadratic constraints,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions System analysis via integral quadratic constraints,

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.944291Z

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 c94f88c2-5f80-413c-b7fe-6083b295572f · outbound

This paper cites Absolute stability analysis of discrete time feedback interconnections,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Absolute stability analysis of discrete time feedback interconnections,

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.933494Z

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 61c97d1f-842c-416e-b738-0147a597d0cd · outbound

This paper cites Zames–Falb multipliers for quadratic program- ming,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Zames–Falb multipliers for quadratic program- ming,

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.922112Z

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 488eba40-ceb4-4273-9de1-7844ccb946ce · outbound

This paper cites an unresolved cited work.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-08-07T12:02:09.911466Z

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 5efda61f-eec6-448a-a3b2-d7e81fca2453 · outbound

This paper cites Tradeoffs between convergence rate and noise amplification for momentum- based accelerated optimization algorithms,.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Tradeoffs between convergence rate and noise amplification for momentum- based accelerated optimization algorithms,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.901201Z

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 08734edd-fe38-44ae-928c-3b69d6c036de · outbound

This paper cites Fadali and A.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Fadali and A

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:02:09.888195Z

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 044e49c9-4877-45d8-ad64-14e6999eca6e · outbound

This paper cites an unresolved cited work.

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions Unresolved cited work

Reference 22

Resolution: unresolved; raw_fallback, observed 2026-08-07T12:02:09.876980Z

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.

Pith citing papers

Observation 8d54b0b8-3fb6-4539-b4bd-50f6410e162f · inbound

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms cites this paper.

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-08-06T06:11:16.718435Z

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 a2b34fca-48be-46a0-8722-b6ad8ca53ac3 · inbound

HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization cites this paper.

HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T09:19:03.492323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.