{"as_of":"2026-08-15T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bbb3dfb73948ea12cb0a245610d9153d5c3287001dd1ef8c3703e86e61fa4399","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:14:12.917160Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:18:31.142009Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T19:18:32.177254Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"cited_work":{"arxiv_id":"2507.11724","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.11724","snapshot_observed_at":"2026-08-15T19:18:32.177254Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","venue":"cs.DS","work_id":"1dee5f5a-3871-423b-b8a0-9db3298a29bc","year":2025},"citing_paper":{"arxiv_id":"2506.17556","last_updated":"2025-07-19T03:04:49Z","snapshot_observed_at":"2026-08-15T19:04:26.608136Z","submitted_at":"2025-06-21T02:50:37Z","title":"Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nystr\\\"om Method","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T19:18:31.142009Z"},"links":{"cited_paper":"/paper/2507.11724","citing_paper":"/paper/2506.17556"},"observation_digest":"sha256:2386e028d4ed2996be65cc8a03afd830b29766ab26a57549a718db50e3df5754","observation_id":"7a3216ad-bc63-4ab7-a83d-03ecab745535","resolution":{"observed_at":"2026-08-15T19:18:32.182510Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.11724/citation-record","integrity":"/paper/2507.11724/integrity","json":"/paper/2507.11724/citation-record.json","paper":"/paper/2507.11724"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.700392Z","title":"Leverage score sampling for faster accelerated regression and erm","venue":null,"work_id":"a18b6e21-91b3-4236-856d-05efc3eb528a","year":2020},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:07.787462Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:12bacc0f45c207b8bae43ba1c1863878149d04033032509cfc7f33b872a0a1b0","observation_id":"f0433b6a-ab8e-49b4-a832-9ee4539a0d0e","resolution":{"observed_at":"2026-08-06T17:14:16.704263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.689656Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods","venue":null,"work_id":"48e98897-8d7a-40fa-948c-d75e50d51912","year":2018},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:07.865682Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:55351f3c75d7b53722c3ecf4161382c2d645825dd97cf70d20b31990b3c5fb19","observation_id":"95ecb02d-82f0-4e78-ad79-f4cdf3a9e198","resolution":{"observed_at":"2026-08-06T17:14:16.693855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.679108Z","title":"More asymmetry yields faster matrix multiplication","venue":null,"work_id":"1e30f871-643f-4010-b73c-b9454cc0e3cb","year":2025},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:07.959615Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:7bc3e389ac11aa89eaa402919cb9bef170e07572d0fdfc17be3c6a8367727f33","observation_id":"4d5a5dfa-439b-457f-b5ac-ea1f8da0fe7f","resolution":{"observed_at":"2026-08-06T17:14:16.683091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.668620Z","title":"Faster kernel ridge regression using sketching and preconditioning","venue":null,"work_id":"263cd6a8-6a6b-48a3-838b-8466c4b8838d","year":2017},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.042230Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:1bdbfaa002ab415ace8ad7998feb01b2378f40a205998a58fe5e7b77739ce63e","observation_id":"9652fba1-4158-4b4b-9b1f-8e4cdfa15de9","resolution":{"observed_at":"2026-08-06T17:14:16.672443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.657846Z","title":"On the rate of convergence of the preconditioned conjugate gradient method","venue":null,"work_id":"2bbfb794-8f57-45e7-81aa-1bbe046db55a","year":1986},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.189046Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:037b72305db963db1ced6d2a0ea81a98fc51eb064c746685d659070fe4e9e8a9","observation_id":"cb65c687-5726-4341-995e-c98fcb8a23ab","resolution":{"observed_at":"2026-08-06T17:14:16.661480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.646507Z","title":"Optimal oblivious subspace embeddings with near-optimal sparsity","venue":null,"work_id":"34bde007-9df9-4d99-8e6d-500074dd906e","year":2025},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.274322Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:e2e78126bd1c886e64a999a59b73ca862caeee4be79776ddb913dee052b3af47","observation_id":"6b136cb3-a35d-49aa-a1d4-36a4f93e91de","resolution":{"observed_at":"2026-08-06T17:14:16.650807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.636216Z","title":"Optimal embedding dimension for sparse subspace embeddings","venue":null,"work_id":"cbdb1d65-bfa2-4bdc-8d8b-787f11bc7a2d","year":2024},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.373273Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:2679e1c86a7772c64cb5fa88b8156da4e89447889325fc7c86c4fee72ae03bfd","observation_id":"951fe63b-8c67-4fff-89f9-66c627af514f","resolution":{"observed_at":"2026-08-06T17:14:16.640054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.625591Z","title":"Clarkson and David P","venue":null,"work_id":"31a794b2-6bee-4518-83bf-d9225b1c0e8a","year":2017},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.451772Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:cf2fed4f57704bf97578c4297a6bf95ad58616177befc132e27e82ba090c4b96","observation_id":"0a7cb02c-6600-463b-a857-9cb59312914d","resolution":{"observed_at":"2026-08-06T17:14:16.629427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.615296Z","title":"Nearly tight oblivious subspace embeddings by trace inequalities","venue":null,"work_id":"4bc5a6c2-5ea4-4f1e-925f-04fe9cf0a8c5","year":2016},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.562007Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:71b98f6d84a2e8877a45372e92951783731e91fecb8fd9813b75792d8c45e430","observation_id":"08edd9b0-a319-4ca0-97ec-c3b6bf73efef","resolution":{"observed_at":"2026-08-06T17:14:16.618709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.604186Z","title":"Solving directed laplacian systems in nearly-linear time through sparse lu factorizations","venue":null,"work_id":"ab882383-aabf-45ad-9047-f1b5adfc4331","year":2018},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.639948Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:d59a81f7b4acf312ce997a59e3916812b8de2544c5889b9628371d52d04f24c0","observation_id":"bdb770af-c4ce-4fe9-b993-d8e1daed7622","resolution":{"observed_at":"2026-08-06T17:14:16.607757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.593919Z","title":"Cohen, Jonathan A","venue":null,"work_id":"381dd116-b3d6-4709-ad0f-bc0841a6752b","year":2017},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.715941Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:376bcf01cdd8af02c58ecd151caae9c89832612a57122a4bf6b94295aa786116","observation_id":"c943cbc6-d3af-47c6-9048-bdcbf64b4cff","resolution":{"observed_at":"2026-08-06T17:14:16.597201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.583435Z","title":"Cohen, Rasmus Kyng, Gary L","venue":null,"work_id":"e23bfc02-7792-43ee-871f-a9d16aae90db","year":2014},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.809392Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:536d27ddbe4aed6f33eedce7400c4cc3c0c07e9f9834f77c8debcdc41a68f056","observation_id":"3babb9ee-464d-4d26-8c09-c6e8a4b7260e","resolution":{"observed_at":"2026-08-06T17:14:16.587278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.571870Z","title":"Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford","venue":null,"work_id":"7c072627-0539-4d35-92b1-3f3556eb7821","year":2015},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.893583Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:4fdab2585533b539574018c7d9fa0853f74acd0e5c424214aa3d14552ed8b82a","observation_id":"04c12a4c-42fc-4156-966c-4e4e4603a12f","resolution":{"observed_at":"2026-08-06T17:14:16.576017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.561596Z","title":"Optimal approximate matrix product in terms of stable rank","venue":null,"work_id":"39a17157-8160-4405-a1a5-4746671db37c","year":2016},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:08.979042Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:0f28adbd46ddeb030f8406c01530ffbddbe92e271bb537c04a0613de75486fb9","observation_id":"79f274e0-96f1-413b-81a0-b4e60902b536","resolution":{"observed_at":"2026-08-06T17:14:16.564912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.551319Z","title":"Matrix multiplication via arithmetic progressions","venue":null,"work_id":"3f594b08-3bbe-4870-997c-c458246a30ab","year":1987},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.067498Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:fb25e0281c1a48a24049302f21eed8180dfed476c9055461901bcf417b623186","observation_id":"f389bd51-ae35-4784-9882-decd35dd6357","resolution":{"observed_at":"2026-08-06T17:14:16.555122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.541098Z","title":"Fast linear algebra is stable","venue":null,"work_id":"8a63d184-92d6-4e60-9f05-c97e6a4e0f08","year":2007},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.141708Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:e2a3e13b2aa7d17dd16c268dab73402ca645bf0732754b7303aa6dace162d471","observation_id":"842ff77a-6f31-4ffc-9402-883ad0ae3413","resolution":{"observed_at":"2026-08-06T17:14:16.544291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05818","last_updated":"2025-06-17T04:24:53Z","snapshot_observed_at":"2026-08-13T00:10:56.247918Z","submitted_at":"2024-05-09T14:56:49Z","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05818","snapshot_observed_at":"2026-08-06T17:14:09.209030Z","title":"Fine-grained analysis and faster algorithms for iteratively solving linear systems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.209030Z"},"links":{"cited_paper":"/paper/2405.05818","citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:bf0ad80df70ba3397f3af26aefd62811d5ad8c5d54d57ede37cccfa780cba38d","observation_id":"824a91fb-0045-4514-a4f6-0802691dc222","resolution":{"observed_at":"2026-08-06T17:14:09.209030Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.529742Z","title":"Faster linear systems and matrix norm approximation via multi-level sketched preconditioning.ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025","venue":null,"work_id":"23fb9bb5-9dc6-4450-89d6-9216f9f4b434","year":2025},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.289986Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:4f03430982bd364a1939b7e70633ccec676c5e1598c5a3e868b1ec41f90ae402","observation_id":"da285e59-688d-409d-8f6a-cd0030301fae","resolution":{"observed_at":"2026-08-06T17:14:16.534250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11673","last_updated":"2025-07-29T01:40:18Z","snapshot_observed_at":"2026-08-15T18:25:55.516777Z","submitted_at":"2025-01-20T18:55:51Z","title":"Randomized Kaczmarz Methods with Beyond-Krylov Convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11673","snapshot_observed_at":"2026-08-06T17:14:09.374465Z","title":"Randomized kaczmarz methods with beyond-krylov convergence","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.374465Z"},"links":{"cited_paper":"/paper/2501.11673","citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:5ee23feccf3f9b824f40c70e0ca6a0e2f835c07a17ea0242b2e37934c48c0741","observation_id":"0253e6df-d79a-4172-b0a0-81aea3809f53","resolution":{"observed_at":"2026-08-06T17:14:09.374465Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.518907Z","title":"Solving linear systems faster than via preconditioning","venue":null,"work_id":"b19a12df-17bf-4670-9a4a-19d9cfd3e09b","year":2024},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.440259Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:b24e9d933708473236887d1edea6e3356dca56502bc511bd50f3e9015586a43b","observation_id":"98f9c2b5-4aba-4fac-8ad2-61c10a617b0c","resolution":{"observed_at":"2026-08-06T17:14:16.522562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02820","last_updated":"2021-12-17T18:34:10Z","snapshot_observed_at":"2026-08-14T07:30:51.988149Z","submitted_at":"2021-10-06T14:46:16Z","title":"Randomized Nystr\\\"om Preconditioning","version":2},"cited_work":{"arxiv_id":"2110.02820","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.02820","snapshot_observed_at":"2026-08-06T17:14:13.107730Z","title":"Randomized Nystr\\\"om Preconditioning","venue":"math.NA","work_id":"8bb3fa6c-3e99-4938-b92b-21c175030628","year":2021},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.533910Z"},"links":{"cited_paper":"/paper/2110.02820","citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:a23346203bdfe975d919a0699338c10678af39c711a1e1b2c0cbf8723d4f5f85","observation_id":"17f16d86-011e-41da-bf73-c69928a600a6","resolution":{"observed_at":"2026-08-06T17:14:13.173364Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.508107Z","title":"Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization","venue":null,"work_id":"b0053028-0eb2-437e-9e24-20b6a3e0e337","year":2015},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.613905Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:ba62dc6877c51957dfd8336c9694c038cb77b89fccf903af3fb0516f233cf7e4","observation_id":"105a8e24-a6f7-4601-8130-87d044f4e5f2","resolution":{"observed_at":"2026-08-06T17:14:16.512036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.496592Z","title":"Principal component projection without principal component analysis","venue":null,"work_id":"8e76ca7c-fb92-4c89-a080-28d311a5ca66","year":null},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.688557Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:1bfd07e9a9b5c0983f7b02022df9cb0197ad9ed5ba05aacfdb1e3ccc123cbfd8","observation_id":"8aac9b4c-3a70-47c7-b829-39e2ed7b7f09","resolution":{"observed_at":"2026-08-06T17:14:16.501064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.485068Z","title":"Faster eigenvector computation via shift-and-invert preconditioning","venue":null,"work_id":"c364e245-2d77-42f8-813c-41fba8638a74","year":2016},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.760014Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:2ae7ffef35002c3f57ad26c73c29fde174c0f074eed14011e6d7c10dc3f12fbb","observation_id":"d7906b21-f634-4ea5-b8bd-2a6d418d2999","resolution":{"observed_at":"2026-08-06T17:14:16.489041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.475128Z","title":"Matrix computations","venue":null,"work_id":"0df002d6-2d35-4056-bdc4-2284fb99500e","year":2013},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.848243Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:975a3c65f9969a96b59f50bf6d5802ee901b488f8c7a629146279718530124e2","observation_id":"c3725bf0-4329-4095-8b1a-334271db75a8","resolution":{"observed_at":"2026-08-06T17:14:16.478330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.465129Z","title":"Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order richardson iterative methods","venue":null,"work_id":"62a046ea-5c77-4d6c-b330-81e8297209be","year":1961},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.947917Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:38b8c1645b40341bc8ce1411e4b8e5a33f52e93540591a644d3180e1460aebf8","observation_id":"36a69766-0b68-47a9-ac32-08ee7a04c24f","resolution":{"observed_at":"2026-08-06T17:14:16.468495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.454656Z","title":"Solving ridge regression using sketched preconditioned svrg","venue":null,"work_id":"272a1198-3d71-4cc8-b34b-c6d5cc699bd2","year":2016},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.024800Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:fb85d0c3ad1f69c342f22e0cf7e03eef00132bfd432b2487ad20a5ea2493b792","observation_id":"79266890-e2bc-4654-af7b-d84553ff6d60","resolution":{"observed_at":"2026-08-06T17:14:16.458331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.442839Z","title":"Behavior of slightly perturbed lanczos and conjugate-gradient recurrences","venue":null,"work_id":"d7070a27-5311-4e9b-a45a-aacbb85123cd","year":1989},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.102974Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:36d41c6b8898a94ac09e9b6f6b33fa77ba3634125d8d2043fbe3b4bca6f7eb83","observation_id":"52a47818-61b7-4e29-b61f-d1b1730006f2","resolution":{"observed_at":"2026-08-06T17:14:16.447147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.432468Z","title":"Methods of conjugate gradients for solving linear systems, volume 49","venue":null,"work_id":"52bbc68a-b109-4296-a2f6-be5eb83fbaeb","year":1952},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.186326Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:73811ecf324e107d4901bc71470146801cda086e548fc380eda26030fb873229","observation_id":"2fc8c636-502b-47a8-acfd-a552844de10f","resolution":{"observed_at":"2026-08-06T17:14:16.436173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.422173Z","title":"Gaussian elimination","venue":null,"work_id":"d9e561dc-5a20-4854-bc21-f96a7d6ae9da","year":2011},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.296655Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:e16424a69f861090d23f27f12ceb7aaaff4d81e5b8063f437293ec8e4471b961","observation_id":"7a784a8b-2d8b-4ba6-a2e6-88d537b19224","resolution":{"observed_at":"2026-08-06T17:14:16.425577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.410743Z","title":"Structured semidefinite programming for recovering structured preconditioners","venue":null,"work_id":"3bf46f28-56e1-4ae5-ada2-09462b567816","year":2023},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.376986Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:0fee5943c40938b649da06c3beee2e68b25ec05a2d5510f6389bd2c74e2bbf72","observation_id":"593fd0b7-7453-4a90-899a-658a0558e6bf","resolution":{"observed_at":"2026-08-06T17:14:16.415298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.400308Z","title":"Ultrasparse ultrasparsifiers and faster laplacian system solvers","venue":null,"work_id":"7f59b928-1e27-4c54-a0d2-d8cfab3b3457","year":2024},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.440396Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:51fc23ba7bcf439309bcf20a44d569d607d6d35bee8d687ec99a4e862c0a9f31","observation_id":"51155ddd-b9db-48ef-b806-9ac064107f7a","resolution":{"observed_at":"2026-08-06T17:14:16.404087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.388673Z","title":"Accelerating stochastic gradient descent using predictive variance reduc- tion","venue":null,"work_id":"c9d7646e-d583-47fa-837f-a2eabee2b8d8","year":2013},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.535923Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:06d2d905deed04bdb3766e3757afa20437257aa21b74e9b507af5c6d02cfb730","observation_id":"9722e25b-aa4c-43ba-8910-57ee61b43627","resolution":{"observed_at":"2026-08-06T17:14:16.392392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.378316Z","title":"Single pass spectral sparsification in dynamic streams","venue":null,"work_id":"ce6f9f9c-db58-43da-8728-650e1c80ba0a","year":2017},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.619295Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:233a12816ffad70e8cbd27083432182b1ed031375bda944407de6954566b2b34","observation_id":"a96e8c41-c8a8-4aaf-98e4-a12f8fe8d02f","resolution":{"observed_at":"2026-08-06T17:14:16.382131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.368711Z","title":"Miller, and Richard Peng","venue":null,"work_id":"14efca41-dd70-45db-8018-df884160acdc","year":2010},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.696391Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:2e5d20956d1b717c4a1cf7d9aa3d8d37eb4e78d84939ed69b1ea5d2958f0e9ff","observation_id":"f4886cd3-4875-4356-bdba-c8e6c81281ac","resolution":{"observed_at":"2026-08-06T17:14:16.372342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.358471Z","title":"Miller, and Richard Peng","venue":null,"work_id":"5d1e4554-a927-48ba-849f-81ab05f98ce5","year":2011},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.771379Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:83c8c6f61545545bee403da83c14806ea94c7c403b1b9d872d50a088efb2e29c","observation_id":"13d3ff89-7737-43c8-a75c-74dc558bb645","resolution":{"observed_at":"2026-08-06T17:14:16.362268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.348988Z","title":"Estimating the largest eigenvalue by the power and lanczos algorithms with a random start","venue":null,"work_id":"5b4fc1a8-a52e-45e0-8c8a-3f7c67d6d774","year":1992},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.915412Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:cbc6e4fbbc7706efa684b7971c32ab907596fdb4c7156081a36a35c6f1f19799","observation_id":"137c1f73-8156-4245-a20e-9b046798c64b","resolution":{"observed_at":"2026-08-06T17:14:16.352517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.334115Z","title":"Sparsified cholesky and multigrid solvers for connection laplacians","venue":null,"work_id":"ee5dfbea-905c-466e-8797-73b9fd475909","year":2016},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:10.995362Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:d26bc87001e555f7a1068a3e2d1ff6516d0679a039a0a71b056f31ab4d3cfb28","observation_id":"2567b221-bfac-44e6-abab-63ab424a0450","resolution":{"observed_at":"2026-08-06T17:14:16.343590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:14:11.078840Z","title":"Approximate gaussian elimination for laplacians-fast, sparse, and simple","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.078840Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:3f65b792866eb0268ae88b81947a83b586438d163f3249bad3e2c0069405ef4a","observation_id":"07ec86cc-c84d-4273-b781-ee0933092059","resolution":{"observed_at":"2026-08-06T17:14:11.078840Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.228386Z","title":"Faster algorithms for rectangular matrix multiplication","venue":null,"work_id":"239b16bf-eb04-4587-9313-508dbca65f5f","year":2012},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.154837Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:856956a5f5b1b39e94ade8d098e66ecf7569e2af810f4f2a2aac5a9146a4c701","observation_id":"ab0a6b2c-085f-4e27-86a1-f0974fa1a949","resolution":{"observed_at":"2026-08-06T17:14:16.268781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.117776Z","title":"Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems","venue":null,"work_id":"7bab8874-5511-4972-b90a-ec0df69ead56","year":2013},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.235991Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:28248eaf7a06537dba6f64d5f85fe3f1fea73aa2e0082c48c4e92a2c42f12b23","observation_id":"3d327eb1-773e-4e1d-864f-92b89a962a98","resolution":{"observed_at":"2026-08-06T17:14:16.169771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:16.003266Z","title":"Randomized methods for linear constraints: convergence rates and conditioning","venue":null,"work_id":"89c413b9-6cfe-4f95-8152-9dffe3be8252","year":2010},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.342674Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:77d31921b0723017bffed30879d66ef0f92ba28d40204672bd265220179d99fb","observation_id":"3195aa0d-c5a7-404d-ac63-e211aa61b7e1","resolution":{"observed_at":"2026-08-06T17:14:16.056494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:15.881469Z","title":"Miller, and Richard Peng","venue":null,"work_id":"a47d2a77-0e4d-408e-94f6-ed91ae8c5635","year":2013},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.394863Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:33dec55894b3da242c96b0d7cd63aaf10ec5efb94b8e30d7bcc4546801487e80","observation_id":"261ea882-66f7-48c3-9629-7f473443248c","resolution":{"observed_at":"2026-08-06T17:14:15.951501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:15.850181Z","title":"A universal catalyst for first-order optimization","venue":null,"work_id":"b21f6c49-228e-44e0-8435-05befe25d953","year":2015},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.474242Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:5241434a07f0ba2d3fd9467dc4673f30b6612ece8a3b8e28bfa954c2b136f63a","observation_id":"549893fa-7b24-4991-aeab-fb5b757956dc","resolution":{"observed_at":"2026-08-06T17:14:15.853314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:15.711874Z","title":"Stability of the lanczos method for matrix function approximation","venue":null,"work_id":"95fbeae6-60cd-4708-a0cf-ff62a547f98d","year":2018},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.559460Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:6fd777387e908b236c7093ad710920b4d3fdbb4ef6a3571d347101ec9b3577ec","observation_id":"6197efbe-74b2-4564-b368-a27f953498c1","resolution":{"observed_at":"2026-08-06T17:14:15.832308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:15.356221Z","title":"Spec- trum approximation beyond fast matrix multiplication: Algorithms and hardness","venue":null,"work_id":"62839f2d-8ff9-41ac-9e62-257fa03f32ad","year":2018},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.677329Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:b8068a98516672ae7b6c267d1099ba8487f26a0ab775d28816fe8ee53539ee46","observation_id":"5f78be97-236f-4a15-9bc5-5559ff960d02","resolution":{"observed_at":"2026-08-06T17:14:15.558071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.998722Z","title":"Nguyˆ en","venue":null,"work_id":"dc22e9f3-ce29-4c50-a8bc-af678686d92b","year":2013},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.746056Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:b2b8914d705e3166f3b91adc901745960f74baece2f37c8021a3487b0764de72","observation_id":"9888734c-0138-41f1-85f6-ec9baceb40f5","resolution":{"observed_at":"2026-08-06T17:14:15.204990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.627730Z","title":"Nesterov","venue":null,"work_id":"90a82e72-df51-4e54-8ec5-08fca563d5fe","year":2012},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.811393Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:55bcad2b2ef07eaf2f19cc8c8a92fe91d724ff05e48507cf86b02c89060a56e2","observation_id":"44064436-770d-4fbd-af3b-56d0ea4378c3","resolution":{"observed_at":"2026-08-06T17:14:14.786532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.607832Z","title":"Nesterov and Sebastian U","venue":null,"work_id":"74679c45-8b3d-46a1-98ef-6fa7910bc93c","year":2017},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.891653Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:da12fa66f694d3fd8e6d31c48254d594f2b327df1c012d2ded69b52be6473c01","observation_id":"87956472-9c75-451c-99f3-f1ca89ced0cb","resolution":{"observed_at":"2026-08-06T17:14:14.610650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.572787Z","title":"Algorithm Design Using Spectral Graph Theory","venue":null,"work_id":"14d6197b-57f8-46e3-b199-e0b180430333","year":2013},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:11.977772Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:b51c1c67a6ef94fe6f9326a10b90efb9b3980cb9363a6b1309bf41a718deca8a","observation_id":"57d74947-e8e2-418b-9612-d910515ef30a","resolution":{"observed_at":"2026-08-06T17:14:14.602882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.407680Z","title":"Sparsified block elimination for directed laplacians","venue":null,"work_id":"ddf0dd2c-f18f-4327-83c6-db0f49cc0265","year":2022},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.058571Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:d07aa9e7aab718ca139dfc45b220f4ba15ab448146b44938a3136e17caecdd2a","observation_id":"e3e7bb26-521d-46a0-abb7-2a798edc611c","resolution":{"observed_at":"2026-08-06T17:14:14.487937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.303669Z","title":"A fast randomized algorithm for overdetermined linear least-squares regression","venue":null,"work_id":"e341a7ff-82bd-4457-925b-4652122d0bf2","year":2008},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.135900Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:81454febea8c5d5d11dc0d6a359b0bc0ee646d7810ff17cd7bf5f4418972ac60","observation_id":"ad560075-89c7-4079-9c36-d7c571c4be6e","resolution":{"observed_at":"2026-08-06T17:14:14.362972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.177974Z","title":"Improved approximation algorithms for large matrices via random projections","venue":null,"work_id":"e4677193-6522-4ca1-8205-0c82d94eb16b","year":2006},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.201670Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:c9756036f17a8f1e41d0a9fed443f8a5f1ca7630a814f08ba2bd341a59cb26ea","observation_id":"8697bbad-e85a-4d0a-bee8-9dc5c7aa9520","resolution":{"observed_at":"2026-08-06T17:14:14.241662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:14.071738Z","title":"Spielman and Shang-Hua Teng","venue":null,"work_id":"f941ab92-a8ec-4627-a3dd-c327aaf8ac64","year":2014},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.296345Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:539304cb76b8ca6d82eb1513a07d157e2b2d131243a35f72540d1c75c63f62ec","observation_id":"1b5d6705-7063-4a78-af65-ce851d93388f","resolution":{"observed_at":"2026-08-06T17:14:14.118677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0903.2816","last_updated":"2009-03-16T18:04:31Z","snapshot_observed_at":"2026-08-15T05:52:49.093375Z","submitted_at":"2009-03-16T18:04:31Z","title":"A Note on Preconditioning by Low-Stretch Spanning Trees","version":1},"cited_work":{"arxiv_id":"0903.2816","doi":null,"metadata_source":"pith","pith_arxiv_id":"0903.2816","snapshot_observed_at":"2026-08-06T17:14:12.991838Z","title":"A Note on Preconditioning by Low-Stretch Spanning Trees","venue":"cs.NA","work_id":"b4d0b149-396f-4da1-9c30-5c2cac9d747d","year":2009},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.368816Z"},"links":{"cited_paper":"/paper/0903.2816","citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:1c97675618aa9f5323f0c2ec27523f5d0249b1d001084035b9aa4a3d8fb0a908","observation_id":"42f5b7ea-4975-4a56-ba37-9dc530329552","resolution":{"observed_at":"2026-08-06T17:14:13.025774Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:13.952850Z","title":"Gaussian elimination is not optimal","venue":null,"work_id":"ecc0dfaf-8914-4f49-8989-1406f71937b0","year":1969},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.431613Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:eee55e29a44c021ca4c4296543fd9065b40e4a5425a21aede74d2281b53ce9e5","observation_id":"2a5e4bb7-303b-4e6e-9c60-67812776a5cc","resolution":{"observed_at":"2026-08-06T17:14:14.014602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:13.817712Z","title":"A randomized Kaczmarz algorithm with exponential conver- gence","venue":null,"work_id":"0d92a768-bdc6-4907-bfc4-b7ed6d9cdc99","year":2009},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.505523Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:1d7b60c550d5734bacbf49b1496803455e2f7688521c5abd17bbeb18a0e67aa6","observation_id":"b7977877-dbe5-4e73-bb53-f6fe9d71201f","resolution":{"observed_at":"2026-08-06T17:14:13.873479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:13.719314Z","title":null,"venue":null,"work_id":"ceaace7d-8a16-4737-a211-8294bec947e1","year":2001},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.568367Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:4617a56a8d0a6c90cadbbfed1349a580e3c6b79daa9a4216ae9eaf76c3f19b28","observation_id":"963f8dbd-6a6e-411d-8ad2-4806c5cc0549","resolution":{"observed_at":"2026-08-06T17:14:13.766112Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:13.607642Z","title":"Multiplying matrices faster than coppersmith-winograd","venue":null,"work_id":"65e5e907-6a59-4692-9989-3ca671bc693f","year":2012},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.661168Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:2ef7dc6913b8daee2b4cb2d486b20a5c5eda2749eaa5ac489dca9bdce6a8988b","observation_id":"72b19926-b385-4f84-98d8-3a1101d4f5de","resolution":{"observed_at":"2026-08-06T17:14:13.650856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:13.479685Z","title":"New bounds for matrix multiplication: from alpha to omega","venue":null,"work_id":"4f445662-a95f-4672-a98a-ebe2ddc43d88","year":2024},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.730293Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:2a7dfc04c507f7ff108de66d52a3cad39bb3f7a9935b08860623c4b626da1d61","observation_id":"09be5b42-666d-486d-bb0d-5f42c17416a3","resolution":{"observed_at":"2026-08-06T17:14:13.539211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:13.362888Z","title":"Sketching as a tool for numerical linear algebra","venue":null,"work_id":"2f8b57b7-0859-434e-8aaf-4a946f3e2db1","year":2014},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.808069Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:e286b4ba82b31656a968de0ae9bd6f30668073ea1d692672ce31015f035f4528","observation_id":"799ca7c4-7247-44e6-9133-c9e8feda4dbe","resolution":{"observed_at":"2026-08-06T17:14:13.410680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:14:13.278410Z","title":"Even faster accelerated coordinate descent using non-uniform sampling","venue":null,"work_id":"f8dd7b5a-d3fb-412c-a099-86e0ace04169","year":2016},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:12.917160Z"},"links":{"citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:df6ee67cb71c5c77c19ce6601598ceee507495798b318cdc7a1c74c2c7f9dbf8","observation_id":"c48e1435-0088-47b4-870f-ce2c8a51d85d","resolution":{"observed_at":"2026-08-06T17:14:13.329587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T18:26:56.350573Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":56},"total_outbound_references":62},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 1 inbound Pith citation observation for arXiv:2507.11724."}