Pith. sign in

Paper Citation Record · LEDGER

Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization

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

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

pith.paper-citation-record.v1
1808.03880 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-17T06:30:58.91139+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-15T21:53:54.141230Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-11T05:57:33.320487Z

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 f04b0e5d-1853-4898-b001-30c4221f2a44 · inbound

MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes cites this paper.

MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization

Reference 2015

Resolution
verified exact
local_arxiv, observed 2026-08-11T05:57:33.328756Z

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-11T05:57:33.125535Z digest=sha256:20df4e02582d5abf117161fb315f6498975c6adb2ee04772e2ee4e80b3b93480

Observation f6d2b953-7b0b-4601-b219-c26a9d26767f · inbound

The Adaptive Complexity of Finding a Stationary Point cites this paper.

The Adaptive Complexity of Finding a Stationary Point Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-15T21:53:54.141230Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T21:53:54.141230Z digest=sha256:48ebd531f7bff80a9936f23db43ef4a19f59a7cb411be8f80ccca625e838a7a8