Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.23849.
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-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-03T21:55:26.183046Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-20T14:53:23.335233Z
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 05291756-5d8e-4bd1-847f-f7c32c066e8d · inbound
Convex relaxation approaches for high-dimensional optimal transport cites this paper.
Convex relaxation approaches for high-dimensional optimal transport Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T21:55:26.183046Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 092a6f81-a88d-4f67-b645-a393f645103a · inbound
A preconditioned augmented Lagrangian method for solving semidefinite programming problems cites this paper.
A preconditioned augmented Lagrangian method for solving semidefinite programming problems Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
Reference 39
- Resolution
- verified exact
- arxiv_id, observed 2026-05-20T14:53:23.336625Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.