Pith. sign in

Paper Citation Record · LEDGER

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products

As of 8 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2606.12179.

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

pith.paper-citation-record.v1
2606.12179 v1

Coverage vector

measured 60 of 60 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-27T08:09:16.681208Z

measured 61 of 61 standing notices

One-hop event checks from named stored sources.

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

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-03T08:39:56.280803Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

60 of 60 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved60
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a92af522-3108-47f9-9fa4-e824470d0403 · outbound

This paper cites and Beck, Leland L.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Beck, Leland L

Reference 1

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:4d75c64f1800a23599be5dc744c680ee250774d4ffa792b79a53b5718463b3b8

Observation 4e799413-ced7-4939-8cbd-cb99b7f4f7f2 · outbound

This paper cites Eigenvalues and Condition Numbers of Random Matrices , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Eigenvalues and Condition Numbers of Random Matrices , volume =

Reference 2

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:c3f377707ef0f4694c756f2f2be45cd82b748daabfd48907b97fc0a12b3efff8

Observation 3cb08a4d-6e56-401a-b093-018d706fc117 · outbound

This paper cites The matrix-vector complexity of.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products The matrix-vector complexity of

Reference 3

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:152f04acfc2db8c92608b1054e8b2117566351258365762bc178fb383eb12f76

Observation a613a48d-8656-4fa9-8b84-1077389aed36 · outbound

This paper cites Sharper Bounds for Chebyshev Moment Matching, with Applications , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Sharper Bounds for Chebyshev Moment Matching, with Applications , year =

Reference 4

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:4196337e800da8c3a1225056aadaa295675770c6e14227c5e9b911b61535e0a5

Observation 985dea21-2721-4137-99fc-e3b8cbfb144c · outbound

This paper cites Woodruff and Guang Yang and Jialin Zhang , booktitle =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Woodruff and Guang Yang and Jialin Zhang , booktitle =

Reference 5

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:6c4817ac683398ca91d091463c667f1b83c70d59d2a6e092ac448f2c95ac32f2

Observation 89bce488-4edd-4f3c-9d3f-0c96648c16eb · outbound

This paper cites Query lower bounds for log-concave sampling , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Query lower bounds for log-concave sampling , volume =

Reference 6

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:ddaa0d50279af44cb8b155fdcfdf09fb29f1d3199da3cbb6c6be31b6d5580be2

Observation 32d56f0d-f70b-4a89-8001-57c5af5302f9 · outbound

This paper cites Analysis of stochastic.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Analysis of stochastic

Reference 7

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:e0f71411931b42d3f26037bf0b46671d5cc08c3ae9400e2862ac23ef4cca881c

Observation 0b16de36-ba83-403d-9f4f-c0de39309ebb · outbound

This paper cites Meyer and Cameron Musco and Christopher Musco and David Woodruff , booktitle =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Meyer and Cameron Musco and Christopher Musco and David Woodruff , booktitle =

Reference 8

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:cfca378bc4c002216a28e9f81123d60b81eb02ba621313cedd67b9e2b188914e

Observation dcb8b1aa-e3f3-4755-acbd-ad6fe405f794 · outbound

This paper cites Meyer and William Swartworth and David Woodruff , booktitle =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Meyer and William Swartworth and David Woodruff , booktitle =

Reference 9

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:d46ec74ae936aaf1456f8604d63c8de0955830ab1015fc356b2cc4002602e1f2

Observation a8a26b09-e751-49b2-a278-bab0e05a35b7 · outbound

This paper cites Optimal Query Complexities for Dynamic Trace Estimation , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Optimal Query Complexities for Dynamic Trace Estimation , year =

Reference 10

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:dac69f48fae5b133f7370fcc2b2be0c81ff71a1175a5c2400165b733e07a6b6a

Observation 1de6a6bd-52a5-47cf-9aa5-b2c0b2d21cb1 · outbound

This paper cites Tight query complexity lower bounds for.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Tight query complexity lower bounds for

Reference 11

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:7859f4cf30f2858dbc0d2edaca5a6a246f20ad5b34ffb97690b7c1fb68a29d02

Observation 527610f1-3919-4ed9-8163-72e931e0b20b · outbound

This paper cites The Gradient Complexity of Linear Regression , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products The Gradient Complexity of Linear Regression , year =

Reference 12

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:6e79d6f3fddbef8a5cb9ddf65eb9907526a86a4793b1cc740d1760ea926fb2ef

Observation efc64f4b-3367-4a58-8be3-d6cf6df66782 · outbound

This paper cites Sublinear Time Spectral Density Estimation , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Sublinear Time Spectral Density Estimation , year =

Reference 13

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:59d50d23af426da2d48df697841c599247c461f168c41fdd5ac2b9b4d125e575

Observation 054e593c-4bdf-4d84-8e2c-ae173d8e94a0 · outbound

This paper cites and Thilikos, Dimitris M.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Thilikos, Dimitris M

Reference 14

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:ae471f4351815e9e93da454d29ff72178a92cd8314def39e106cca11ee45f82d

Observation 1c7667ca-1628-4d5d-a68b-ad1b8943e75d · outbound

This paper cites On chromatic number of graphs and set-systems , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products On chromatic number of graphs and set-systems , volume =

Reference 15

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:5b5c79f9cdcc690d7af9fff62e20b0db4866281e1156fe520c074e061566edd0

Observation f74c4102-35b0-450e-898b-8a9c7560a4a3 · outbound

This paper cites an unresolved cited work.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Unresolved cited work

Reference 16

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:093f0d55d37381c189e067da8ce185312037a5b3eac3d0832665dc1f3d908e1a

Observation 43a98b29-0a82-4f6b-984a-af751c9568cd · outbound

This paper cites Goldfarb and Ph.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Goldfarb and Ph

Reference 17

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:c2f5cc16ce69c12266c3605f963a153041c581e9731fc2021aa1520e430f8551

Observation 50d1367d-9615-4e01-ba45-c9ce0af8c63a · outbound

This paper cites Thomas , date-added =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Thomas , date-added =

Reference 18

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:37ca58639920056b93c95335c70414aa3b1908ae7dd788b3edd13497627630be

Observation 855a8693-5c21-41e4-86af-06f8ed29724c · outbound

This paper cites ACM Trans.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products ACM Trans

Reference 19

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:c6222ac20cd92553881217811de6e842e8679347ec9eebe25f0953b902217816

Observation 9f8d08ae-1a5c-4cca-b207-9dfff6fb8be1 · outbound

This paper cites The Elements of Differentiable Programming , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products The Elements of Differentiable Programming , year =

Reference 20

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:b781a3063cb3f60114ab57a22ef9bb8a48d6ece2114a11c01d8053c8cc0b419c

Observation 14088795-b68a-4d15-b025-66ea45271ec5 · outbound

This paper cites Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions , volume =

Reference 21

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:c9f5db64081a2c09c87c8359aa297774e44054e5ace4410e92bba88faa97fcb6

Observation d4ac843e-a0dc-4264-a58f-2989cfe422f9 · outbound

This paper cites and Saad, Yousef , date-added =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Saad, Yousef , date-added =

Reference 22

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:25b15165ee6a9d6a19f6cf1a8ca13bbf66231d6d4365109b1cbfc67d49226178

Observation 8a7802d8-bf8f-491d-a89c-3786f85240ad · outbound

This paper cites an unresolved cited work.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Unresolved cited work

Reference 23

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:e0934b1f357bd686ba29c9eb8db1bd8ca216496eefbc6563e459c5104f3cb190

Observation 2578b106-9c29-4c41-8225-9346ab9cf36d · outbound

This paper cites Aster and Brian Borchers and Clifford H.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Aster and Brian Borchers and Clifford H

Reference 24

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:d4e3c7df27eff0b0253307151fda4a0f8cc6b21697a5322755b01cecdd9b59ca

Observation 1a839eba-2775-451c-b0ad-68a27cc764c8 · outbound

This paper cites Full waveform inversion and the truncated Newton method: quantitative imaging of complex subsurface structures , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Full waveform inversion and the truncated Newton method: quantitative imaging of complex subsurface structures , volume =

Reference 25

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:da724639fc40837b1edb43c0b33f0103a5f857b68e6aaae5f42e626ef7d8ec34

Observation 87ba572f-088e-4d48-ad1b-26c2e85dc467 · outbound

This paper cites , date-added =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products , date-added =

Reference 26

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:abb7c376aa6892204e5fe2296286db53ca06717db6e308b298a5ef1bf71d3b39

Observation 7593e98f-c0ed-4ff0-8749-87f69669add7 · outbound

This paper cites , date-added =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products , date-added =

Reference 27

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:84dba216103dc19301066862b38a1e8d0ace5e9908fd9bd0bcc2e568546410c3

Observation d61ad18e-452b-4548-95cc-ed2c3428d348 · outbound

This paper cites and Vries, Harm de and Bengio, Yoshua , booktitle =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Vries, Harm de and Bengio, Yoshua , booktitle =

Reference 28

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:b399e4c055d0d3de9f20f80a31d9fb86214fae34003183da43bc899c023a5f03

Observation 53bef18c-c7c8-447e-8112-cc85ffecf2b2 · outbound

This paper cites an unresolved cited work.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Unresolved cited work

Reference 29

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:2d7fab66a57b574d15a0c456a72dfe788f039a93b3a5a490f4e3531da2732368

Observation 33d4d63c-8a6c-4471-a429-fe32b101c1be · outbound

This paper cites Randomized Block.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Randomized Block

Reference 30

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:7c8976e0fc1745bce91fbf727f23bb7e2d93abb650fa0ed145143ccee7c3aeb4

Observation 3fca6f13-3ee2-460b-904c-c2fc2b503bc7 · outbound

This paper cites Communications in Mathematical Sciences , number =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Communications in Mathematical Sciences , number =

Reference 31

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:48234101042e2c1a831e4b2a6e15d5aaf5ef691c98527d81a112e087fe184a23

Observation 929fc774-ed48-4cb6-a96f-ce97f8cc809a · outbound

This paper cites Fast construction of hierarchical matrix representation from matrix--vector multiplication , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Fast construction of hierarchical matrix representation from matrix--vector multiplication , volume =

Reference 32

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:0f7ce456add9b17e6af254765bbfee2c2603207ebf4310405555cff4d303824e

Observation cb48dec1-84c2-48eb-9107-a1ae4f74bd80 · outbound

This paper cites Butterfly Factorization Via Randomized Matrix-Vector Multiplications , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Butterfly Factorization Via Randomized Matrix-Vector Multiplications , volume =

Reference 33

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:bc986b8a51ec509cf7455d8c8acfd0be0675d25a58794ee4ce785108dbf50690

Observation 0cb7c7b2-a3c3-448d-9c61-1317b2a5802c · outbound

This paper cites Pearce and Anna Yesypenko and James Levitt and Per-Gunnar Martinsson , date-added =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Pearce and Anna Yesypenko and James Levitt and Per-Gunnar Martinsson , date-added =

Reference 34

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:7da8fbbe08670e5d51970eaccd5e7a1925345c4b81151af4693005d44b34bcea

Observation 92a0f28f-b786-4eed-8ff1-392dd590a28c · outbound

This paper cites Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices , volume =

Reference 35

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:fbf7917bbbf0a9c68310ec1edee8bb406f27f94ae2f414f69907ca6263271442

Observation e03f19db-a5a7-462f-bccc-092e91e8101c · outbound

This paper cites Journal of Computational and Applied Mathematics , title =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Journal of Computational and Applied Mathematics , title =

Reference 36

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:9a3d8ffaf9cdff6ff747606f11a4eea97d215f8e3cfae997619138df050a3626

Observation 6d14956e-375f-42ab-939f-4adbac0fc2eb · outbound

This paper cites and Woodruff, David P.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Woodruff, David P

Reference 37

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:9fb9785dcaceb28730cbbbae75029ae4e902a115991e31a03969732c0deb1c01

Observation 94a09460-7e06-4f52-902f-357d339323f7 · outbound

This paper cites and Woodruff, David P.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Woodruff, David P

Reference 38

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:644d55c7805bcc4f6298c99d9372fcd6499e258adaa7233dd470ddf294225a59

Observation faac729c-f0c7-49a2-b428-84b7322cb2eb · outbound

This paper cites Krylov Methods are (nearly) Optimal for Low-Rank Approximation , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Krylov Methods are (nearly) Optimal for Low-Rank Approximation , year =

Reference 39

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:5bf2fab54111817f9427b615b21d318301d9d6b58f4f2c8f2464b57959b64c3a

Observation 69fa8d44-ce5a-4235-8d89-23993c738ab3 · outbound

This paper cites A Tight Analysis of Hutchinson's Diagonal Estimator , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products A Tight Analysis of Hutchinson's Diagonal Estimator , year =

Reference 40

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:39e4d8d14d5c35ef8c0299088eeaee627247a9825ee8b1b4b9e660bd893d399e

Observation ceed7e84-b7c1-454a-8644-82b0d133e7e5 · outbound

This paper cites Query Efficient Structured Matrix Learning , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Query Efficient Structured Matrix Learning , year =

Reference 41

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:7b4b4ded2bab2eca8715662b5c7d734677e95300911db01591101d2401e2aa1a

Observation e393e8a8-4006-4a77-bf46-8306205daa2a · outbound

This paper cites an unresolved cited work.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Unresolved cited work

Reference 42

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:253a104698951798cbd995dce8ff95098a9639579127e08791f3a3e762d37780

Observation 92de922b-8f77-45c4-aa5a-2649614ee576 · outbound

This paper cites and Cai, Jin-Yi , date-added =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Cai, Jin-Yi , date-added =

Reference 43

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:f9643817ab37f849f93cf75093a4d5e43134e3ca8250510d17abc878b599b927

Observation 8147ca15-9c87-4594-b687-e76b331c4540 · outbound

This paper cites an unresolved cited work.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Unresolved cited work

Reference 44

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:f3ba9af8d978117dcdd346dadeb541f2f17282ee3d0152ce2eca3f7db3f9a08e

Observation 3b4997fa-5815-4654-b529-613dadfcb4ea · outbound

This paper cites Baston and Yuji Nakatsukasa , date-added =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Baston and Yuji Nakatsukasa , date-added =

Reference 45

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:47875dd9c1d7ffb6cb85bb887516b760bdbc0f7cb6ca85489d191f5980e03464

Observation 7f8168b1-7a86-4d26-b469-efb9d253c3d3 · outbound

This paper cites and Kokiopoulou, E.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Kokiopoulou, E

Reference 46

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:d81f45eb3ded14342270de3a5a9207ff50702d5920b7a3a115bebb00737eda59

Observation b4aee3dc-4e3a-456c-9064-1c1ac96aca8b · outbound

This paper cites Structured Semidefinite Programming for Recovering Structured Preconditioners , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Structured Semidefinite Programming for Recovering Structured Preconditioners , year =

Reference 47

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:a69cf4bc4ef36d422d4ab525a9d311d3361054d0b97f381a83f6b05818724955

Observation d970bb29-f99a-4cdc-8df2-3104b0805d69 · outbound

This paper cites Sparse Cholesky Factorization by Kullback--Leibler Minimization , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Sparse Cholesky Factorization by Kullback--Leibler Minimization , volume =

Reference 48

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:66adbf237195f55638577dab38fdc43cbfdcb5f2feb8b5b8af8d3db253b9ddbe

Observation 39627478-7c10-4c62-8641-68dc7baf8be9 · outbound

This paper cites Sparse Recovery of Elliptic Solvers from Matrix-Vector Products , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Sparse Recovery of Elliptic Solvers from Matrix-Vector Products , volume =

Reference 49

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:8aa2b9acf77b80241346f3e6ec157f8180ea6e99bf8d61a8fcd6cc75c6121364

Observation 2c5c368d-99e1-4582-b6f3-602985e47efb · outbound

This paper cites and Kovachki, Nikola B.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Kovachki, Nikola B

Reference 50

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:a03c0f8b351ca1ccc8ac811154ea21d104263a373af2d208f768cdd074082d48

Observation c0b68d8d-43e9-41ff-b445-6bca677fb57d · outbound

This paper cites Learning Elliptic Partial Differential Equations with Randomized Linear Algebra , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Learning Elliptic Partial Differential Equations with Randomized Linear Algebra , volume =

Reference 51

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:bd97a430161d031280b242b72280a712c7c84365417d98b19839f8d3a32f41eb

Observation c4c66dad-ab32-4bbd-b07b-8716816ccc32 · outbound

This paper cites SIAM Journal on Matrix Analysis and Applications , title =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products SIAM Journal on Matrix Analysis and Applications , title =

Reference 52

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:3f1f5d5780b8891ae79c81718b27532476510e0c45806759994ed30233d29fc5

Observation 5bdf8992-7fa5-402b-9bc5-53128f99e89f · outbound

This paper cites Operator learning without the adjoint , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Operator learning without the adjoint , volume =

Reference 53

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:555894479fb358c40f96f6c135f820310fe24071da7111f6db47ffe5f98d8521

Observation 107ef049-f294-4491-acdf-6260426e57c0 · outbound

This paper cites Elliptic.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Elliptic

Reference 54

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:c8f6433bf5dfff785734ecf0135840f14fc3f1c019d8e08f951356c4a6d98d1f

Observation 3786742b-50b8-46d3-bf44-937f6242181b · outbound

This paper cites Near-optimal hierarchical matrix approximation from matrix-vector products , year =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Near-optimal hierarchical matrix approximation from matrix-vector products , year =

Reference 55

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:2c5530fbfa4f3033fd3db8b36a06036a84cd011793a7353d26ccda1de7e34721

Observation a83b3779-a791-4e84-8a31-384e227e4801 · outbound

This paper cites Structured matrix recovery from matrix‐vector products , volume =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Structured matrix recovery from matrix‐vector products , volume =

Reference 56

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:4d2bbf49ef21dc5491ec9a032ffa240b472e307bc17b3927a6d351870f71aa9e

Observation 242307ed-85eb-4f5c-a1d5-7c789bff1dc5 · outbound

This paper cites an unresolved cited work.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Unresolved cited work

Reference 57

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:8e143ef9ca7fa20caabf8f0cea849cd9512e2d295e7fb9495d59c5a1e7959b4d

Observation d6682ed8-f957-429c-9662-d5c03aae8514 · outbound

This paper cites Coloring, register allocation,.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Coloring, register allocation,

Reference 58

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:5d83071895ec82bd41c82b4491e03c2c0e8c0ae3bf35c46672dfedceef869695

Observation 6470ddfa-83b2-4115-b6a7-2747c0f18845 · outbound

This paper cites and Martinsson, P.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products and Martinsson, P

Reference 59

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:1d1fdfec347083a781728fb62e679aa84390c55e31a3d4ef8c1cc57fe28260f3

Observation 2beb88ba-58fc-431e-abd4-3cbb39ce29f5 · outbound

This paper cites SIAM Journal on Matrix Analysis and Applications , title =.

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products SIAM Journal on Matrix Analysis and Applications , title =

Reference 60

Resolution
unresolved
no resolver link, observed 2026-06-27T08:09:16.681208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T08:09:16.681208Z digest=sha256:9aed30600e8b8ca9c8de58b866a981708350d4252b14b148100a5e1cfeeea90b

Pith citing papers

Observation 99570f57-ccfb-430b-9289-594ce0087fc7 · inbound

A recursive butterfly factorization with optimality guarantees cites this paper.

A recursive butterfly factorization with optimality guarantees Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-03T08:39:56.280803Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T08:39:56.280803Z digest=sha256:f9dfb145a64cd3514bd7476cf338c6811090d04a43790136a1a729c9aefc5714