{"as_of":"2026-08-05T13:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cea143f5e605b11f282bbfa49639b03fdb1a50fc4ac445dd42e4d34aeb218cf5","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T23:49:53.122613Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T06:21:37.788799Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-06-29T06:23:08.735109Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2605.25034","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.25034","snapshot_observed_at":"2026-06-29T06:23:08.735109Z","title":"Randomized conjugate gradient least squares","venue":"math.NA","work_id":"c0418d51-07a7-4bf2-ba37-3c1d889bd0f2","year":2026},"citing_paper":{"arxiv_id":"2605.29304","last_updated":"2026-05-28T03:36:19Z","snapshot_observed_at":"2026-07-06T23:38:46.361360Z","submitted_at":"2026-05-28T03:36:19Z","title":"On subspace-constrained preconditioning for randomized iterative methods","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-29T06:21:37.788799Z"},"links":{"cited_paper":"/paper/2605.25034","citing_paper":"/paper/2605.29304"},"observation_digest":"sha256:b856d916adb26ac445465365b5ca5f5d6ae6f405b1d854c276be69613ee27daf","observation_id":"43a7523c-6bcd-458c-99e3-93373f502447","resolution":{"observed_at":"2026-06-29T06:23:08.736501Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.25034/citation-record","integrity":"/paper/2605.25034/integrity","json":"/paper/2605.25034/citation-record.json","paper":"/paper/2605.25034"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T23:49:53.122613Z","title":"Using ridge regression with genetic algorithm to enhance real estate appraisal forecasting","venue":null,"work_id":null,"year":2012},"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":1,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:9278108aa92d3c19a4f3021f782b3af5e5c7a5350c6e96e4b6ba9b01b2f8f209","observation_id":"8a7dddbf-779c-4801-b303-23d3771b889f","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"On partially randomized e xtended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems","venue":null,"work_id":null,"year":2019},"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":2,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a42e045ed9d5bd53faad900e119850b320581023b6d6f034b1360f91d9526ca7","observation_id":"2ec49ab6-1931-4bfa-82bc-eef9d63ff8c9","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"On greedy randomized augm ented Kaczmarz method for solving large sparse inconsistent linear systems","venue":null,"work_id":null,"year":2021},"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":3,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:e67147bfaa17ffcb6f7cf246aa844430b24b57cdf1b55d87c211e32765ed1e1b","observation_id":"e110e74e-01bc-42fd-84c9-9ff6a8a2351f","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"SIAM, 2024","venue":null,"work_id":null,"year":2024},"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":4,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:81525c4a271acfe384b6397076b1fe8dec4d836ed48adb85a12faf9f07c04901","observation_id":"40abe120-4f81-4eba-aaa0-c9090ec91f07","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"LIBSVM: a library for support vector machines","venue":null,"work_id":null,"year":2011},"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":5,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a51245ad14c5c666d7c98cc37553433233b8c96b7151372ef98d23fd1971d998","observation_id":"065e6440-88bc-49b5-9863-fc2f22f63448","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Tight upper bounds for the convergence of the rand omized extended Kaczmarz and Gauss- Seidel algorithms","venue":null,"work_id":null,"year":2019},"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":6,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a6c3291f2f4ddac4fe8f889cd07c15306af52cfda3054c84fe2fe7aef77c3714","observation_id":"1e0cb6a3-c3b3-417b-b0b3-e543aa13b280","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Randomized extended average block Kaczmarz for solving least squares","venue":null,"work_id":null,"year":2020},"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":7,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a72f94e4637bf8d17156a369e27ee3bdc4d97cdda37a642bcb099c184edbf754","observation_id":"9a9421c3-44d3-41e2-acd6-f0f1f14dd2ac","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Accelerated, para llel, and proximal coordinate descent","venue":null,"work_id":null,"year":1997},"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":8,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:3fdaeed9e8398828f2848091c2899fbb2291021451077d3aa3d56d2fc873e00a","observation_id":"24046919-9935-4995-98cb-a85ce56c13e5","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"LSMR: An iter ative algorithm for sparse least-squares problems","venue":null,"work_id":null,"year":2011},"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":9,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:c09eaa2b17ce48c23fef1e92fad18f133d19737e1fcfecb7263141584be6a356","observation_id":"463dd8a6-0f0c-4eb0-9615-d477b1069ae0","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11235","last_updated":"2024-03-09T13:28:29Z","snapshot_observed_at":"2026-07-06T14:44:56.245065Z","submitted_at":"2023-01-26T17:18:36Z","title":"Handbook of Convergence Theorems for (Stochastic) Gradient Methods","version":3},"cited_work":{"arxiv_id":"2301.11235","doi":"10.48550/arxiv.2301.11235","metadata_source":"arxiv_reference","pith_arxiv_id":"2301.11235","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Handbook of convergence theorems for (stochastic) gradient methods.arXiv preprint arXiv:2301.11235","venue":"arXiv (Cornell University)","work_id":"dc7b33e2-4ddd-47b1-ab42-c2de5a7bbff6","year":2024},"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":10,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"cited_paper":"/paper/2301.11235","citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:53439614bc883002479382ef5320e88ff93da5678b574070809f64ea1d62cbab","observation_id":"2bd3db27-9633-4171-a764-620190520e56","resolution":{"observed_at":"2026-06-29T23:54:03.385731Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T23:49:53.122613Z","title":"Ri dgeSketch: a fast sketching based solver for large scale ridge regression","venue":null,"work_id":null,"year":2022},"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":11,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:d17c2ab3e428e270c2f34ad281cf0f7c718c66815a8d6e9c727544743c532a8d","observation_id":"aaa4a848-d522-463d-9928-22f4946539ef","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Matrix computations","venue":null,"work_id":null,"year":2013},"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":12,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:18936c53b264c61c7ebc4f6e4fc6545e17bfa858e2f093eace9b7cb98df1f96f","observation_id":"b9691d25-a2b3-4f52-81d0-7cf39518658a","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Alge braic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photogra phy","venue":null,"work_id":null,"year":1970},"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":13,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:f7594df09b31bd7823c51b08e06fda6ebf5133329d80d48c8732e54c36b14996","observation_id":"97fc121f-a18f-4f52-95f0-d96b8fb0ee0d","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Gower and Peter Richt´ arik","venue":null,"work_id":null,"year":2015},"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":14,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:e45926b93846749014f23df041a47969f790ed441066a248ee3113feb5aeb585","observation_id":"095ee747-9108-4337-b937-07afec533ef4","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Variance-reduced methods for machine learning","venue":null,"work_id":null,"year":1968},"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":15,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:15cfd7dcf95fc045d2c6bdabdca902d4d08c22b87714a786a395456f2d20fc23","observation_id":"d234a9a0-4d72-48b7-a9bb-8a3434f23ced","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Randomized Doug las–Rachford methods for linear systems: Improved accuracy and efficiency","venue":null,"work_id":null,"year":2024},"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":16,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:87552531a4b0714b5af30a1b87205758d102a8b312efd8956216fdbb3bc9337f","observation_id":"24a81738-9318-4d09-9300-5c3e174593d4","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"On pseudoinverse-free random ized methods for linear systems: Unified framework and acceleration","venue":null,"work_id":null,"year":2026},"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":17,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:21f0a3dd8aa8d0749d9c68d2516d6bfacca080bcfa0c1df930e5d8e3e88846b3","observation_id":"4e029e0b-a18c-43e0-aea6-bade8b16d716","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Regularization tools: A Matlab p ackage for analysis and solution of discrete ill-posed problems","venue":null,"work_id":null,"year":1994},"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":18,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:52fc71774e260f3799356002794b058a3db87b7fa84999eaa77607723790442b","observation_id":"8f3b8214-a5f7-41f8-a1bd-392012c79a15","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Rows v ersus columns: Randomized Kaczmarz or Gauss-Seidel for ridge regression","venue":null,"work_id":null,"year":2017},"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":19,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:bc6f98bab991478583ea010c5b5ebc375715cb88b9f4f2583557545f710777f6","observation_id":"0a163d7c-72a0-4b17-b276-0a0a167e8e70","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Algebraic reconstr uction techniques can be made computation- ally efficient (positron emission tomography application)","venue":null,"work_id":null,"year":1993},"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":20,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a6a93adf75e91ac7ab62e300217af197e23446846c2972674c27f107731a65a7","observation_id":"a930530b-87cb-4f09-8fa4-aa570eaa5f19","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Methods of con jugate gradients for solving linear systems","venue":null,"work_id":null,"year":1952},"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":21,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:0b1b20d933dd3cf524c954f738ad3552f3ce3708569a22711c66cc0061fc0607","observation_id":"45df4351-c513-4b02-8628-09df9ce20302","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Kaczmarz algorithm for Tikhonov regularization problem","venue":null,"work_id":null,"year":2013},"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":22,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:9b1ea7f17bafe809c7dda942b31b9fdf6631580aa5c032c61d036ab9c962b55d","observation_id":"1407acf6-dd57-4f1c-a5dc-5b679809aace","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Efficient accelerated coor dinate descent methods and faster algorithms for solving linear systems","venue":null,"work_id":null,"year":null},"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":23,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a7919d710fedd17b4d5f9e056daba06886222946d56972b78ffa813902fab17d","observation_id":"05d104d8-9120-411e-9a15-cc6f3e81c4c9","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Randomized method s for linear constraints: convergence rates and conditioning","venue":null,"work_id":null,"year":2010},"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":24,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:bc4f25dd89354d736498215da06b9a5ea5ec21035296e3b24f176cf0163d2423","observation_id":"e889b811-f100-4dd8-974f-89b794d84893","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"An accelerated ra ndomized proximal coordinate gradient method and its application to regularized empirical risk mi nimization","venue":null,"work_id":null,"year":2015},"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":25,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:fc54ff7473bdc59ba7f634d484f02daa3a5ac0048e73d6409d68eec8999b64b9","observation_id":"153cd254-080a-4fde-bf42-ee60f43be660","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"An accelerated randomized Ka czmarz algorithm","venue":null,"work_id":null,"year":2016},"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":26,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:d4ed254f4ef228b3d286e7de85152a8a733e044d511dd643d98a7f21f9ce8ade","observation_id":"48ddf238-3096-4481-9460-be2da25ac005","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Momentum and stoc hastic momentum for stochastic gradient, newton, proximal point and subspace descent methods","venue":null,"work_id":null,"year":2020},"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":27,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:d69fc7a9a8dd857a9b833c08a58a2b59d7c3adfbd4afc05e196b0051ab563a7e","observation_id":"76aa2ccb-692a-4415-b011-ed5fe2f3bdc0","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Minimal error mom entum Bregman-Kaczmarz","venue":null,"work_id":null,"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":28,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:fcdc572611eb3affc635764fecaeefcdd73184f7abbc30cf1ddfc2541c9cff95","observation_id":"99d6f393-1094-4e5c-b5cc-50bccaccb227","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Convergen ce properties of the randomized extended Gauss–Seidel and Kaczmarz methods","venue":null,"work_id":null,"year":2015},"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":29,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:43bc188cb1808cd2abfd5b653f2603f2fb33d60bf9ec7a4488631602162073d6","observation_id":"2f99528e-3952-459c-b396-b8a5646e433c","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Faster randomized block Kaczmarz algorit hms","venue":null,"work_id":null,"year":2019},"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":30,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:8101086104db0db19473caea53658ef3ff1d09c05206888be0e646841da61841","observation_id":"fb35eeec-bce7-4f36-b10a-9162287ecd3a","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Randomized sketch desc ent methods for non-separable linearly con- strained optimization","venue":null,"work_id":null,"year":2021},"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":31,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:7cd40b450fb5fb2824bf4c98e873baa4509f372da5000ef9bbc35b6e80cdfb22","observation_id":"d5238801-d7bc-4d8a-a296-20db637203e2","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Randomized Kaczmarz solver for noisy l inear systems","venue":null,"work_id":null,"year":2010},"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":32,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:074061a6251b2193e4538b6c0feac8846a05d2843f3f5502bdcc98431a06634a","observation_id":"9ccbf2c1-d975-4101-9bb4-9d8a085dfec5","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Paved with good intenti ons: analysis of a randomized block Kaczmarz method","venue":null,"work_id":null,"year":2014},"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":33,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:53b8f9d6681d305f0c02f90830175b1b345392a077310e3f1296a07c95f0ca7d","observation_id":"7a64b0e0-6773-4532-9b38-aba67027d7e8","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Efficiency of coordinate descent methods on huge-scale optimization problems","venue":null,"work_id":null,"year":2012},"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":34,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:ae11e82c71746237e9ba497f5dc8ae6277d0be261e1b712be76b0a819ce929a8","observation_id":"f134ffb9-9f03-46ed-8253-26a0d50c28ec","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Introductory lectures on convex optimization: A basic cour se, volume 87","venue":null,"work_id":null,"year":2003},"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":35,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a15eba81d50c4dcb0493ce48bcb529bdb32e24202d315c29c7d1259edc53f5ff","observation_id":"1398cb08-e48c-493e-9e0c-8990bc5d2405","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"A method for solving the convex progra mming problem with convergence rate O(1 /k2)","venue":null,"work_id":null,"year":1983},"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":36,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:b84b52c151be3cd3cfe3dce1793198e3cd2f3fac1afdebc779b6e21cbb82d9a5","observation_id":"43556b88-e920-445a-a277-4faa30d15ffd","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"M-IH S: An accelerated randomized precondition- ing method avoiding costly matrix decompositions","venue":null,"work_id":null,"year":2023},"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":37,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:4c10b8e477d982601a8decfb5fd6c9ee42c9686d6858af81cb95dba8e58bbc46","observation_id":"f98a7621-f706-4331-96c0-8f6e5acff8ea","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"LSQR: An alg orithm for sparse linear equations and sparse least squares","venue":null,"work_id":null,"year":1982},"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":38,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:76adbe182d04e6594f8ec0e3b642dd2f864a712ebf3956dca1f031f2cb88ddbf","observation_id":"37e8da7c-1eb9-43ba-a947-d24865c49b86","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Some methods of speeding up the converge nce of iteration methods","venue":null,"work_id":null,"year":1964},"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":39,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:91617ad63a50d3b7d2800b217fe2b403afaa99e056a9151c5f31c429b240eb89","observation_id":"0fc8a6c0-e4f8-46d7-99dc-85a76bde0d10","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Extensions of block-projections met hods with relaxation parameters to inconsistent and rank-deficient least-squares problems","venue":null,"work_id":null,"year":1998},"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":40,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:39fe269b46a922acef5ca4a070b2b1a7a271858a71cac78270086566ab7d9548","observation_id":"a0c35475-af0b-4792-a6b0-5613a04c67ef","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Characterization of the solutions se t of inconsistent least-squares problems by an extended Kaczmarz algorithm","venue":null,"work_id":null,"year":1999},"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":41,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:ffc65ce94201bc9dc50da786f0fdb670548efba69b2802d24d49dd64dcdfc070","observation_id":"92826dd8-667b-4d87-8730-29eff26a0abe","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"An efficient ridge regression algorithm with pa rameter estimation for data analysis in ma- chine learning","venue":null,"work_id":null,"year":2022},"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":42,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:a4b953fc3e7c58828df0d3af6ae5d299acc367c8aee0fa6b966bd6e2c9eed229","observation_id":"cbb7ea9c-b90f-4aaf-a455-699c6687bf7e","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Generalized Gearhart-Koshy accelera tion for the Kaczmarz method","venue":null,"work_id":null,"year":2023},"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":43,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:fc7deb0de8d64eb9f89b6116e1253dbec281b4758a4eab8dc42e08d8e70cad62","observation_id":"eeb263c4-5889-4669-8759-7e83fd165d33","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Sparse linear least -squares problems","venue":null,"work_id":null,"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":44,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:8529d0f9c222e603fd19f2bc4b36445762b72b505826546cef473742ff1781ae","observation_id":"7b2082f3-3a0b-4cad-81d4-c9412ba571b4","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"A randomized Kacz marz algorithm with exponential conver- gence","venue":null,"work_id":null,"year":2009},"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":45,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:18940ef37bd0552362ee4ead597c042aac47e85032e3a9839b1a7ffa8dc55e0e","observation_id":"08fd79f0-2fc6-4820-b8fb-1f23a84533b7","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"On gree dy multi-step inertial randomized Kaczmarz method for solving linear systems","venue":null,"work_id":null,"year":2024},"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":46,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:506b06ee18ace397ff5261d641f355b8e4cf153253225c06bff5ba3899c893d3","observation_id":"4c61d44a-3f08-4b69-8cce-17e64bb4387b","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-07-06T21:31:02.262018Z","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:4f067ecf7c0c5f71368ae0c74c98228a67020c6673a3b3e4f43f3c37ab590d55","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-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.05816","last_updated":"2026-04-07T12:51:44Z","snapshot_observed_at":"2026-07-06T22:54:26.231593Z","submitted_at":"2026-04-07T12:51:44Z","title":"Linear convergence of Gearhart-Koshy accelerated Kaczmarz methods for tensor linear systems","version":1},"cited_work":{"arxiv_id":"2604.05816","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.05816","snapshot_observed_at":"2026-06-29T23:54:03.389581Z","title":"Linear convergence of Gearhart-Koshy accelerated Kaczmarz methods for tensor linear systems","venue":"math.NA","work_id":"d9b83327-b1f6-4c59-8893-e48a85070f8e","year":2026},"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":48,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"cited_paper":"/paper/2604.05816","citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:07907c1297c15a8eb831c600320d7966ac57fccdb882062d929622d285ec91a1","observation_id":"f51ba942-a0b6-4364-baba-557456805c3c","resolution":{"observed_at":"2026-06-29T23:54:03.390740Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T23:49:53.122613Z","title":"Coordinate descent algorithms","venue":null,"work_id":null,"year":2015},"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":49,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:17931546c4f1a1f6af045f8ad3d08bbbd36c8b7318652a3a2fc5da4538d39cf0","observation_id":"fedcc3f4-4933-42e3-9752-84459e05a44f","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Randomized itera tive methods for generalized absolute value equations: Solvability and error bounds","venue":null,"work_id":null,"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":50,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:d35b3188fe44509e38466b9a2f272683ea96c2d83f3bee0f427df8e3364d9049","observation_id":"f5f220cd-0453-4033-a2bb-882813f1c7b5","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"Local ridge regre ssion for face recognition","venue":null,"work_id":null,"year":2009},"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":51,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:7bec9acc5781415f1f94ed14098142c3ca741bbbf0fb42b8df020c98274226c0","observation_id":"5b14d9f9-4e4b-4ce8-9b90-ad4fcf7c9636","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":"On adap tive stochastic heavy ball momentum for solving linear systems","venue":null,"work_id":null,"year":2024},"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":52,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:986b0345bce5727c87d174b8c5376d1be75ef1fdd2ce39cebb8f3ebb73acc954","observation_id":"77c3b5e7-a91d-49d9-acf4-8a78c030a6e1","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/mcom/4168","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On adap tive stochastic extended iterative methods for solving least squares","venue":"Mathematics of Computation","work_id":"3ace1d3e-07ed-4d5c-9010-033c3a52068a","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":53,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:3deac8ad12e28b3465068f8d3c745fb923b6104278218752cbe6b5e697288965","observation_id":"1514a95e-02f5-4060-816f-eb820f31ae9f","resolution":{"observed_at":"2026-06-29T23:54:02.354304Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T23:49:53.122613Z","title":"Stocha stic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimi zation","venue":null,"work_id":null,"year":2026},"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":54,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:bbacfd753f8e0fb4fc6844598de41c9d35b2e3dc8c00e16e93edc4cf63c66922","observation_id":"cccba5d3-0ef7-4efd-83d6-57fb9eebd2cb","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","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-06-29T23:49:53.122613Z","title":null,"venue":null,"work_id":null,"year":2013},"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":55,"source":"pdf_text","source_observed_at":"2026-06-29T23:49:53.122613Z"},"links":{"citing_paper":"/paper/2605.25034"},"observation_digest":"sha256:9774671f2631ca276910b652df599ebdcd2bc1ea85c063d56e80bd3acab532e7","observation_id":"3aba115a-8a41-475f-9e79-5b87b3f60c1a","resolution":{"observed_at":"2026-06-29T23:49:53.122613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.25034","last_updated":"2026-05-24T12:22:00Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-03T22:01:17.750102Z","submitted_at":"2026-05-24T12:22:00Z","title":"Randomized conjugate gradient least squares"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":51,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":55},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 1 inbound Pith citation observation for arXiv:2605.25034."}