Pith. sign in

Paper Citation Record · LEDGER

Oracle Complexity in Nonsmooth Nonconvex Optimization

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

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

pith.paper-citation-record.v1
2104.06763 v3

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-09T06:31:02.800959+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-07-31T23:09:54.423468Z

measured 0 of 1 external citation measurements

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

Source: cited_works

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 bbbf5cf0-d8ea-400d-b46f-4c75ec37ad1a · inbound

On the hardness of deterministic second-order optimization of functions with Lipschitz gradients cites this paper.

On the hardness of deterministic second-order optimization of functions with Lipschitz gradients Oracle Complexity in Nonsmooth Nonconvex Optimization

Reference 112

Resolution
unresolved
no resolver link, observed 2026-07-31T23:08:26.202757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-31T23:08:26.202757Z digest=sha256:f4ccb3e2f6aebdeb4fe30a79b3c964da30d51cfe2ddae3ed9e074f771bfffa3a

Observation 2345fd8d-7923-4b24-a24e-ba6f0b8e3877 · inbound

On computing Goldstein approximate second-order stationary points of structured nonsmooth nonconvex programs cites this paper.

On computing Goldstein approximate second-order stationary points of structured nonsmooth nonconvex programs Oracle Complexity in Nonsmooth Nonconvex Optimization

Reference 63

Resolution
unresolved
no resolver link, observed 2026-07-31T23:09:54.423468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:09:54.423468Z digest=sha256:d0fe035f54e1d089a8826482789f178ef09ea643910de3d5119c0794d7cf3313