Paper Citation Record · LEDGER

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2310.12139.

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

pith.paper-citation-record.v1
2310.12139 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 11 of 11 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 11 of 11 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T19:16:46.810442Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-23T06:25:28.048062Z

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 049e9f33-2098-4397-94b6-85a9259d4656 · inbound

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes cites this paper.

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 24

Resolution: verified exact; arxiv_id, observed 2026-05-23T06:25:28.051347Z

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 33eba5b0-4c0f-4fc2-b613-294a55961dd0 · inbound

A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization cites this paper.

A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-08T18:49:52.494744Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f51d06b-a0fb-4662-b0ab-143ebea5d09d · inbound

Gradient Methods with Online Scaling Part I. Theoretical Foundations cites this paper.

Gradient Methods with Online Scaling Part I. Theoretical Foundations Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-07T13:10:12.138443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f88a7fa-6d32-4190-a379-5464b34a5826 · inbound

Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion cites this paper.

Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-15T19:16:46.810442Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3fd34fc-f66f-400a-845d-7bf340d34aea · inbound

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization cites this paper.

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-15T16:17:24.828317Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3136f5e9-3b2c-4c6a-aa39-8173c4a07d28 · inbound

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization cites this paper.

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-05-18T17:21:40.034267Z

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 76274d5a-228b-4715-80d3-e5216f0852e4 · inbound

Stochastic Adaptive Gradient Descent Without Descent cites this paper.

Stochastic Adaptive Gradient Descent Without Descent Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-15T15:59:07.473306Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2c772a2-e3c8-4dee-b837-4bbb2831cb2a · inbound

Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization I: Convex Optimization cites this paper.

Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization I: Convex Optimization Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-03T09:22:12.506552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbc1a885-9203-44e2-adf5-66d59ac341b2 · inbound

Universal and Parameter-free Gradient Sliding for Composite Optimization cites this paper.

Universal and Parameter-free Gradient Sliding for Composite Optimization Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 14

Resolution: verified exact; arxiv_id, observed 2026-05-21T10:30:00.355207Z

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 14e53317-7909-4df5-81a4-fefaa3ed2804 · inbound

Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging cites this paper.

Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 35

Resolution: metadata mismatch; arxiv_id, observed 2026-05-11T12:11:08.121071Z

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 a2702532-9101-40c7-8a20-58618fa118ee · inbound

Efficient Gradient Methods for Distributed Saddle Problems cites this paper.

Efficient Gradient Methods for Distributed Saddle Problems Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Reference 43

Resolution: metadata mismatch; arxiv_id, observed 2026-05-20T08:43:10.151901Z

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.