{"as_of":"2026-08-11T06:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f9cffa8e6e0add1814c9115736ec349129194f6335c077dc12100820a5225122","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:01:49.046042Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:43:07.646135Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T23:54:03.386835Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20602","snapshot_observed_at":"2026-08-07T04:43:07.646135Z","title":"Connecting rand omized iterative methods with Krylov sub- spaces","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10261","last_updated":"2025-06-12T01:01:39Z","snapshot_observed_at":"2026-08-07T04:28:32.207096Z","submitted_at":"2025-06-12T01:01:39Z","title":"Enhanced randomized Douglas-Rachford method: Improved probabilities and adaptive momentum","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:07.646135Z"},"links":{"cited_paper":"/paper/2505.20602","citing_paper":"/paper/2506.10261"},"observation_digest":"sha256:2847a9fc6e7591970a441a237b9580d76145377e0e5a70cd601ebf5638c844d8","observation_id":"1cbd26f1-3d0c-4f33-8adf-cddefcfea7a3","resolution":{"observed_at":"2026-08-07T04:43:07.646135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"cited_work":{"arxiv_id":"2505.20602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20602","snapshot_observed_at":"2026-06-29T23:54:03.386835Z","title":"Connecting rand omized iterative methods with Krylov sub- spaces","venue":null,"work_id":"01f53cb1-6c3e-4adb-b621-e83d40c36419","year":2025},"citing_paper":{"arxiv_id":"2604.05816","last_updated":"2026-04-07T12:51:44Z","snapshot_observed_at":"2026-08-09T03:10:44.805441Z","submitted_at":"2026-04-07T12:51:44Z","title":"Linear convergence of Gearhart-Koshy accelerated Kaczmarz methods for tensor linear systems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T18:42:25.397379Z"},"links":{"cited_paper":"/paper/2505.20602","citing_paper":"/paper/2604.05816"},"observation_digest":"sha256:177ea9ba242a9d94da98ae9db8f93f798ad3d691c4eff3e3b2994a04065ab1db","observation_id":"adaca877-d773-4d66-83af-553cb4d5b9d2","resolution":{"observed_at":"2026-05-11T00:05:50.280476Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"cited_work":{"arxiv_id":"2505.20602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20602","snapshot_observed_at":"2026-06-29T23:54:03.386835Z","title":"Connecting rand omized iterative methods with Krylov sub- spaces","venue":null,"work_id":"01f53cb1-6c3e-4adb-b621-e83d40c36419","year":2025},"citing_paper":{"arxiv_id":"2605.25034","last_updated":"2026-05-24T12:22:00Z","snapshot_observed_at":"2026-08-03T22:01:17.750102Z","submitted_at":"2026-05-24T12:22:00Z","title":"Randomized conjugate gradient least squares","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"cited_paper":"/paper/2505.20602","citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:ec73db3264d067efe7847aa786b6017a8c2716b7f0e0f6936da59ca6c851f630","observation_id":"ede75ea4-3e85-4c1c-8966-6c51faf4587d","resolution":{"observed_at":"2026-06-29T23:54:03.388261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"cited_work":{"arxiv_id":"2505.20602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20602","snapshot_observed_at":"2026-06-29T23:54:03.386835Z","title":"Connecting rand omized iterative methods with Krylov sub- spaces","venue":null,"work_id":"01f53cb1-6c3e-4adb-b621-e83d40c36419","year":2025},"citing_paper":{"arxiv_id":"2605.29304","last_updated":"2026-05-28T03:36:19Z","snapshot_observed_at":"2026-08-08T05:45:41.987512Z","submitted_at":"2026-05-28T03:36:19Z","title":"On subspace-constrained preconditioning for randomized iterative methods","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-29T06:21:37.788799Z"},"links":{"cited_paper":"/paper/2505.20602","citing_paper":"/paper/2605.29304"},"observation_digest":"sha256:d0a2307e8730b3391dfd5d7e6358200a3152325b715e5bd89cf3180ff095c34c","observation_id":"2cbb8c56-4a4c-4315-9647-c0dbb74a0c38","resolution":{"observed_at":"2026-06-29T06:23:08.766148Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.20602/citation-record","integrity":"/paper/2505.20602/integrity","json":"/paper/2505.20602/citation-record.json","paper":"/paper/2505.20602"},"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-07T14:01:56.323304Z","title":"Randomized Gram-Schm idt process with application to GMRES","venue":null,"work_id":"45fac7cd-6c0d-4b40-b491-18e49b3b3493","year":2022},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.318274Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:a7950994f09297a0ea51ee8d6bb7a3a41e93710093f30caa60dae3ea52bc8fab","observation_id":"f43eaa9b-f7ed-4375-b5fe-b7ab43b4e97e","resolution":{"observed_at":"2026-08-07T14:01:56.389426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:43.409891Z","title":"Pattern recognition and machine learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.409891Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:b833d8bacb68259e340d6721631ec208f87b2868de32826edf43043d439b4cfa","observation_id":"f757b95d-1673-45ed-97d7-05d415658134","resolution":{"observed_at":"2026-08-07T14:01:43.409891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:01:43.494269Z","title":"Introduction to applied linear algebra: vectors, matrices , and least squares","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.494269Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:b685fe85be3b2c1195f07daa4d1600780c681b09ea4744528f57c612363941f7","observation_id":"b1a808c8-ad43-43de-b17c-dc2bce0b201a","resolution":{"observed_at":"2026-08-07T14:01:43.494269Z","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-07T14:01:56.118154Z","title":"Gmres with randomized sketching and deflated restarting","venue":null,"work_id":"3847d95d-5e74-4503-9364-c8227a0f5812","year":2025},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.544365Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:eed1fb0815af4dcbe866d15ee4da8b2ddb8ac3c7b98dd30da907ee43e74e15ce","observation_id":"3202a218-a51f-470a-ad02-457bce7c6a35","resolution":{"observed_at":"2026-08-07T14:01:56.199536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:55.900497Z","title":"Libsvm: a library for support vector machines","venue":null,"work_id":"6b9142c3-54e9-48c6-aedb-5317797367a7","year":2011},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.606479Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:b4f699ca0fbe3a8dd49d24c221441684aee9fca9bfa34c6018b86c4e5edb5c7c","observation_id":"acc5aa7b-7f23-4028-a9ad-cf5ed3326d9d","resolution":{"observed_at":"2026-08-07T14:01:55.995021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:55.648295Z","title":"Finding frequent items in data streams.Theor","venue":null,"work_id":"2016c7c5-2e57-43b8-923c-96afaccf0a12","year":2004},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.683617Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:203c70b0f0f6291e70794c22f078fe542ab35c284845337d6ec8c377a2e01736","observation_id":"8440852f-4408-43a6-9cf2-bf2bdb794c5a","resolution":{"observed_at":"2026-08-07T14:01:55.720397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:43.748175Z","title":"Regularized Kaczmarz algorith ms for tensor recovery","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.748175Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:d2ac02290ea0e854a0b687770384ca6cb6a864046eae697d237db6a40e0c02fb","observation_id":"592999df-0354-46df-ace4-40bee29f7721","resolution":{"observed_at":"2026-08-07T14:01:43.748175Z","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-07T14:01:55.455241Z","title":"Low-rank approxi mation and regression in input sparsity time","venue":null,"work_id":"94798a7a-cf91-47ea-a8f3-146f86a3d3a5","year":2017},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.815249Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:6c84d176d07bf35a7dbaabc70ee9cca6dd96e3aa3e1a709dd161e346725994ba","observation_id":"7c9e63b9-d6ba-4397-ad62-c1155d975139","resolution":{"observed_at":"2026-08-07T14:01:55.535616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:55.210100Z","title":"An improved data stream summary: the count-min sketch and its applications","venue":null,"work_id":"09d4ae3d-2f22-4c0b-a558-d990da7f41be","year":2005},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.869384Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:f1d84030c7807cbfc87277477f5baee74158491553724509cc45d97afefef1eb","observation_id":"23967910-a03c-4532-b062-40a1a8e962e4","resolution":{"observed_at":"2026-08-07T14:01:55.326609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:54.968402Z","title":"Recent and upcoming developments in randomized nu- merical linear algebra for machine learning","venue":null,"work_id":"ee130d2d-a46a-4fbe-8294-492ec823e199","year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:43.961718Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:a7fee5e6f4915e581c5cc25bb269a64ca8cd107fa5ecb32277da7d5a55aec538","observation_id":"a27925f3-b3e7-4be6-ad40-bc8762700cb2","resolution":{"observed_at":"2026-08-07T14:01:55.108447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:54.858979Z","title":"Unified matrix treatment of the fast wal sh-hadamard transform","venue":null,"work_id":"0dbcf887-a3eb-44d8-a370-4a256f1bef69","year":1976},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.052209Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:b1583575470edcb3c8a0cc05b369b54eb7c734846bf427b2e01b345f32e2506d","observation_id":"4e9d5633-30a0-407d-a4f3-dcce58ee81fc","resolution":{"observed_at":"2026-08-07T14:01:54.895169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:54.690940Z","title":"Ri dgeSketch: a fast sketching based solver for large scale ridge regression","venue":null,"work_id":"e79d7a1c-cf52-4a48-a56b-526c9e703d09","year":2022},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.135928Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:9e0efa2b7c01ce5f7af1ae84a245fd9e78b6b659f12127402633b9ea6bceab43","observation_id":"a7b90fe4-ab59-4e97-9256-9c65416f7619","resolution":{"observed_at":"2026-08-07T14:01:54.771315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:54.555621Z","title":"Acceleration schemes for the method of alternating projections","venue":null,"work_id":"8c240a03-52e2-4268-8ef2-b91f6f2b3775","year":1989},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.225322Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:ef797cd85e8d2aae88f4931b6adb0adbef039d3ae4f14d7e00a215f8f3932d47","observation_id":"d4654221-01cb-4b38-99c3-0640887b4ea9","resolution":{"observed_at":"2026-08-07T14:01:54.612800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:44.342990Z","title":"Matrix computations","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.342990Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:bb05efddba7844afe2913ace9df7f123b07137bf49017e54580bba095ac7ddeb","observation_id":"2c57b24e-635e-4618-8fa8-2ba6d87ca92c","resolution":{"observed_at":"2026-08-07T14:01:44.342990Z","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-07T14:01:54.417700Z","title":null,"venue":null,"work_id":"68eda27b-5394-444d-b6a4-b8e81ee7aa71","year":1970},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.475571Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:21a5a056e3ced6400b12ab96dcfe167acf77dd39df92e894635517284d36b1b7","observation_id":"d5d06011-df7a-406b-bd42-bbe6762a1c68","resolution":{"observed_at":"2026-08-07T14:01:54.468236Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:44.596195Z","title":"Gower and Peter Richt´ arik","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.596195Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:65360c81f03778e1c8af1d8e41dad90228b20e6a7b8bac915a51ad351b002623","observation_id":"34354e06-d1ee-46b3-82cf-d265f6ba6aee","resolution":{"observed_at":"2026-08-07T14:01:44.596195Z","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-07T14:01:54.365583Z","title":"A sketch-and-select Arnoldi process","venue":null,"work_id":"b6c4cbee-1979-467d-9437-f459a47cafbf","year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.653157Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:f14c1487abf519e9adf41e85a1b2ec1ac55ec51adf6193ab633aefd2e2a6813b","observation_id":"d36ab3cb-7b26-4826-81f4-cdf979ae60f3","resolution":{"observed_at":"2026-08-07T14:01:54.373046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:44.716632Z","title":"Randomized Doug las–Rachford methods for linear systems: Improved accuracy and efficiency","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.716632Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:0c569e5f434e22113c5a72cccace7b93a37881643d5e54e74a8d93853c14f14c","observation_id":"a27790fb-1fd8-43d2-9011-c672538df6cc","resolution":{"observed_at":"2026-08-07T14:01:44.716632Z","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-07T14:01:54.254559Z","title":"Randomized Doug las-Rachford methods for linear systems: Improved accuracy and efficiency","venue":null,"work_id":"613c3fbb-8db2-454f-a361-6f0bc5d45c7a","year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.780661Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:74f7e5e02164456b5621719e5eacc72ed0a39c52ea211b5dcc8a71239243d2b6","observation_id":"5dc908db-5c55-4f9e-aa9c-79c9e6cdf4c4","resolution":{"observed_at":"2026-08-07T14:01:54.300008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.05437","last_updated":"2022-08-24T12:34:07Z","snapshot_observed_at":"2026-07-06T13:40:43.537283Z","submitted_at":"2022-08-10T16:50:52Z","title":"On pseudoinverse-free randomized methods for linear systems: Unified framework and acceleration","version":3},"cited_work":{"arxiv_id":"2208.05437","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.05437","snapshot_observed_at":"2026-08-07T14:01:49.301875Z","title":"On pseudoinverse-free randomized methods for linear systems: Unified framework and acceleration","venue":"math.OC","work_id":"4054ab72-3b17-4ba8-9a77-c3a00ebf158f","year":2022},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.909705Z"},"links":{"cited_paper":"/paper/2208.05437","citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:7da46507f9ed0e9dd1578dee9b66065c71ba679d21eee7f2a10f8a42591cc919","observation_id":"71d4514f-cd75-44f9-be42-4be87dc8ed3f","resolution":{"observed_at":"2026-08-07T14:01:49.361663Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:44.970451Z","title":"The elements of statistical learning: data mining, inference, and prediction, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:44.970451Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:e3a4d07836d1f57f1379b82c5b1804272a3fee2e1b5fea32d2ecd953b0d8fde0","observation_id":"95d8a7e4-bdcb-4f13-8be3-b21fd684ac44","resolution":{"observed_at":"2026-08-07T14:01:44.970451Z","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-07T14:01:54.040704Z","title":"Inertial ra ndomized kaczmarz algorithms for solving coherent linear systems","venue":null,"work_id":"10a71be3-db4c-4fde-9d8d-ed7699afb739","year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.103255Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:280bc1c6ba9db124a66e6e2eae245ab44c5223fd60ca6cda964e0012285f59f6","observation_id":"5cbf0967-0794-4eab-b1f3-18ca96c63037","resolution":{"observed_at":"2026-08-07T14:01:54.099412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:45.229820Z","title":"Rows v ersus columns: Randomized Kaczmarz or Gauss–Seidel for ridge regression","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.229820Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:19632b88dabafeea0eb6fd3d4b31664d338b503e29263f5ec9a881dfc7736350","observation_id":"ed5d0a71-22fc-45bd-9073-2e2d4007c47f","resolution":{"observed_at":"2026-08-07T14:01:45.229820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.18305","last_updated":"2025-06-17T00:19:50Z","snapshot_observed_at":"2026-07-31T13:11:38.775052Z","submitted_at":"2023-11-30T07:18:30Z","title":"Generalized Gearhart-Koshy acceleration is a Krylov subspace method","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.18305","snapshot_observed_at":"2026-08-07T14:01:45.356084Z","title":"Generalized Gearhart-Koshy acceleration is a Krylov space method of a new type","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.356084Z"},"links":{"cited_paper":"/paper/2311.18305","citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:bbf119d2ebac255322e2579e88e86a75c84ca615caf3b284a6eec98057c7892f","observation_id":"fb8fdf17-7cef-454d-bec8-40e58fcb5f60","resolution":{"observed_at":"2026-08-07T14:01:45.356084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:01:45.408674Z","title":"Algebraic reconstruction techniques can be made computation- ally efficient (positron emission tomography application)","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.408674Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:a451d76058805fc57ec0f98246a966d3eac7fe521d3066885f3502cc974d1951","observation_id":"f403a589-dd5d-43f0-b9a9-0e0e24d25fd5","resolution":{"observed_at":"2026-08-07T14:01:45.408674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:01:45.491083Z","title":"Randomized K aczmarz in adversarial distributed setting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.491083Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:e7a230943d2e7187f08a0acbc5a90d1e6e663051e150f03bb604c3aa4ff2291b","observation_id":"d6c1b475-54c8-4347-a021-179c1ccc4986","resolution":{"observed_at":"2026-08-07T14:01:45.491083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:01:45.579187Z","title":"Linear convergence of randomized Kaczmarz method for solving complex- valued phaseless equations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.579187Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:97f2240a23ca066c48039fd1a42bf295249a3ad037ba4ad69a3d79eebcfcce29","observation_id":"ac399a2e-67e3-4f2d-9711-d47900a1f03c","resolution":{"observed_at":"2026-08-07T14:01:45.579187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.10123","last_updated":"2023-04-20T07:14:24Z","snapshot_observed_at":"2026-08-08T12:48:05.133997Z","submitted_at":"2023-04-20T07:14:24Z","title":"Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.10123","snapshot_observed_at":"2026-08-07T14:01:45.684811Z","title":"Linear convergence of reshuffling Kaczmarz methods with sparse constraints","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.684811Z"},"links":{"cited_paper":"/paper/2304.10123","citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:3873cdac5cb96adf84c7e7bbac54d3f6b7b2f458533e3ba22c7b74816ebc7f23","observation_id":"479fb3a1-405c-4b21-9a69-1a7e2cdf5cc7","resolution":{"observed_at":"2026-08-07T14:01:45.684811Z","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-07T14:01:53.736792Z","title":"Extensi ons of lipschitz mappings into a hilbert space","venue":null,"work_id":"0690effb-37a2-4be2-a562-89b8ffda0b8d","year":1984},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.754616Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:f21bfa99db579bd474ad83b911f73332fbfac662e38474ac86a2d264b7cb15c5","observation_id":"04a0b303-ed77-4d68-8c6b-6923be4334e4","resolution":{"observed_at":"2026-08-07T14:01:53.837763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:53.556567Z","title":"Angen¨ aherte aufl¨ osung von systemen linearer glei-chungen","venue":null,"work_id":"0b2d4a2d-59d7-48c3-b86a-dd8af3b03c18","year":1937},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.881632Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:7e04179c0277431702c3f82c3037a83b390b1e1e2ded296ec33b88334b3b5fac","observation_id":"147705f6-e4c5-4415-80f5-401fb679636c","resolution":{"observed_at":"2026-08-07T14:01:53.620364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:45.971317Z","title":"The suitesparse matrix collection website interface","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:45.971317Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:8f8fb8dbfe2583eb6909509ed7cacfd3cbc5b6548426f7d9d63860498c6a2553","observation_id":"2493e568-ff9f-4c39-9567-2422bca78e28","resolution":{"observed_at":"2026-08-07T14:01:45.971317Z","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-07T14:01:53.345770Z","title":"First-order and stochastic optimization methods for machi ne learning","venue":null,"work_id":"b43d16fa-63e4-426e-85e1-d6ff235ad2a1","year":2020},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.088468Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:974e7b192f6239b68318eb926a4c0b79c0263e72996ba31374529e7e89e03af7","observation_id":"60950e21-99dd-4741-91a6-85e0bdc123f0","resolution":{"observed_at":"2026-08-07T14:01:53.434489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:53.162325Z","title":"Randomized method s for linear constraints: convergence rates and conditioning","venue":null,"work_id":"c0b75fb4-79f9-4bf3-9246-6a4677063fee","year":2010},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.194438Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:f564641718ebeece99e5f6b37f1178d4da3eabc636e8764694c1c853bb64563a","observation_id":"234b70a9-9268-4dbe-9fe3-54d15024da91","resolution":{"observed_at":"2026-08-07T14:01:53.258997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:52.986887Z","title":"Numerical Mathe- matics and Scie, 2013","venue":null,"work_id":"c0869e57-6eea-429b-b702-4d88cd42288f","year":2013},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.268880Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:866e1b37f64d705bdb4ee43009151857f210bd4eff41bc7d9934dc699b273a8a","observation_id":"9d7b1592-4255-4e78-80fb-d787df549d00","resolution":{"observed_at":"2026-08-07T14:01:53.043157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:52.907410Z","title":"An accelerated randomized Kaczmarz algorithm","venue":null,"work_id":"e513fa15-2b57-4040-9bd6-74d21c63fa4b","year":2016},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.357979Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:9148022138f4b6e42bf5751c2e0a59eb9da46e907475c6af815cc282a2c946e4","observation_id":"b9979f03-94f1-40bd-bfb8-b239c22e7320","resolution":{"observed_at":"2026-08-07T14:01:52.966718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:52.737710Z","title":"Subspace methods for nonlinear optimization","venue":null,"work_id":"83555fa8-12b2-421f-87f9-cc99f076447f","year":2021},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.460770Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:aa5d0d5b22f4d2263aaa67f04976bcb0245a97117a80aa92ef62ccd9594765ec","observation_id":"18a337f1-8abd-44d0-8b66-d5a83f524286","resolution":{"observed_at":"2026-08-07T14:01:52.788987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:52.600983Z","title":"Momentum and stoc hastic momentum for stochastic gradient, newton, proximal point and subspace descent methods","venue":null,"work_id":"ce91f221-0e1d-47a4-b92c-ce1cb09cb057","year":2020},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.566534Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:8bbd1fe43dcff6fa0dab0aea853e47902976b6604086d487333d48ab08010952","observation_id":"a9796e3a-8dec-4072-9960-1f4a5d71b554","resolution":{"observed_at":"2026-08-07T14:01:52.655817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:52.474862Z","title":"Minimal error mom entum bregman-kaczmarz","venue":null,"work_id":"799f58ea-3e8b-4ddd-bdcf-12f61715ee07","year":2025},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.666661Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:6d2add4b406eac97077b6b2c0779c4cf088c74097e7e35429988b12e6aa43668","observation_id":"1d91a494-9533-4e88-b34a-c3c39b015705","resolution":{"observed_at":"2026-08-07T14:01:52.547146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:46.748140Z","title":"Randomized Kaczmarz for ten sor linear systems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.748140Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:3ae119137f412f1f5fee1e111a1408074d9a7e92f001d726dca0ba9ee3e5f030","observation_id":"2e697a71-b13a-4f10-bb94-c8cde4a16bd4","resolution":{"observed_at":"2026-08-07T14:01:46.748140Z","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-07T14:01:52.320704Z","title":"Stochastic gradient descent for linear systems with missing data","venue":null,"work_id":"95406331-df2f-41af-8a23-c2c8d9cdc99c","year":2019},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.843668Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:eae007057670962ae6665452bb394ab18ee82e84d4b77bf957a86105ec39c5e4","observation_id":"50c45b3d-bb40-4c04-bced-af358cd6c01f","resolution":{"observed_at":"2026-08-07T14:01:52.369077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:52.197031Z","title":"Randomized num erical linear algebra: Foundations and algorithms","venue":null,"work_id":"23b99c7a-18fd-4912-bc97-d67af3f925ce","year":2020},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:46.917471Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:e34959334b95d223dcbb5f897e17fbf6680106113dca7e1aeaed9a233276dadb","observation_id":"166afa6a-06a3-4c72-8c7f-c61217fb3436","resolution":{"observed_at":"2026-08-07T14:01:52.244373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:52.086103Z","title":"LSRN: A parallel iterative solver for strongly over-or underdetermined systems","venue":null,"work_id":"1ac1ab3d-6675-4eeb-bd7c-f39ae5e3a3a3","year":2014},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.017381Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:233086d8932371ccd70db0951ce03e610e4719766ce9b22c423234a8168a04f3","observation_id":"8e6eb56f-d8b9-45a1-9057-18574bae7dca","resolution":{"observed_at":"2026-08-07T14:01:52.128716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:51.976822Z","title":"Fast and accurate ran domized algorithms for linear systems and eigenvalue problems","venue":null,"work_id":"c8f21ab2-1375-45fd-b636-01c321fdd53b","year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.071533Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:e7217fad6db9f41099803eb23abfa0c3b4ded3e37d7bba8dea8f840a879710dc","observation_id":"d80e2458-4b6e-491d-bd80-de20c5305d3e","resolution":{"observed_at":"2026-08-07T14:01:52.014040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:51.856275Z","title":"Faster randomized block kaczmarz algorit hms","venue":null,"work_id":"549493b5-ccaf-4a93-bd80-5f08e2a3c6de","year":2019},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.147901Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:4a695453918b31d8de25f41756cc0d756029f594fdcbed3ef8f8bde71c658f97","observation_id":"ba187e12-5aae-4f83-95cf-cdd18705f552","resolution":{"observed_at":"2026-08-07T14:01:51.904134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:47.227342Z","title":"Stocha stic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.227342Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:42335d1c88e9aface2b753c5b017ad43abcff6dfa4c1085a9fa4097191c4fbd4","observation_id":"a533d58d-2aee-4bc9-846a-6cbd746affdd","resolution":{"observed_at":"2026-08-07T14:01:47.227342Z","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-07T14:01:51.716146Z","title":"Introductory lectures on convex optimization: A basic cour se, volume 87","venue":null,"work_id":"7938904d-3845-4e07-9f17-e57db5d1fd52","year":2003},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.293154Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:405d4ecfa683aea2b85bd20cf1e687ea47aa24ce56852da982e072b4bcbf4b96","observation_id":"9a1c0e38-be87-40d4-b0ac-9f1fb0d0f328","resolution":{"observed_at":"2026-08-07T14:01:51.761339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:51.617720Z","title":"A method for solving the convex programming problem with convergence rate O(1/k2)","venue":null,"work_id":"bc54c4f5-a26e-4b63-8aa9-a1b5343ac2c9","year":1983},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.344851Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:2c5858c9d92496e384ad166f4f4cc42a3740cecbd99e2f49cc90fead5b20dab0","observation_id":"6f5518e1-73a3-4e86-befc-b905e8bcbda3","resolution":{"observed_at":"2026-08-07T14:01:51.657429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:47.406981Z","title":"Numerical optimization","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.406981Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:30b601b09e6e21945418f5a1badd9ab060ce9661c2b7f8040548592315383709","observation_id":"8a61151f-21ad-4c6a-b9d3-a1a61bd52548","resolution":{"observed_at":"2026-08-07T14:01:47.406981Z","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-07T14:01:51.483382Z","title":"Iterative hessia n sketch: Fast and accurate solution approxi- mation for constrained least-squares","venue":null,"work_id":"91ef13e7-a880-4cad-8e04-d03cb27de8d1","year":2016},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.468753Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:b0b624541fcbacc67af16c261e4b6d4c3c19d74ea37a4d2d743f34d8285c174d","observation_id":"f7e8b898-2263-4b5c-acbe-6786f0c83625","resolution":{"observed_at":"2026-08-07T14:01:51.537112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:51.310086Z","title":"Some methods of speeding up the converge nce of iteration methods","venue":null,"work_id":"579b43fa-8944-420a-bd89-fdb1235372f0","year":1964},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.577159Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:946e5df6b6a17651eb83508348a699e4f25841fd9a837f1345504d3af5272538","observation_id":"25fbce1f-43f1-4ef7-8a23-1e17f8a8e260","resolution":{"observed_at":"2026-08-07T14:01:51.389691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:51.184924Z","title":"A statistical p erspective on randomized sketching for ordi- nary least-squares","venue":null,"work_id":"cfb077b0-7dec-48f9-80a9-1e3ca8fb1e07","year":2016},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.659765Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:83af20f51e61d19c846bb39c1eb7684a4a1205075a951688ebef69f5735bc9b5","observation_id":"a7cc5cf9-2116-46e3-8399-fd3778a1c341","resolution":{"observed_at":"2026-08-07T14:01:51.222556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:51.042717Z","title":"Generalized gearhart-koshy accelera tion for the kaczmarz method","venue":null,"work_id":"850e993d-6f1d-4963-9bed-2fdba58391ee","year":2023},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.738408Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:5e687b2198a1a40db7b84a9cc8d4b34cb76c5caad75ebccb375c27769420142d","observation_id":"ad5a1eaa-96a2-4c02-b8da-d0ec175c64bf","resolution":{"observed_at":"2026-08-07T14:01:51.098494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:50.830326Z","title":"A stochastic approxi mation method","venue":null,"work_id":"e05ba077-1030-4fc4-8192-8a1a0cd16e16","year":1951},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.819855Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:8483901f6f41c3ef8cc95f540988857fe0a273136c8e9bfe25ca4bcf122388ec","observation_id":"8f8535d1-bfce-4656-9789-8d83a35b6c2a","resolution":{"observed_at":"2026-08-07T14:01:50.907903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:47.893525Z","title":"Iterative methods for sparse linear systems","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.893525Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:532defc278d36c4370d3de6313c15394feae48dde71af2e2807fbb203ffae84f","observation_id":"8d3253bd-915e-48fe-837a-5553e20c7ade","resolution":{"observed_at":"2026-08-07T14:01:47.893525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:01:47.977114Z","title":"Linear convergence o f the randomized sparse Kaczmarz method","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:47.977114Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:58250178bd9c40b431f44ddd7372711037fc350935078460b791c77065a138d5","observation_id":"fc5b2575-1446-470c-9763-d124dc098a5e","resolution":{"observed_at":"2026-08-07T14:01:47.977114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:01:48.057765Z","title":"A randomized Kacz marz algorithm with exponential conver- gence","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.057765Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:09e5340320556df390d7f4177139e6580b6fc012aa250a672f32e65817b5e526","observation_id":"95d5c7f2-ec14-4821-b94d-e3cdb3959327","resolution":{"observed_at":"2026-08-07T14:01:48.057765Z","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-07T14:01:50.610607Z","title":"On greedy multi-step inertial randomized kaczmarz method for solving linear systems","venue":null,"work_id":"318a2389-6fde-4260-b2da-cc98a49758b7","year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.158502Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:788b737fda44e3548a71c51bb0b82e0e3e4cd65c0699ded3185a08a896489d40","observation_id":"d82546b8-96a3-44ee-bb4d-1b90b96dc490","resolution":{"observed_at":"2026-08-07T14:01:50.683093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:50.459853Z","title":"Gearhart–Koshy acceleration for affine su bspaces","venue":null,"work_id":"9f0a113e-dded-4757-aba9-97fdb65d4dd9","year":2021},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.253975Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:ef8ee69e19dba378e3733fbc5997545e64943818cdff6a1302b113dc0bc235b6","observation_id":"5081b99f-734c-4685-b37d-4174860ad141","resolution":{"observed_at":"2026-08-07T14:01:50.517514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:48.341214Z","title":"Phase retrieval via randomized Kaczmarz: theoretical guarantees","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.341214Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:54df1913c4fe9e55dfd2b68449e7b7e9c8e80f44df42df1abcf9cf6d617bf02e","observation_id":"1854ffdb-ada1-4b9a-a3ee-5a915a465d72","resolution":{"observed_at":"2026-08-07T14:01:48.341214Z","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-07T14:01:50.308452Z","title":"Improved analysis of the subsampled randomized hadamard transform","venue":null,"work_id":"9ab2ca03-566d-4a4b-aafb-d02f0e8d9236","year":2011},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.418770Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:de6272c627d59cc1bff3a2ecb9f396aa82f1fed3f9a7be32427c6c5f1429a809","observation_id":"6052985c-41dc-4f31-a7e6-66c9becff3f7","resolution":{"observed_at":"2026-08-07T14:01:50.366224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:50.168306Z","title":"A fast randomized algorithm for the approximation of matrices","venue":null,"work_id":"aa38c40c-f3fc-443c-9cfa-10f2f0444bd5","year":2008},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.503837Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:f45109c9b2084d3ea58e3ecb2be47be031b78309d5645cbb5288ff81958dd9ba","observation_id":"12caf9eb-236a-40eb-8dc4-bf4b63dad8a5","resolution":{"observed_at":"2026-08-07T14:01:50.219579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13941","last_updated":"2025-03-18T06:13:47Z","snapshot_observed_at":"2026-08-07T16:55:49.977778Z","submitted_at":"2025-03-18T06:13:47Z","title":"Randomized block Kaczmarz with volume sampling: Momentum acceleration and efficient implementation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13941","snapshot_observed_at":"2026-08-07T14:01:48.576147Z","title":"Randomized blo ck kaczmarz with volume sampling: Momen- tum acceleration and efficient implementation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.576147Z"},"links":{"cited_paper":"/paper/2503.13941","citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:1dc88756a747e434e5904de215f8abb6eaf898bec36ca0cec90a3152e3afa3bd","observation_id":"80898be7-809e-472e-bf35-4b43007b343e","resolution":{"observed_at":"2026-08-07T14:01:48.576147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04091","last_updated":"2025-05-10T02:16:35Z","snapshot_observed_at":"2026-07-06T18:10:49.501650Z","submitted_at":"2024-05-07T07:45:22Z","title":"Randomized iterative methods for generalized absolute value equations: Solvability and error bounds","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04091","snapshot_observed_at":"2026-08-07T14:01:48.661686Z","title":"Randomized iterat ive methods for generalized absolute value equations: Solvability and error bounds","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.661686Z"},"links":{"cited_paper":"/paper/2405.04091","citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:c702a5388e0268c207697e2a31915e303c96e8e21731eee266ffcd25c559f349","observation_id":"0e71c330-3823-43c9-aba0-0e007aa03e80","resolution":{"observed_at":"2026-08-07T14:01:48.661686Z","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-07T14:01:50.035129Z","title":"A review on subspace methods for nonline ar optimization","venue":null,"work_id":"c3502577-59c1-48c8-a580-9a1231d74cad","year":2014},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.700120Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:23a344a48dcfc8c6f264c892a63ecf0bd44205abbfc4af24604c4e3fcbeb4f33","observation_id":"f61919d0-c176-4db9-ac58-349f2c7321b7","resolution":{"observed_at":"2026-08-07T14:01:50.085432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:48.743832Z","title":"Ada ptively sketched Bregman projection methods for linear systems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.743832Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:342615e79c67241f1b94b46dda69f1495a7fa2c1c7528ebeb0e34dd2667b4ec1","observation_id":"84f7f156-e26c-406b-a368-83145f624da9","resolution":{"observed_at":"2026-08-07T14:01:48.743832Z","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-07T14:01:49.883575Z","title":"Random ized Kaczmarz method with adaptive stepsizes for inconsistent linear systems","venue":null,"work_id":"b832b265-30ec-40a0-806a-ec39bdd43a66","year":2023},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.791405Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:768a9cb2e6b02073a520b59e78756372afe5cd33e802dedc6b09f674a7311d50","observation_id":"2a196283-7eb2-4840-b645-d45e107e5695","resolution":{"observed_at":"2026-08-07T14:01:49.947356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:48.841257Z","title":"On adap tive stochastic heavy ball momentum for solving linear systems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.841257Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:318637c13c0a67ae8047f0a115b5e0aff67092579bd4aac90dfb42018ca11e2b","observation_id":"27018d11-f9fd-4c1b-8e5b-ffe724bb0ab6","resolution":{"observed_at":"2026-08-07T14:01:48.841257Z","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-07T14:01:49.726836Z","title":"Proof of the main results 7.1","venue":null,"work_id":"71b57fd4-4dc6-482d-942a-0dc017150bc5","year":null},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.920758Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:67d2cb31b7f38ad0084915d2c7f3da7c2602bce45a2e70eb866e80bcbf669368","observation_id":"cb2677fc-a7f3-4ec6-886c-c3dace9bb93e","resolution":{"observed_at":"2026-08-07T14:01:49.767536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:49.581129Z","title":"By the arbitrariness of x, we conclude Kk+1(A⊤A, A⊤r0) ⊆ Hk","venue":null,"work_id":"280b3215-eb82-41c5-87cc-a235b8ae1782","year":null},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:48.990824Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:c33a57c2b38ba5b4a36f07e068f928ecd55d80f584bf19db7bfe1dd8b7d0b104","observation_id":"5bdbb3a2-5326-461b-8d24-5c62183afa83","resolution":{"observed_at":"2026-08-07T14:01:49.656108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:01:49.463651Z","title":"□ Proof of Proposition 4.4","venue":null,"work_id":"3352f9fc-cc09-447e-bbd6-9adbf498a8d8","year":null},"citing_paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:49.046042Z"},"links":{"citing_paper":"/paper/2505.20602"},"observation_digest":"sha256:49cfd117e3c6fbe446f5c13ed10724032b49906a619416634948cc2e74ffcb0b","observation_id":"fa1b59ae-17bb-42ff-b6a5-e91e079f5cc1","resolution":{"observed_at":"2026-08-07T14:01:49.496100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.20602","last_updated":"2025-05-27T00:40:43Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-07T13:48:33.599104Z","submitted_at":"2025-05-27T00:40:43Z","title":"Connecting randomized iterative methods with Krylov subspaces"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":1,"verified_fuzzy":43},"total_outbound_references":70},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 4 inbound Pith citation observations for arXiv:2505.20602."}