Pith. sign in

Paper Citation Record · LEDGER

Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization

As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2303.02854.

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

pith.paper-citation-record.v1
2303.02854 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 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-06T18:33:05.759122Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T18:33:08.325911Z

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 c6805866-2f9f-4bb1-a4c6-0298169ce516 · inbound

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness cites this paper.

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization

Reference 5

Resolution
verified exact
local_arxiv, observed 2026-08-06T18:33:08.368505Z

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.

source=arxiv_source observed=2026-08-06T18:33:05.759122Z digest=sha256:eb47993623ae3e1c23887805cedc8148a445abc303c500b27b29e80e1ac3cd27

Observation 1f237ab6-352e-4936-9520-24123b74a8bc · inbound

Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients cites this paper.

Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization

Reference 1

Resolution
unresolved
no resolver link, observed 2026-07-30T15:28:01.788411Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-30T15:28:01.788411Z digest=sha256:1a2e01beba3aec9ada3a6f49e77269e89c21cac9842b201b61ab682cb17c0fc9