{"as_of":"2026-08-09T02:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:553c2065a7ca662011d5cc26e90642f32aa185fb850f70688224e5020c597e88","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":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"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-08T17:44:46.727004Z","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:ba7b574db8b78b61f111a41f4dba9c2d292dfcf54712f49a5d4b772c67669f55","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:cca1438a2ed87bedbd76368f047a058312c7f061bb7625a16d56f33a8a7fdfee","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:cb2a82a83fd331ff0dd44943a87d6336248d025d6e2339bc6d3f2d2a846094f4","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:4db1b9ba4ab9255f5216fd4a61ac6b4c242b4b6b920184999b57e733d967019f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:bdb1d6a2a74375d44935bd0fa856fd0580bac984b9cfc5ffa4291a7f85f1b977","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:731d2bec1010efb0a9cbf677884a81a7d677e5d05ed2f78d350c8f3d152d3595","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:6116faeded7f03a0df43d8fc2a2efca0b0c6ad15f9343379f6a6f2ac3eaaf985","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:e29efb02495bc1657bc653507a9044da1cba6f776cda369e8f77c371d9b0d5f4","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:66aebd8157c60544c39133d5565225530125250a8a13c160a84f352869961c3c","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:ab3c376e73b0ea86d556ab97ac033a5e2752f64ca306ac390f3d89e876fc1a3b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:2199f1f156a8955e0701579917637e65b4d7d32b10f8f021980edc5db3c60e94","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:83254a8b97a800571c4a352bd3ab251daa77c7fac8406e2df767d7f4182d026f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:d5e00577d3e5eec4c7dccbab3a508e477917ea3a33a8db4c2a06ffc347f06291","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:9949089a21a92ccf84b8b313461f101a2b066dcb7199ce463d63df4dd04683b3","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:754d2d156b99431fdfe8c8685303302faa30a2842090e4298c8f7adda0289edc","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:43bc58588e7ff9becd70a61243e5d08d1a4dd367e1342a8c23476cb1db17a622","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T18:12:09.623654Z","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-08T17:44:46.727004Z","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:c80dc494f08719faa698cd17afc2ac96f57a3d07d95fbf5a407f21d666c56876","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-08T17:44:46.727004Z","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:214284ab7fceb4c0abd5952ab92913d641ebe56416ddeb4447c45b2054a79609","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T20:23:31.551214Z","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-08T17:44:46.727004Z","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:6d95b6e4e9f3082d88ff459b7085d66d3ead5efdea1b1fac2febbbe398d45ad8","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-08T17:44:46.727004Z","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:00ee4960b2a59d9808ebf37d610e8ff5f90f5d3f8f64b308a867dd2a69ab88b1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-04T13:13:24.669027Z","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-08T17:44:46.727004Z","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:942115676c560f992b1b2f1be0e403e37d3c7ec7ce64d3304543a21a347be0b2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:56d8bf7b2407ae2fba90c03366315d251cddd7574bc64a2321afffd47443faf9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:9479bcd891b4c3f207acd10affbe4c4c1ce2a1b3a84292110db370a3ce120713","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:95e5d9ec8cc095b0e0b57648519c077f6bc78d5b264caaa36d2514244185886f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:2adc88bcba7ac9dd2558d0ff15eba8db7546d724a43798c2896c5c8ae2a1f754","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:4b0c1cf9f101a28dab1774851fbed83b9957ed5a9b006299949280b5d2f52de7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:78f9df7aadbedd059c53d2ff41cd7bf929240076bbbb53868e80ff8b53465a1f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:1d61d266441e7a08a640ad67dd9ab56a679ee614bfb8fcb14e59c7d0ef4d7d05","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:d71d6326b80d72468ca11d969b35895bfbeefab86645b45e194c6e19b5e8b794","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:f6e8c4db434218eb2414bd3a8546b7ad6c7da40443c9541ff04834b2148bf22c","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:95490235b87d03361edbf06c3c0b16cd4fa995c7d7084bf76c10ff67e082a325","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:d9cf0eaa3646dc8f15488a4d6efea6027162745f35b8d9ad3a0dd006b0e6d296","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:1056bac88208f1ffaed0a754362562ff6285eacc602cccb51ae99dda88753a86","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:8d578f49bc0d8c96f2d3cd7187fe1a4a5032a830b45137e869b422de76c926a9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:5b26d3f5c193c706007b8f9aafc20c5979c3b0a22dd7f5eb99d2618585228b23","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:33ee18df4b6766ad39fa638b22174d53b05620e48385beb2c7bc74fee3817c52","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:19ca67dfddf815a85b5d5b5e4138baa87321d120a7b697f11b41b56f6db80606","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:c54efc1cb7b97f7f042a177ed318390ab925e60bd72c1d9d97366b2aac2f9f84","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:17121706a45ff5c35b8ff5eb15526320f5b7e4554d9854b0290af0b4bde6bbed","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-08T17:44:46.727004Z","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:4dd89964c2346f6296c4e6934c993fad9fe5d77cae9b029e7ea350fa29362126","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:573016c6ed816dd935ad4b3aee8d755417b8eaa40c71da6b17af106c3c93a285","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:ecafefc745c69774a823951552225c9d0ae447339307aa0c682126427ba1e555","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:1ae1d6e1747e6ece61f19965777569b1d60dd16aa9d0b9dc753f1b0a463d8857","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:7934137946593ae0fed39658d9b326c0ba21cec7f55983de799815aa67254ec4","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:2ad503f1a7f97ef9cde8b333d8f2234d9ff5d98b4c0dac6d5f46464716675981","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:52d02ac4464af7a55168f1747fb5c31f0e1525acb0909e42c741313bfdd5b83e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:08baf40d92c103e404a75af767e04f2df9441124c85a40f7d903c0fc86eede31","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:6993f021cbeaea71d468c84a6f43807f70cc276160c53223a14ee79a635735c7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:08f85a205f18b7bb5860fc35b5a0a80d44c8341f010d8ca55b7ecb3eebc9f135","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:fea21924b047937d34ff1675830e7c1846c6594a941daa705065aba6e40157b3","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:740a68777777ddfaebb0a8b5efaf5272c13d63f31ad7b811ae091ec1a58f6f57","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:376e6c11cb889fa56a82f212d57e2f7d8e3b4cd08663f3d32dfc90e481172256","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:e4c6f929dcd8f8abfe354c30c477f1e54eab83a55cf234c907aac3547762eb8c","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:b7f4a7721fb97cb3690d9ffd210e0c052bc8255f49b06481e07a96f5d53101a6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T01:54:50.190837Z","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-08T17:44:46.727004Z","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:6fc6505e568b255f364ec3a9621b02f2fc6968d93f43f99344b37f2e8c1c3614","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:5a2422770fab30991fd2d7d1969c27b6925bee29fcc2ff60065938829042426b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:95bc5553d0d390ddc8be71194c117252a9a6c70f987c3eb2fcf23796fa4edee6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:99c71c4915abfd6f813a04bbd9ed2854b7e5699f1c87190fdcf6f7215f543e50","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:fa256d84090b7c0fb628cdd1c0063caf159ab322793565624b8678082161f811","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:5c8d95cc109b082a83e78d10d12903770537ee7a73bfaa25c445f9e9391432bd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:32277fe861123f455acfb35c306ed4bea6b6b72f7204e2f184263742749b00fb","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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:4f00f374acb4ccfcbeff0c3eea99d0b4541d63869cde864193719cabb4eb6176","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T17:44:46.727004Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2507.11724."}