{"as_of":"2026-08-17T13:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a3bef1bc9bfc2e00ebca4f48ab2c92ac7dfc4f183075f1eaec9f6b76eaa59575","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T04:34:17.145884Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T21:16:08.912669Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T21:46:15.453878Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"cited_work":{"arxiv_id":"2602.04842","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.04842","snapshot_observed_at":"2026-07-13T01:17:56.484549Z","title":"Derezi \\'n ski, E","venue":null,"work_id":"36d564e9-def2-465a-9f3f-36498e51024e","year":2026},"citing_paper":{"arxiv_id":"2604.16075","last_updated":"2026-05-22T19:35:55Z","snapshot_observed_at":"2026-08-13T22:26:35.075628Z","submitted_at":"2026-04-17T14:00:57Z","title":"Towards Universal Convergence of Backward Error in Linear System Solvers","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-10T08:11:05.393650Z"},"links":{"cited_paper":"/paper/2602.04842","citing_paper":"/paper/2604.16075"},"observation_digest":"sha256:da29dc9178b2af16db9c844c6b2743431488754f11c1b5116931ee047f65a16c","observation_id":"03f1dd1d-4658-421e-bfb9-3e8112716e35","resolution":{"observed_at":"2026-07-13T01:17:56.484549Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"cited_work":{"arxiv_id":"2602.04842","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.04842","snapshot_observed_at":"2026-07-13T01:17:56.484549Z","title":"Derezi \\'n ski, E","venue":null,"work_id":"36d564e9-def2-465a-9f3f-36498e51024e","year":2026},"citing_paper":{"arxiv_id":"2604.23193","last_updated":"2026-04-25T07:54:23Z","snapshot_observed_at":"2026-08-16T06:56:20.368683Z","submitted_at":"2026-04-25T07:54:23Z","title":"Well-Conditioned Oblivious Perturbations in Linear Space","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T07:30:11.047684Z"},"links":{"cited_paper":"/paper/2602.04842","citing_paper":"/paper/2604.23193"},"observation_digest":"sha256:aa2a0cad953dfaa9bb3ea0c54ec9e83dd97d99b3173c09cb84834a6b7cf1c4dc","observation_id":"a9600f98-2f86-4ac2-9f9e-961951b5ee7e","resolution":{"observed_at":"2026-07-13T01:17:56.484549Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"cited_work":{"arxiv_id":"2602.04842","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.04842","snapshot_observed_at":"2026-07-13T01:17:56.484549Z","title":"Derezi \\'n ski, E","venue":null,"work_id":"36d564e9-def2-465a-9f3f-36498e51024e","year":2026},"citing_paper":{"arxiv_id":"2605.31430","last_updated":"2026-05-29T15:26:39Z","snapshot_observed_at":"2026-08-15T16:07:38.777217Z","submitted_at":"2026-05-29T15:26:39Z","title":"Spectral density estimation for normal matrices","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T21:16:08.912669Z"},"links":{"cited_paper":"/paper/2602.04842","citing_paper":"/paper/2605.31430"},"observation_digest":"sha256:d500e95864bba881334144537892a2a72adfa0deb16ce5da37556630576fbb45","observation_id":"cb98014a-a725-4635-a350-342d2d1211b1","resolution":{"observed_at":"2026-07-13T01:17:56.484549Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"cited_work":{"arxiv_id":"2602.04842","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.04842","snapshot_observed_at":"2026-07-13T01:17:56.484549Z","title":"Derezi \\'n ski, E","venue":null,"work_id":"36d564e9-def2-465a-9f3f-36498e51024e","year":2026},"citing_paper":{"arxiv_id":"2606.01335","last_updated":"2026-05-31T16:38:43Z","snapshot_observed_at":"2026-08-14T18:12:33.887819Z","submitted_at":"2026-05-31T16:38:43Z","title":"Transpose-free linear algebra","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T16:22:10.159728Z"},"links":{"cited_paper":"/paper/2602.04842","citing_paper":"/paper/2606.01335"},"observation_digest":"sha256:4cba3a1a1435329e18e34b2764bcddfdbe630e6099d5bb32c5095d5aeecd5d9c","observation_id":"70038df9-c31a-4a16-9fc7-35cf8bff3e1e","resolution":{"observed_at":"2026-07-13T01:17:56.484549Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.04842/citation-record","integrity":"/paper/2602.04842/integrity","json":"/paper/2602.04842/citation-record.json","paper":"/paper/2602.04842"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.09379","last_updated":"2024-03-26T15:14:22Z","snapshot_observed_at":"2026-08-16T14:18:32.885322Z","submitted_at":"2024-02-14T18:25:13Z","title":"Fixed-sparsity matrix approximation from matrix-vector products","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09379","snapshot_observed_at":"2026-08-03T04:34:12.679722Z","title":"Fixed-sparsity matrix approximation from matrix-vector products","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:12.679722Z"},"links":{"cited_paper":"/paper/2402.09379","citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:d410fdfc8de8d9000aa4035ea0554ea7b5aafff6b5b85d5cb24d076a5fba6da8","observation_id":"e8d40bf4-87e6-4820-96f8-94ac9d96db16","resolution":{"observed_at":"2026-08-03T04:34:12.679722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01389448","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the rate of convergence of the preconditioned conjugate gradient method","venue":"Numerische Mathematik","work_id":"2ec1591d-a94d-4c15-b0bd-624aeb6a844d","year":1986},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:12.813053Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:72700dce11dd99b2af0ee992d8db51312cefc83ee37c3133fd6131801d378104","observation_id":"80aebd33-9b2c-4a3a-bd5f-ff1e73d6e602","resolution":{"observed_at":"2026-08-03T04:38:31.924749Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:12.904062Z","title":"Clarkson, and David P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:12.904062Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:53c8d4d2d789ce026119a19e675f4f37f39919b3e8cd269e03528926a7937d60","observation_id":"c7dfa6da-3a0a-4c02-8d62-b699b49f3909","resolution":{"observed_at":"2026-08-03T04:34:12.904062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.018659Z","title":"Otto, and Alex Townsend","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.018659Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:a21acfa14f9aeae35024de904cd30d179f186ba899c05b7370ebd13aabc45467","observation_id":"ba22d9b8-0a93-4485-a361-b763d8d40244","resolution":{"observed_at":"2026-08-03T04:34:13.018659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.077801Z","title":"The gradient complexity of linear regression","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.077801Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:3dbc5b6774c3b0747b99751b02b7560360b2d018a876661a4c9139543a7f2f0a","observation_id":"0fdcbd5d-7b28-4afe-b9ec-a0ac373cada7","resolution":{"observed_at":"2026-08-03T04:34:13.077801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.148084Z","title":"Krylov methods are (nearly) optimal for low-rank approximation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.148084Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:a36b4563979c7e2c15bd6fa7487ad7fbd4159909588b3757a28d0725ee23de5b","observation_id":"d569143f-3024-43a8-bd7e-7833981d9f4e","resolution":{"observed_at":"2026-08-03T04:34:13.148084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.217615Z","title":"Convex Optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.217615Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:e18ea32512a5dd9a0e1190234f5828dfa6dfab3a1f66dbb5f9c1a7c1828cd827","observation_id":"c01d55a5-5013-46dc-be1c-e5c917fc4209","resolution":{"observed_at":"2026-08-03T04:34:13.217615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/9781638281016","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"f48c175d-3403-40bc-ad87-68e5c38c3a8d","year":2022},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.293532Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:a6319776786cbca5d2814a1305cde4f23bcca1ad168f1aef77c6734b0f6cf943","observation_id":"9bed7873-c50a-4caa-a51a-f84f290860aa","resolution":{"observed_at":"2026-08-03T04:38:31.840357Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.358341Z","title":"Query lower bounds for log-concave sampling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.358341Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:be1104541bf6e856eb3a8427a27af0119f04a825fd154bb6fb0b878aaaebc667","observation_id":"3b8d3e57-63b5-4562-abdd-141437cd9c24","resolution":{"observed_at":"2026-08-03T04:34:13.358341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.418381Z","title":"Clarkson and David P","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.418381Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:96a91730d9e0563ef5476c7099d2a8ff7e6deed1aa7bd9ebcc43dec29090489f","observation_id":"d8f0fd37-b68f-42b6-a6d9-a4e0b69202fb","resolution":{"observed_at":"2026-08-03T04:34:13.418381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3019134","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clarkson and David P","venue":"Journal of the ACM","work_id":"f16edcb0-5129-42df-b2f7-83deb0b0852a","year":2017},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.496947Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:ba8afa08264e97e52776e9e3899dea7b7027a63b9501aa1af2a4bb3a26cd34fb","observation_id":"498ec5d0-4f7e-4611-86d1-64f72a36ad50","resolution":{"observed_at":"2026-08-03T04:38:31.730958Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.561518Z","title":"DeVore and George G","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.561518Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:32917380d013a54a36e10d120658ccb5951e9ebaf346ce3673461a8de90abd4e","observation_id":"8cf23252-f507-4dfe-8552-ad7f805afea6","resolution":{"observed_at":"2026-08-03T04:34:13.561518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.634367Z","title":"Fine-grained analysis and faster algorithms for iteratively solving linear systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.634367Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:a01212702ff3dd88054f41998316f1f79fdcdff4c04f5acd39e583ab62865fb9","observation_id":"7f5d84cf-126c-47bb-a06c-3b1e252861bb","resolution":{"observed_at":"2026-08-03T04:34:13.634367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.687125Z","title":"Recent and upcoming developments in randomized numerical linear algebra for machine learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.687125Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:88d549a8526f56d7449ed9603f7f216f8488543abbf3b135b9d27adac5376de9","observation_id":"f40932cd-6849-4974-bde1-134885e8ea17","resolution":{"observed_at":"2026-08-03T04:34:13.687125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.08693","last_updated":"2023-10-22T20:59:12Z","snapshot_observed_at":"2026-08-14T18:11:56.849602Z","submitted_at":"2018-10-19T21:38:06Z","title":"The total variation distance between high-dimensional Gaussians with the same mean","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.08693","snapshot_observed_at":"2026-08-03T04:34:13.754362Z","title":"The total variation distance between high-dimensional Gaussians with the same mean","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.754362Z"},"links":{"cited_paper":"/paper/1810.08693","citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:8f3ff84734fdfd2cc70fcb09cf880ffecdf5b136ea6edd75c101579a9d569380","observation_id":"d52926e9-104b-4bc8-817c-a63df3328390","resolution":{"observed_at":"2026-08-03T04:34:13.754362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.62","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Faster linear systems and matrix norm approximation via multi-level sketched preconditioning","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"35c9e048-810e-48c5-8440-fc99e6feb642","year":2025},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.809306Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:109ca0d60415437876c48e03af04dddb2398839a05093d4ced716e511346f3fb","observation_id":"9965713f-9e82-4f25-b5f3-7c1eeafc88b7","resolution":{"observed_at":"2026-08-03T04:38:31.628073Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978971.37","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approaching optimality for solving dense linear systems with low-rank structure","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"970ccb86-c87a-4919-89ac-4b16f999a40e","year":2026},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.888358Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:7b130ad3ace966a379b59c4454e9b10f96038251be14d948860cc96e15c15dc8","observation_id":"c907de89-a7b1-437a-93fa-baf45804cc34","resolution":{"observed_at":"2026-08-03T04:38:31.501891Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:13.944964Z","title":"Driscoll, Kim-Chuan Toh, and Lloyd N","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:13.944964Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:0c9670236822d9c91b286fc5646d2eb683bd08c66f08b50c09a34e837353d1ce","observation_id":"7a2ef7c2-12fb-45d3-b1f6-56c298f69528","resolution":{"observed_at":"2026-08-03T04:34:13.944964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.009052Z","title":"Solving dense linear systems faster than via preconditioning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.009052Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:a51de9a9bf19412b80c88979464a475905e0284c8e27167fed6d6597b6af3e12","observation_id":"c1170b89-8053-4f30-b786-b6cb24511cc1","resolution":{"observed_at":"2026-08-03T04:34:14.009052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.063498Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.063498Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:5656f8609de5ed0668476043f04fec99148ffacc3364fe929b942662f8e45048","observation_id":"2a6cd55c-482a-46bf-8628-78958fe9f6cb","resolution":{"observed_at":"2026-08-03T04:34:14.063498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.137746Z","title":"Un algorithme simple et rapide pour la validation croisée généralisée sur des problèmes de grande taille","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.137746Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:26a67283a0abebceeb2d21686642e1aec532c2d4642196f2fa7ce9ffe6e26b93","observation_id":"88238f96-243c-4c33-8078-10c0cc07f2e0","resolution":{"observed_at":"2026-08-03T04:34:14.137746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.216509Z","title":"Iterative Methods for Solving Linear Systems","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.216509Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:49b632a241b81321601d76fc1d34737cab16c5e842080569508f9bafad2aa9c8","observation_id":"711bd8b1-7f7c-4551-85f4-46931c6e8f44","resolution":{"observed_at":"2026-08-03T04:34:14.216509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.275435Z","title":"Structured Matrix Recovery and Approximation from Matrix-Vector Products","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.275435Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:c389fa06c6d5a487a2b6c270e5fe11942ad2417fd350b8b52bc12dccda8ab72f","observation_id":"1e01c985-9846-478c-938e-b5ee0c93093b","resolution":{"observed_at":"2026-08-03T04:34:14.275435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.491540Z","title":"Harrow, Avinatan Hassidim, and Seth Lloyd","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.491540Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:7677d4d4affe268818a89c6f06b0e547147c49623612b28375a6c8b0428d0dbd","observation_id":"d6ca5db6-038b-43f3-af35-c51394eb0a58","resolution":{"observed_at":"2026-08-03T04:34:14.491540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.686472Z","title":"Optimal sketching for trace estimation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.686472Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:1438cb41fc156f341248241a52cfc4996339e4f39db07af6bc3ca0596ccdcfc3","observation_id":"79ad4b69-b6c1-4204-9e0e-24eb53ce44ed","resolution":{"observed_at":"2026-08-03T04:34:14.686472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1002.1859","last_updated":"2012-05-23T15:29:11Z","snapshot_observed_at":"2026-08-15T05:27:01.091645Z","submitted_at":"2010-02-09T13:55:49Z","title":"Polynomial of best uniform approximation to $x^{-1}$ and smoothing in two-level methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1002.1859","snapshot_observed_at":"2026-08-03T04:34:14.810741Z","title":"Kraus, Panayot S","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.810741Z"},"links":{"cited_paper":"/paper/1002.1859","citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:0104cfd401c17dbf888225cca8c78c821c879eee5e2fe1008e2aef1752f3b1af","observation_id":"0b77ca25-6b4a-44a1-93c5-8ba1d2edc5c9","resolution":{"observed_at":"2026-08-03T04:34:14.810741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:14.963856Z","title":"Markov Chains and Mixing Times , volume 107","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:14.963856Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:fb81eda67f2b98ec3c17ae27df4751c8e060e0581b118f9c302a6eb6113918af","observation_id":"65452f33-16d2-442b-92d8-2dd0f7a9bc9a","resolution":{"observed_at":"2026-08-03T04:34:14.963856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/23m1595180","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:38:31.221213Z","title":"Meyer and Haim Avron","venue":null,"work_id":"d54ef771-9c2f-43b8-bb4e-347282904ddb","year":2026},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.101485Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:cddbe1b0f53fff7e34abd3141c4e78dae1d12dc6fc5ddfa9526b1cfdbb38a626","observation_id":"e19c56d9-a430-4e56-b359-03f71b491236","resolution":{"observed_at":"2026-08-03T04:38:31.364747Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11474","last_updated":"2023-04-12T20:56:40Z","snapshot_observed_at":"2026-08-16T15:53:29.833514Z","submitted_at":"2023-02-22T16:21:37Z","title":"Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11474","snapshot_observed_at":"2026-08-03T04:34:15.175481Z","title":"Randomized numerical linear algebra: A perspective on the field with an eye to software","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.175481Z"},"links":{"cited_paper":"/paper/2302.11474","citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:92f4bfc364ce3a8bbd485af29f7821bec7be9ac2245e6f5a0ac16472c4150691","observation_id":"8bf8cef5-acce-499b-a036-0cc2c4d78139","resolution":{"observed_at":"2026-08-03T04:34:15.175481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:15.324400Z","title":"Towards Optimal Matrix-Vector Complexity in Numerical Linear Algebra","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.324400Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:1aad1f7005091ff4fb83747d11f5962e31d6cfc2cdaebb696472846654ae6f81","observation_id":"7ffda6e9-2f71-475d-8b24-6e508b812c7e","resolution":{"observed_at":"2026-08-03T04:34:15.324400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:15.347258Z","title":"Geometric median and robust estimation in Banach spaces","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.347258Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:d0893bdb91d898a031dee9b9111adac043159eff19c6090eb2bef341c0425b88","observation_id":"c7311973-e4f5-4cd3-ad21-f6ebeee4c66d","resolution":{"observed_at":"2026-08-03T04:34:15.347258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976496","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Meyer, Cameron Musco, Christoper Musco, and David P","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"f4510b8d-0cbe-478b-b556-41a3ec3a31a6","year":2021},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.436540Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:dfdf88ca8206308dcc870b68a2dc9ed19e3f5f6226f67b474b209e8dc26b2b94","observation_id":"0ca9580f-60dc-4fa3-8835-1d98de774f9e","resolution":{"observed_at":"2026-08-03T04:38:31.210157Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:15.542270Z","title":"Randomized Algorithms","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.542270Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:0c5ed154bb0a7f1009b4403bf728d1ca23170d18eeb851db4212ca690e58b8c6","observation_id":"87408401-3c62-4220-aef3-01d9cb6fc562","resolution":{"observed_at":"2026-08-03T04:34:15.542270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:15.625622Z","title":"Foundations of Machine Learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.625622Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:713cc2811257812bdefd03316b752af3bdfa616846cb1228b24449585e3564cb","observation_id":"f89313be-4053-4f5d-9d30-6e2747a06931","resolution":{"observed_at":"2026-08-03T04:34:15.625622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:15.724202Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.724202Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:3f72cb8fbd6146841dc6c010379e1a6e2f5736e7fa5d9bb1d4141d0868d22f75","observation_id":"a2a72a0a-1cc5-4117-93a0-7626c4da7935","resolution":{"observed_at":"2026-08-03T04:34:15.724202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2017.68","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Musco and D","venue":null,"work_id":"0db6fe2b-8251-4770-a4e1-d6babdd24fee","year":2017},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.805795Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:f878f9788e52e6f568803bb556953552d15c45e16beab9c625118119bb5b271b","observation_id":"70f8dfb6-f233-4662-a5b4-a5790d235111","resolution":{"observed_at":"2026-08-03T04:38:31.090592Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0613049","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Nachtigal, Satish C","venue":"SIAM Journal on Matrix Analysis and Applications","work_id":"1bbe96a8-ca07-4da7-9d43-002b3f319a5b","year":1992},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:15.934997Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:e611a8c059260e8813d77f7903b0080427f027ca056ddcdcdf0c5ff81e693789","observation_id":"f6123755-79bf-4dfe-b64d-fdb6c8d56851","resolution":{"observed_at":"2026-08-03T04:38:30.989037Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.054610Z","title":"Problem Complexity and Method Efficiency in Optimization","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.054610Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:659741803fc21a93859b3dc26afbbaca7d53a3ec1171c45297c19e3597050a35","observation_id":"a957eba5-d25a-49c6-9b08-ef4111049151","resolution":{"observed_at":"2026-08-03T04:34:16.054610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.167093Z","title":"Paige and Michael A","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.167093Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:a75eb69cc31f9ff83e062c91a6be9be509394d16d18ca68021fb0af18367a8d7","observation_id":"d88be3bd-ace9-4ea1-bec4-86aa902515cb","resolution":{"observed_at":"2026-08-03T04:34:16.167093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3615679","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Communications of the ACM","work_id":"d3d40a63-1b44-45b5-997a-a358967498ce","year":2024},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.241096Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:b5a096ff2ae497907c07dc060ed34f97442426369777c8146031588d218d10f6","observation_id":"4ba5402a-b95b-4d74-ba55-adfe0e792389","resolution":{"observed_at":"2026-08-03T04:38:30.925678Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.384761Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.384761Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:441bd8656c88e04201ca2a7de675fb3b30a0e1bfe52ed5c95cec651096af13fc","observation_id":"a2372946-0879-476b-94b0-0d820d2d0f6f","resolution":{"observed_at":"2026-08-03T04:34:16.384761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10959-018-0808-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rácz and Jacob Richey","venue":"Journal of Theoretical Probability","work_id":"cda02f26-8dde-46fb-8227-0b34346b4ed2","year":2019},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.483049Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:efe6a4c4348d0fd7936744cd6239c1aad9d61f1680f2e676da6fbac813e300e7","observation_id":"327a83d1-5fe9-43f0-9763-b348d3d4d787","resolution":{"observed_at":"2026-08-03T04:38:30.760245Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1073/pnas.0804869105","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A fast randomized algorithm for overdetermined linear least-squares regression","venue":"Proceedings of the National Academy of Sciences","work_id":"076176a4-493a-4a5e-bfaa-56e5825c67bf","year":2008},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.556258Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:4ad2b7ba1b0fd5c1e739ca484776589c2a492ce090a5d36aefa81b401a1cf7e1","observation_id":"be1dd6db-cfa6-4c60-9727-829945b81200","resolution":{"observed_at":"2026-08-03T04:38:30.683665Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.634765Z","title":"Tight query complexity lower bounds for PCA via finite sample deformed Wigner law","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.634765Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:882706397acb40da010723fd439d76797d23687385ee8336e4c4d0018222e5c3","observation_id":"f5523e6e-678b-40b5-9a73-e7fd7c5971ea","resolution":{"observed_at":"2026-08-03T04:34:16.634765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3643835","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solve for x: Technical perspective","venue":"Communications of the ACM","work_id":"b1c76290-28e5-4a55-a8c6-219f70b5cff0","year":2024},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.736530Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:53d2905f28a59c3afe3d1cab0d1bcc320db29a642d53517c3427998be0fbfea0","observation_id":"dee63a1a-7f1a-4578-a5a7-1962b264b991","resolution":{"observed_at":"2026-08-03T04:38:30.588625Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.824752Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.824752Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:0c7a011733cb43641f7d6cad61498013ba345b6a5d417bf59db34d8798bcaebf","observation_id":"d536dc64-2a9b-4211-ab89-ccee41b12ace","resolution":{"observed_at":"2026-08-03T04:34:16.824752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.873342Z","title":"Spielman and Shang-Hua Teng","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.873342Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:e73fc434447de9dd723c03448bc63c43e3b8f1fb1af40046d7712f03a16162b7","observation_id":"9d12314c-4a56-459c-b12a-87e6dda31bdc","resolution":{"observed_at":"2026-08-03T04:34:16.873342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.946922Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.946922Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:49a363a6fb9104a9716e6949356210efeec28aaadcae271d56761f74cca21370","observation_id":"ca6901f5-71b6-49c1-9d01-f3b9111b979c","resolution":{"observed_at":"2026-08-03T04:34:16.946922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:16.995942Z","title":"Optimal query complexities for dynamic trace estimation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:16.995942Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:8c4a0a86b7a5a1934aa8f11f97b2f772584aba1bbde4a336929e995e2ad9ed12","observation_id":"f6393b9a-dffb-4fe7-8504-528bc6a9b3fa","resolution":{"observed_at":"2026-08-03T04:34:16.995942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:17.067085Z","title":"Divide and conquer kernel ridge regression","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:17.067085Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:3de47a77d416f8cda78fd5e86e15573fdd497712018ca1c10d7569a007d90fad","observation_id":"470912ae-aa4e-4419-b6c7-4bf455f0a0e7","resolution":{"observed_at":"2026-08-03T04:34:17.067085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:34:17.145884Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$","version":4},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-03T04:34:17.145884Z"},"links":{"citing_paper":"/paper/2602.04842"},"observation_digest":"sha256:dc3ceeeb405622d6171f13f31de4f5209d2f43b2f9264c96154c7bf9903cdcc1","observation_id":"03eb28c6-9828-4201-acc6-dc481b55e499","resolution":{"observed_at":"2026-08-03T04:34:17.145884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.04842","last_updated":"2026-07-21T22:32:26Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T16:06:58.503025Z","submitted_at":"2026-02-04T18:32:52Z","title":"The matrix-vector complexity of $Ax=b$"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":51},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"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."}