Pith. sign in

Paper Citation Record · LEDGER

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum

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

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

pith.paper-citation-record.v1
2410.08890 v1

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-08-06T21:42:47.709422Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-04T23:25:19.805216Z

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 10e15512-0dac-4f1a-9a71-603e3cb55c5f · inbound

Optimized methods for composite optimization: a reduction perspective cites this paper.

Optimized methods for composite optimization: a reduction perspective Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-06T21:42:47.709422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T21:42:47.709422Z digest=sha256:88b5f990e3ef2d9375441dffaa1558628bb195ca1d5104c71f1709878d6b5cb1

Observation 9c123e69-c5be-42d3-bba0-65c7c3ce43c4 · inbound

On the convergence rate of the Douglas-Rachford splitting algorithm cites this paper.

On the convergence rate of the Douglas-Rachford splitting algorithm Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum

Reference 27

Resolution
verified exact
local_arxiv, observed 2026-08-04T23:25:19.810648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-04T23:25:19.755221Z digest=sha256:5eaa651ee88533c34cb2eb23fd08999d5bb8e8cb2ac2c9d45605bffa371c3350