Pith. sign in

Paper Citation Record · LEDGER

Column and row subset selection using nuclear scores: algorithms and theory for Nystr\"{o}m approximation, CUR decomposition, and graph Laplacian reduction

As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.01698.

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

pith.paper-citation-record.v1
2407.01698 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T12:46:25.054430Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T22:03:14.717822Z

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 a3db56b4-cd1e-4a7c-b0fd-e46a53104e9b · inbound

Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation cites this paper.

Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation Column and row subset selection using nuclear scores: algorithms and theory for Nystr\"{o}m approximation, CUR decomposition, and graph Laplacian reduction

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-11T12:46:25.054430Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T12:46:25.054430Z digest=sha256:4852c96429e4149a7f6969807134fbb22933e62222c16211c5f315deb0d1a3d2

Observation 6e04c5b3-f2a4-488d-8217-e63d5b0f9f1b · inbound

An approximation theory for Markov chain compression cites this paper.

An approximation theory for Markov chain compression Column and row subset selection using nuclear scores: algorithms and theory for Nystr\"{o}m approximation, CUR decomposition, and graph Laplacian reduction

Reference 28

Resolution
verified exact
local_arxiv, observed 2026-08-06T22:03:14.783224Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T22:03:08.391535Z digest=sha256:d28e6d2c689c802b2460809d202ada13837541ebb70c729f1049c2a241409934

Observation 406a664b-e619-40ab-ae18-51f650125828 · inbound

Nystr\"om Error Beyond $M$-Matrices: A Minimal Diagonally Dominant Obstruction cites this paper.

Nystr\"om Error Beyond $M$-Matrices: A Minimal Diagonally Dominant Obstruction Column and row subset selection using nuclear scores: algorithms and theory for Nystr\"{o}m approximation, CUR decomposition, and graph Laplacian reduction

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:03.093425Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T13:00:03.093425Z digest=sha256:421e0e14969ac657403db86269de7cf32a70ae235084eb29bff4180e110b0389