Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-03T04:34:17.145884Z
Paper Citation Record · LEDGER
The matrix-vector complexity of $Ax=b$
As of 17 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 4 inbound Pith citation observations for arXiv:2602.04842.
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-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-28T21:16:08.912669Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-01T21:46:15.453878Z
Reference resolution
51 of 51 outbound references displayed
- verified exact13
- verified fuzzy0
- unresolved38
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation e8d40bf4-87e6-4820-96f8-94ac9d96db16 · outbound
This paper cites Fixed-sparsity matrix approximation from matrix-vector products.
The matrix-vector complexity of $Ax=b$ Fixed-sparsity matrix approximation from matrix-vector products
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:12.679722Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 80aebd33-9b2c-4a3a-bd5f-ff1e73d6e602 · outbound
This paper cites On the rate of convergence of the preconditioned conjugate gradient method.
The matrix-vector complexity of $Ax=b$ On the rate of convergence of the preconditioned conjugate gradient method
Reference 2
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.924749Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c7dfa6da-3a0a-4c02-8d62-b699b49f3909 · outbound
This paper cites Clarkson, and David P.
The matrix-vector complexity of $Ax=b$ Clarkson, and David P
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:12.904062Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ba22d9b8-0a93-4485-a361-b763d8d40244 · outbound
This paper cites Otto, and Alex Townsend.
The matrix-vector complexity of $Ax=b$ Otto, and Alex Townsend
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.018659Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0fdcbd5d-7b28-4afe-b9ec-a0ac373cada7 · outbound
This paper cites The gradient complexity of linear regression.
The matrix-vector complexity of $Ax=b$ The gradient complexity of linear regression
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.077801Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d569143f-3024-43a8-bd7e-7833981d9f4e · outbound
This paper cites Krylov methods are (nearly) optimal for low-rank approximation.
The matrix-vector complexity of $Ax=b$ Krylov methods are (nearly) optimal for low-rank approximation
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.148084Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c01d55a5-5013-46dc-be1c-e5c917fc4209 · outbound
This paper cites Convex Optimization.
The matrix-vector complexity of $Ax=b$ Convex Optimization
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.217615Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9bed7873-c50a-4caa-a51a-f84f290860aa · outbound
This paper cites an unresolved cited work.
The matrix-vector complexity of $Ax=b$ Unresolved cited work
Reference 8
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.840357Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3b8d3e57-63b5-4562-abdd-141437cd9c24 · outbound
This paper cites Query lower bounds for log-concave sampling.
The matrix-vector complexity of $Ax=b$ Query lower bounds for log-concave sampling
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.358341Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d8f0fd37-b68f-42b6-a6d9-a4e0b69202fb · outbound
This paper cites Clarkson and David P.
The matrix-vector complexity of $Ax=b$ Clarkson and David P
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.418381Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 498ec5d0-4f7e-4611-86d1-64f72a36ad50 · outbound
This paper cites Clarkson and David P.
The matrix-vector complexity of $Ax=b$ Clarkson and David P
Reference 11
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.730958Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8cf23252-f507-4dfe-8552-ad7f805afea6 · outbound
This paper cites DeVore and George G.
The matrix-vector complexity of $Ax=b$ DeVore and George G
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.561518Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7f5d84cf-126c-47bb-a06c-3b1e252861bb · outbound
This paper cites Fine-grained analysis and faster algorithms for iteratively solving linear systems.
The matrix-vector complexity of $Ax=b$ Fine-grained analysis and faster algorithms for iteratively solving linear systems
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.634367Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f40932cd-6849-4974-bde1-134885e8ea17 · outbound
This paper cites Recent and upcoming developments in randomized numerical linear algebra for machine learning.
The matrix-vector complexity of $Ax=b$ Recent and upcoming developments in randomized numerical linear algebra for machine learning
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.687125Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d52926e9-104b-4bc8-817c-a63df3328390 · outbound
This paper cites The total variation distance between high-dimensional Gaussians with the same mean.
The matrix-vector complexity of $Ax=b$ The total variation distance between high-dimensional Gaussians with the same mean
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.754362Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9965713f-9e82-4f25-b5f3-7c1eeafc88b7 · outbound
This paper cites Faster linear systems and matrix norm approximation via multi-level sketched preconditioning.
The matrix-vector complexity of $Ax=b$ Faster linear systems and matrix norm approximation via multi-level sketched preconditioning
Reference 16
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.628073Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c907de89-a7b1-437a-93fa-baf45804cc34 · outbound
This paper cites Approaching optimality for solving dense linear systems with low-rank structure.
The matrix-vector complexity of $Ax=b$ Approaching optimality for solving dense linear systems with low-rank structure
Reference 17
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.501891Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 7a2ef7c2-12fb-45d3-b1f6-56c298f69528 · outbound
This paper cites Driscoll, Kim-Chuan Toh, and Lloyd N.
The matrix-vector complexity of $Ax=b$ Driscoll, Kim-Chuan Toh, and Lloyd N
Reference 18
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:13.944964Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c1170b89-8053-4f30-b786-b6cb24511cc1 · outbound
This paper cites Solving dense linear systems faster than via preconditioning.
The matrix-vector complexity of $Ax=b$ Solving dense linear systems faster than via preconditioning
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.009052Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2a6cd55c-482a-46bf-8628-78958fe9f6cb · outbound
This paper cites an unresolved cited work.
The matrix-vector complexity of $Ax=b$ Unresolved cited work
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.063498Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 88238f96-243c-4c33-8078-10c0cc07f2e0 · outbound
This paper cites Un algorithme simple et rapide pour la validation croisée généralisée sur des problèmes de grande taille.
The matrix-vector complexity of $Ax=b$ Un algorithme simple et rapide pour la validation croisée généralisée sur des problèmes de grande taille
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.137746Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 711bd8b1-7f7c-4551-85f4-46931c6e8f44 · outbound
This paper cites Iterative Methods for Solving Linear Systems.
The matrix-vector complexity of $Ax=b$ Iterative Methods for Solving Linear Systems
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.216509Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1e01c985-9846-478c-938e-b5ee0c93093b · outbound
This paper cites Structured Matrix Recovery and Approximation from Matrix-Vector Products.
The matrix-vector complexity of $Ax=b$ Structured Matrix Recovery and Approximation from Matrix-Vector Products
Reference 23
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.275435Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d6ca5db6-038b-43f3-af35-c51394eb0a58 · outbound
This paper cites Harrow, Avinatan Hassidim, and Seth Lloyd.
The matrix-vector complexity of $Ax=b$ Harrow, Avinatan Hassidim, and Seth Lloyd
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.491540Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 79ad4b69-b6c1-4204-9e0e-24eb53ce44ed · outbound
This paper cites Optimal sketching for trace estimation.
The matrix-vector complexity of $Ax=b$ Optimal sketching for trace estimation
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.686472Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0b77ca25-6b4a-44a1-93c5-8ba1d2edc5c9 · outbound
This paper cites Polynomial of best uniform approximation to $x^{-1}$ and smoothing in two-level methods.
The matrix-vector complexity of $Ax=b$ Polynomial of best uniform approximation to $x^{-1}$ and smoothing in two-level methods
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.810741Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 65452f33-16d2-442b-92d8-2dd0f7a9bc9a · outbound
This paper cites Markov Chains and Mixing Times , volume 107.
The matrix-vector complexity of $Ax=b$ Markov Chains and Mixing Times , volume 107
Reference 27
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:14.963856Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e19c56d9-a430-4e56-b359-03f71b491236 · outbound
This paper cites Meyer and Haim Avron.
The matrix-vector complexity of $Ax=b$ Meyer and Haim Avron
Reference 28
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.364747Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8bf8cef5-acce-499b-a036-0cc2c4d78139 · outbound
This paper cites Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software.
The matrix-vector complexity of $Ax=b$ Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:15.175481Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7ffda6e9-2f71-475d-8b24-6e508b812c7e · outbound
This paper cites Towards Optimal Matrix-Vector Complexity in Numerical Linear Algebra.
The matrix-vector complexity of $Ax=b$ Towards Optimal Matrix-Vector Complexity in Numerical Linear Algebra
Reference 30
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:15.324400Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c7311973-e4f5-4cd3-ad21-f6ebeee4c66d · outbound
This paper cites Geometric median and robust estimation in Banach spaces.
The matrix-vector complexity of $Ax=b$ Geometric median and robust estimation in Banach spaces
Reference 31
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:15.347258Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0ca9580f-60dc-4fa3-8835-1d98de774f9e · outbound
This paper cites Meyer, Cameron Musco, Christoper Musco, and David P.
The matrix-vector complexity of $Ax=b$ Meyer, Cameron Musco, Christoper Musco, and David P
Reference 32
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.210157Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 87408401-3c62-4220-aef3-01d9cb6fc562 · outbound
This paper cites Randomized Algorithms.
The matrix-vector complexity of $Ax=b$ Randomized Algorithms
Reference 33
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:15.542270Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f89313be-4053-4f5d-9d30-6e2747a06931 · outbound
This paper cites Foundations of Machine Learning.
The matrix-vector complexity of $Ax=b$ Foundations of Machine Learning
Reference 34
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:15.625622Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a2a72a0a-1cc5-4117-93a0-7626c4da7935 · outbound
This paper cites an unresolved cited work.
The matrix-vector complexity of $Ax=b$ Unresolved cited work
Reference 35
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:15.724202Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 70f8dfb6-f233-4662-a5b4-a5790d235111 · outbound
This paper cites Musco and D.
The matrix-vector complexity of $Ax=b$ Musco and D
Reference 36
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:31.090592Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f6123755-79bf-4dfe-b64d-fdb6c8d56851 · outbound
This paper cites Nachtigal, Satish C.
The matrix-vector complexity of $Ax=b$ Nachtigal, Satish C
Reference 37
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:30.989037Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation a957eba5-d25a-49c6-9b08-ef4111049151 · outbound
This paper cites Problem Complexity and Method Efficiency in Optimization.
The matrix-vector complexity of $Ax=b$ Problem Complexity and Method Efficiency in Optimization
Reference 38
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.054610Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d88be3bd-ace9-4ea1-bec4-86aa902515cb · outbound
This paper cites Paige and Michael A.
The matrix-vector complexity of $Ax=b$ Paige and Michael A
Reference 39
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.167093Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4ba5402a-b95b-4d74-ba55-adfe0e792389 · outbound
This paper cites an unresolved cited work.
The matrix-vector complexity of $Ax=b$ Unresolved cited work
Reference 40
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:30.925678Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation a2372946-0879-476b-94b0-0d820d2d0f6f · outbound
This paper cites an unresolved cited work.
The matrix-vector complexity of $Ax=b$ Unresolved cited work
Reference 41
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.384761Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 327a83d1-5fe9-43f0-9763-b348d3d4d787 · outbound
This paper cites Rácz and Jacob Richey.
The matrix-vector complexity of $Ax=b$ Rácz and Jacob Richey
Reference 42
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:30.760245Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation be1dd6db-cfa6-4c60-9727-829945b81200 · outbound
This paper cites A fast randomized algorithm for overdetermined linear least-squares regression.
The matrix-vector complexity of $Ax=b$ A fast randomized algorithm for overdetermined linear least-squares regression
Reference 43
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:30.683665Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f5523e6e-678b-40b5-9a73-e7fd7c5971ea · outbound
This paper cites Tight query complexity lower bounds for PCA via finite sample deformed Wigner law.
The matrix-vector complexity of $Ax=b$ Tight query complexity lower bounds for PCA via finite sample deformed Wigner law
Reference 44
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.634765Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation dee63a1a-7f1a-4578-a5a7-1962b264b991 · outbound
This paper cites Solve for x: Technical perspective.
The matrix-vector complexity of $Ax=b$ Solve for x: Technical perspective
Reference 45
- Resolution
- verified exact
- doi, observed 2026-08-03T04:38:30.588625Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d536dc64-2a9b-4211-ab89-ccee41b12ace · outbound
This paper cites an unresolved cited work.
The matrix-vector complexity of $Ax=b$ Unresolved cited work
Reference 46
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.824752Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9d12314c-4a56-459c-b12a-87e6dda31bdc · outbound
This paper cites Spielman and Shang-Hua Teng.
The matrix-vector complexity of $Ax=b$ Spielman and Shang-Hua Teng
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.873342Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ca6901f5-71b6-49c1-9d01-f3b9111b979c · outbound
This paper cites an unresolved cited work.
The matrix-vector complexity of $Ax=b$ Unresolved cited work
Reference 48
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.946922Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f6393b9a-dffb-4fe7-8504-528bc6a9b3fa · outbound
This paper cites Optimal query complexities for dynamic trace estimation.
The matrix-vector complexity of $Ax=b$ Optimal query complexities for dynamic trace estimation
Reference 49
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:16.995942Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 470912ae-aa4e-4419-b6c7-4bf455f0a0e7 · outbound
This paper cites Divide and conquer kernel ridge regression.
The matrix-vector complexity of $Ax=b$ Divide and conquer kernel ridge regression
Reference 50
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:17.067085Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 03eb28c6-9828-4201-acc6-dc481b55e499 · outbound
This paper cites write newline.
The matrix-vector complexity of $Ax=b$ write newline
Reference 51
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T04:34:17.145884Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
Observation 03f1dd1d-4658-421e-bfb9-3e8112716e35 · inbound
Towards Universal Convergence of Backward Error in Linear System Solvers cites this paper.
Towards Universal Convergence of Backward Error in Linear System Solvers The matrix-vector complexity of $Ax=b$
Reference 12
- Resolution
- verified exact
- arxiv_id, observed 2026-07-13T01:17:56.484549Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation a9600f98-2f86-4ac2-9f9e-961951b5ee7e · inbound
Well-Conditioned Oblivious Perturbations in Linear Space cites this paper.
Well-Conditioned Oblivious Perturbations in Linear Space The matrix-vector complexity of $Ax=b$
Reference 23
- Resolution
- verified exact
- arxiv_id, observed 2026-07-13T01:17:56.484549Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation cb98014a-a725-4635-a350-342d2d1211b1 · inbound
Spectral density estimation for normal matrices cites this paper.
Spectral density estimation for normal matrices The matrix-vector complexity of $Ax=b$
Reference 15
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-07-13T01:17:56.484549Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 70038df9-c31a-4a16-9fc7-35cf8bff3e1e · inbound
Transpose-free linear algebra cites this paper.
Transpose-free linear algebra The matrix-vector complexity of $Ax=b$
Reference 26
- Resolution
- verified exact
- arxiv_id, observed 2026-07-13T01:17:56.484549Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.