Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Subspace correction as a general framework for convex optimization algorithms
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2505.09765.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T16:25:19.188614Z
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 Subspace correction as a general framework for convex optimization algorithms
Reference 24
- Resolution
- verified exact
- arxiv_id, observed 2026-08-21T01:16:34.376708Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
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 Subspace correction as a general framework for convex optimization algorithms
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.
Observation 5c94c30a-0785-47ad-b579-2fe7a1fefe74 · inbound
Auxiliary space theory for the analysis of iterative methods for semidefinite linear systems cites this paper.
Auxiliary space theory for the analysis of iterative methods for semidefinite linear systems Subspace correction as a general framework for convex optimization algorithms
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T16:25:19.188614Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.