Pith. sign in

Paper Citation Record · LEDGER

Connections between convex optimization algorithms and subspace correction methods

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

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

pith.paper-citation-record.v1
2505.09765 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-08T06:32:00.761636+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-06T20:26:38.342871Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-19T07:02:07.850250Z

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 067a706a-be17-4fc5-87cf-d1a16b144f2e · inbound

Randomized subspace correction methods for convex optimization cites this paper.

Randomized subspace correction methods for convex optimization Connections between convex optimization algorithms and subspace correction methods

Reference 24

Resolution
verified exact
arxiv_id, observed 2026-05-19T07:02:07.851637Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-19T06:57:36.636260Z digest=sha256:7915bc56b506c3beed82fa4318e9ae0ba90c879d98f2fc6133d43d58dbc4afe7

Observation 742d6635-d622-4a74-a38b-ac572358fcf6 · inbound

Parallel multilevel methods for solving the Darcy--Forchheimer model based on a nearly semicoercive formulation cites this paper.

Parallel multilevel methods for solving the Darcy--Forchheimer model based on a nearly semicoercive formulation Connections between convex optimization algorithms and subspace correction methods

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-06T20:26:38.342871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:26:38.342871Z digest=sha256:cffbf0213f44a617f1aa27b8e7b509d23cb80bf7b1c9dbc57dcf2e26c07e6c03