Paper Citation Record · LEDGER

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings

As of 21 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 2 inbound Pith citation observations for arXiv:2509.03198.

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

pith.paper-citation-record.v1
2509.03198 v3

Coverage vector

measured 39 of 39 reference resolution

Typed states for the displayed outbound observations.

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

measured 41 of 41 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 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T05:12:59.156021Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

39 of 39 outbound references displayed

verified exact0
verified fuzzy30
unresolved9
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 39793526-22dc-4173-9784-e19949918d98 · outbound

This paper cites Randomized gram–schmidt process with application to gmres.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Randomized gram–schmidt process with application to gmres

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.190878Z

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 e783d695-4b1d-476f-b4ae-fb36d6c51bc1 · outbound

This paper cites Communication avoiding low rank approximation based on qr with tournament pivoting.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Communication avoiding low rank approximation based on qr with tournament pivoting

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.181041Z

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 d621e4d2-ad89-455b-b061-d0a1820a4dcc · outbound

This paper cites An improved approximation algorithm for the column subset selection problem.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings An improved approximation algorithm for the column subset selection problem

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.171220Z

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 f9204304-fef2-43f4-af9e-e321b06e8de4 · outbound

This paper cites Linear least squares solutions by householder trans- formations.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Linear least squares solutions by householder trans- formations

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.161678Z

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 d058b14b-ee81-467e-a8c3-0add0adeecc1 · outbound

This paper cites Rank revealing qr factorizations.Linear algebra and its applications, 88: 67–82, 1987.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Rank revealing qr factorizations.Linear algebra and its applications, 88: 67–82, 1987

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.151574Z

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 33a9147d-97bb-438d-93fd-764593ec6c97 · outbound

This paper cites Some applications of the rank revealing qr factorization.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Some applications of the rank revealing qr factorization

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.141336Z

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 68f8ecf9-d58c-4057-8134-d1e35cd27bfb · outbound

This paper cites On rank-revealing factorisations.SIAM Journal on Matrix Analysis and Applications, 15(2):592–622, 1994.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings On rank-revealing factorisations.SIAM Journal on Matrix Analysis and Applications, 15(2):592–622, 1994

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.131290Z

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 ec40b1ff-83dc-4ef7-bab2-47bd9e9ad4aa · outbound

This paper cites Optimal embedding dimension for sparse subspace embeddings.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Optimal embedding dimension for sparse subspace embeddings

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.120751Z

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 9f8c96f5-b9c3-437b-93bc-bec251f5674d · outbound

This paper cites Nearly tight oblivious subspace embeddings by trace inequalities.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Nearly tight oblivious subspace embeddings by trace inequalities

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.110888Z

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 2440531d-20d1-4f28-9720-a09e73c2cd9c · outbound

This paper cites An elementary proof of a theorem of johnson and lindenstrauss.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings An elementary proof of a theorem of johnson and lindenstrauss

Reference 10

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7afd612b-82a4-470f-bceb-f6a3378329fe · outbound

This paper cites Communication avoiding rank revealing qr factorization with column pivoting.SIAM Journal on Matrix Analysis and Applications, 36(1):55–89, 2015.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Communication avoiding rank revealing qr factorization with column pivoting.SIAM Journal on Matrix Analysis and Applications, 36(1):55–89, 2015

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.094888Z

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 071d3b32-806e-4b4e-b964-b64fcbd268dd · outbound

This paper cites Fast approximation of matrix coherence and statistical leverage.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Fast approximation of matrix coherence and statistical leverage

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.084719Z

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 8d2f6c20-e650-4ab7-9abc-1261b87539ef · outbound

This paper cites Duersch and Ming Gu.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Duersch and Ming Gu

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21f88b51-3a69-4641-872a-088e7e8c152d · outbound

This paper cites Fast and forward stable randomized algorithms for linear least-squares problems.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Fast and forward stable randomized algorithms for linear least-squares problems

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.074097Z

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 11aabd67-ed03-4b9b-905e-af478894cbc1 · outbound

This paper cites an unresolved cited work.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Unresolved cited work

Reference 15

Resolution: unresolved; raw_fallback, observed 2026-08-15T16:42:44.063733Z

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 e7868d96-8caf-407c-80dc-efbe3f0e7859 · outbound

This paper cites Numerical methods for solving linear least squares problems.Numerische Mathematik, 7:206–216, 1965.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Numerical methods for solving linear least squares problems.Numerische Mathematik, 7:206–216, 1965

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.054133Z

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

This paper cites Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation.

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.

Observation a210a07e-5750-46a6-a6fc-f6c8a53594c3 · outbound

This paper cites Efficient algorithms for computing a strong rank- revealing qr factorization.SIAM Journal on Scientific Computing, 17(4):848–869, 1996.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Efficient algorithms for computing a strong rank- revealing qr factorization.SIAM Journal on Scientific Computing, 17(4):848–869, 1996

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.043817Z

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 80957d5a-b431-4722-a03c-173e6debb8ee · outbound

This paper cites Rank-revealing qr factorizations and the singular value decomposition.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Rank-revealing qr factorizations and the singular value decomposition

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.033920Z

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 100e13b2-9aaa-4bcd-9f1e-0f43c075b778 · outbound

This paper cites Cambridge university press, 2012.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Cambridge university press, 2012

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a27bfc1-b9ee-4688-8217-55d7171de664 · outbound

This paper cites Ipsen and S.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Ipsen and S

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.017826Z

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 b130bcf0-a922-4c02-b34f-454af77d9adf · outbound

This paper cites Extensions of lipschitz mappings into a hilbert space.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Extensions of lipschitz mappings into a hilbert space

Reference 22

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac24e69f-bc16-4792-8ce5-bef44683ccaf · outbound

This paper cites Numerical linear algebra.Canadian Mathematical Bulletin, 9(5):757–801, 1966.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Numerical linear algebra.Canadian Mathematical Bulletin, 9(5):757–801, 1966

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:44.001612Z

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 639e634d-cb4a-480e-88bf-1fe3fdf9402e · outbound

This paper cites Sparser johnson-lindenstrauss transforms.Journal of the ACM (JACM), 61(1):1–23, 2014.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Sparser johnson-lindenstrauss transforms.Journal of the ACM (JACM), 61(1):1–23, 2014

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.991577Z

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 75db5be1-b645-4161-aad4-19ed0b8c2771 · outbound

This paper cites Lu factorization with panel rank revealing pivoting and its communication avoiding version.SIAM Journal on Matrix Analysis and Applications, 34(3):1401–1429, 2013.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Lu factorization with panel rank revealing pivoting and its communication avoiding version.SIAM Journal on Matrix Analysis and Applications, 34(3):1401–1429, 2013

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.981343Z

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 bd3d3f3c-0ec9-491c-90cd-cf5cb59ad892 · outbound

This paper cites Optimality of the johnson-lindenstrauss lemma.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Optimality of the johnson-lindenstrauss lemma

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.970493Z

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 caeb784d-9ee1-4757-87eb-ff1173cbb7c0 · outbound

This paper cites Randomized numerical linear algebra: Foun- dations and algorithms.Acta Numerica, 29:403–572, 2020.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Randomized numerical linear algebra: Foun- dations and algorithms.Acta Numerica, 29:403–572, 2020

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.960632Z

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 b1a472e3-a7e6-4457-9f8d-25267c97f2ff · outbound

This paper cites Householder qr factorization with randomization for column pivoting (hqrrp).

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Householder qr factorization with randomization for column pivoting (hqrrp)

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.950633Z

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 a1adb157-b8c8-4c00-a85e-7926819c4748 · outbound

This paper cites Low-distortion subspace embeddings in input- sparsity time and applications to robust linear regression.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Low-distortion subspace embeddings in input- sparsity time and applications to robust linear regression

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.939972Z

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 d7c0839b-ec53-4df7-8f3e-03cc70944a2b · outbound

This paper cites Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.929336Z

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 931f9f13-0e38-4d70-9e6a-122a0072b526 · outbound

This paper cites Lower bounds for oblivious subspace embeddings.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Lower bounds for oblivious subspace embeddings

Reference 31

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5264707a-9b83-4f42-bf54-5ab385e03d51 · outbound

This paper cites On the existence and computation of rank-revealing lu factorizations.Linear Algebra and its Applications, 316(1-3):199–222, 2000.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings On the existence and computation of rank-revealing lu factorizations.Linear Algebra and its Applications, 316(1-3):199–222, 2000

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.912701Z

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 68de0b87-cf7c-4c2f-9890-81bc4edc58a5 · outbound

This paper cites balls into bins.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings balls into bins

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.902669Z

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 f852404a-9d17-4aae-8e0b-7ada2b5681e6 · outbound

This paper cites Column subset selection is np-complete.Linear Algebra and its Applica- tions, 610:52–58, 2021.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Column subset selection is np-complete.Linear Algebra and its Applica- tions, 610:52–58, 2021

Reference 34

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3445528-56f0-41a8-927b-92fdf3ba8d94 · outbound

This paper cites Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation.SIAM Journal on Computing, 41(2): 293–331, 2012.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation.SIAM Journal on Computing, 41(2): 293–331, 2012

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.892144Z

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 582a4b57-80d9-47f8-a68e-f25e821d40e3 · outbound

This paper cites Improved analysis of the subsampled randomized hadamard transform.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Improved analysis of the subsampled randomized hadamard transform

Reference 36

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bca04cfa-e888-4a98-a9ba-87860123c75c · outbound

This paper cites Error analysis of direct methods of matrix inversion.Journal of the ACM (JACM), 8(3):281–330, 1961.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Error analysis of direct methods of matrix inversion.Journal of the ACM (JACM), 8(3):281–330, 1961

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.875527Z

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 c27839db-b4d1-4c25-b79a-9005750929ef · outbound

This paper cites Sketching as a tool for numerical linear algebra.Foundations and Trends® in Theoretical Computer Science, 10(1–2):1–157, 2014.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Sketching as a tool for numerical linear algebra.Foundations and Trends® in Theoretical Computer Science, 10(1–2):1–157, 2014

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.865116Z

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 011e7ec4-8498-48ac-9e04-60953407740d · outbound

This paper cites Fast parallel randomized qr with column pivoting algorithms for reliable low-rank matrix approximations.

Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings Fast parallel randomized qr with column pivoting algorithms for reliable low-rank matrix approximations

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:42:43.854475Z

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.

Pith citing papers

Observation c9171d1b-4e31-4e9f-b014-4c5a67aa3a8d · inbound

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

Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings

Reference 35

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9579b8a9-8c38-4ee7-b6fd-4e496cb0450a · 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 Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.