Pith. sign in

Paper Citation Record · LEDGER

Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation

As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2503.18496.

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

pith.paper-citation-record.v1
2503.18496 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T16:42:43.728785Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-18T00:52:14.722206Z

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 9a0f7f21-8c40-4d7e-8e7f-118462d7872e · inbound

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings cites this paper.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-15T16:42:43.728785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T16:42:43.728785Z digest=sha256:76f3764341f0e46fe56d2d2ace523cfd38554c3ea6ef6991c52b234cc429bc47

Observation e554f959-a451-478d-9f95-f19b2c551e09 · inbound

Randomized biorthogonalization through a two-sided Gram-Schmidt process cites this paper.

Randomized biorthogonalization through a two-sided Gram-Schmidt process Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-05T10:20:08.519906Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T10:20:08.519906Z digest=sha256:34b750b5d53617425daa9a74408db11abe129e6f9a5fc1fbfa52b35b1905fee8

Observation 9bae93fa-b548-409a-886f-7abd8e8064e3 · inbound

Many (most?) column subset selection criteria are NP hard for a few columns cites this paper.

Many (most?) column subset selection criteria are NP hard for a few columns Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation

Reference 19

Resolution
verified exact
arxiv_id, observed 2026-05-18T00:52:14.724779Z

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.

source=pdf_text observed=2026-05-18T00:50:41.050714Z digest=sha256:e21934da930ea6fd8ee000259fa4160e078b942e9cf37310cc6d3ceca021168f

Observation b1cbc537-882b-4a75-9be0-929b7cdbc600 · inbound

Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows cites this paper.

Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-02T05:12:59.647458Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T05:12:59.647458Z digest=sha256:70e376f1439f29e846826ce5dc40ec94f6c2343aee179fdecf332b00b564e38a

Observation bf7d9488-8fde-440b-bf1a-541ebddcc408 · inbound

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition cites this paper.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-01T05:34:47.990678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T05:34:47.990678Z digest=sha256:217a7e43cca0333d1475256d96d1dac6a32b16ad1f771143ccc024ad2c8920d4