{"as_of":"2026-08-08T22:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:589e76c6ffa03a1d4813f814b600ed525d08876bc720c2febbc35aae9c7307f9","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:49:00.506761Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-05-10T18:56:16.182901Z","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-05-10T23:40:53.124754Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"cited_work":{"arxiv_id":"2508.21022","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21022","snapshot_observed_at":"2026-06-10T02:10:32.037858Z","title":"A sketch-and-project analysis of subsampled natural gradient algorithms","venue":null,"work_id":"6ae8c08b-dd76-4bdc-b748-5f4ead469d88","year":2025},"citing_paper":{"arxiv_id":"2604.05230","last_updated":"2026-04-06T22:52:34Z","snapshot_observed_at":"2026-07-06T22:54:00.211106Z","submitted_at":"2026-04-06T22:52:34Z","title":"Curvature-Aware Optimization for High-Accuracy Physics-Informed Neural Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T18:56:16.182901Z"},"links":{"cited_paper":"/paper/2508.21022","citing_paper":"/paper/2604.05230"},"observation_digest":"sha256:6ac574a73720641b30675d146cadd2965eafb463c96006e14fd76b3446112506","observation_id":"4172860e-e19f-4c91-b656-480e3da822d8","resolution":{"observed_at":"2026-06-10T02:10:32.037858Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.21022/citation-record","integrity":"/paper/2508.21022/integrity","json":"/paper/2508.21022/citation-record.json","paper":"/paper/2508.21022"},"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-05T14:49:01.867334Z","title":"Convergence of variational M onte C arlo simulation and scale-invariant pre-training","venue":null,"work_id":"bf2c6e19-425d-4e58-87af-d4e537b61999","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.145630Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:72b2c29a28aacce2daf3457555104587c8d29d50fee6c8cb555e8857b0c0bf7d","observation_id":"de6316a1-6906-48df-81e1-8f28f0e20209","resolution":{"observed_at":"2026-08-05T14:49:01.884953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.831056Z","title":"Natural gradient works efficiently in learning","venue":null,"work_id":"6f3c42f0-ef6c-46f0-8371-298745aa7acb","year":1998},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.151853Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:80558350e9a5577e6f92ce190a0a154d74eaaad94741018447a10e1954f79d3b","observation_id":"daa8b3e1-376d-4e6d-8d50-73113679757b","resolution":{"observed_at":"2026-08-05T14:49:01.841797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.10835","last_updated":"2025-07-14T22:07:38Z","snapshot_observed_at":"2026-08-06T17:21:40.542756Z","submitted_at":"2025-07-14T22:07:38Z","title":"Functional Neural Wavefunction Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.10835","snapshot_observed_at":"2026-08-05T14:49:00.159186Z","title":"Functional neural wavefunction optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.159186Z"},"links":{"cited_paper":"/paper/2507.10835","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:687dfabc8f130cfe8782615edd844a74c6f43abe077dadecd58e9b29e384849c","observation_id":"2cd01106-a8b5-41d1-89ca-b4ee030acf28","resolution":{"observed_at":"2026-08-05T14:49:00.159186Z","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-05T14:49:01.798124Z","title":"Stochastic (approximate) proximal point methods: Convergence, optimality, and adaptivity","venue":null,"work_id":"c162b52d-b51e-49c0-a7b6-d395cf024d49","year":2019},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.165301Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:705942c9ad122dc872be1eadfd01171150c8171a9b091f2c736efe7c7e8f19d3","observation_id":"be8ecc07-a232-44eb-a0ac-e7ad0baa68b4","resolution":{"observed_at":"2026-08-05T14:49:01.811503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.171127Z","title":"Incremental proximal methods for large scale convex optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.171127Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:b3433e86a74578e9c76773b921326ab5c3989799c3ae6235084c5dd1b3475d28","observation_id":"73a66fba-6894-40ef-9865-ab1719645d1f","resolution":{"observed_at":"2026-08-05T14:49:00.171127Z","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-05T14:49:01.748310Z","title":"Exact and inexact subsampled N ewton methods for optimization","venue":null,"work_id":"6491a716-f207-4f98-a4a8-d1463e5bc687","year":2019},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.176917Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:94cd6d460e580a1f486eb2abecbfa40cbb3427d00d9edac2a8df5a2773c77a78","observation_id":"742a798d-7be0-41c9-a1ff-5a643cac1ada","resolution":{"observed_at":"2026-08-05T14:49:01.757853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.184067Z","title":"Optimization methods for large-scale machine learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.184067Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:ca21b8379bfdc42b1a00fea2cf15522b2521569052bb191fb9af9f0759f4fb82","observation_id":"ccd96d14-452f-4294-81a9-de794976b1f9","resolution":{"observed_at":"2026-08-05T14:49:00.184067Z","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-05T14:49:01.708368Z","title":"Learning the ground state of a non-stoquastic quantum H amiltonian in a rugged neural network landscape","venue":null,"work_id":"76a1962f-86bc-4650-be31-6755948379f8","year":2021},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.189990Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:e6939b5a1fe6e13660bf43361fde7db9db4f6eaa6878a2ecb7a12704bda1b2ad","observation_id":"1ad99cec-ea44-402b-856b-1ac3ee9ab812","resolution":{"observed_at":"2026-08-05T14:49:01.714841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11675","last_updated":"2019-09-25T15:28:33Z","snapshot_observed_at":"2026-07-06T07:56:03.252728Z","submitted_at":"2019-05-28T08:30:24Z","title":"Gram-Gauss-Newton Method: Learning Overparameterized Neural Networks for Regression Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11675","snapshot_observed_at":"2026-08-05T14:49:00.196171Z","title":"Gram- G auss- N ewton method: Learning overparameterized neural networks for regression problems","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.196171Z"},"links":{"cited_paper":"/paper/1905.11675","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:b1121a753d389b2e3bf68855946a9ee8c08cdd2301e22bc19a9016b4b32d4afd","observation_id":"e1a7367f-3f7e-4917-ab79-c3e1861516b4","resolution":{"observed_at":"2026-08-05T14:49:00.196171Z","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-05T14:49:01.683798Z","title":"Solving the quantum many-body problem with artificial neural networks","venue":null,"work_id":"0c34ae3a-bd61-4f37-ae94-f317ebca92da","year":2017},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.201844Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:4d20202d91532860e0c375f6bca65680d4414b50178f30d98e3a99a2521d4c27","observation_id":"76a1752b-9343-4130-bd23-f93fffe123d3","resolution":{"observed_at":"2026-08-05T14:49:01.691854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.659552Z","title":"Empowering deep neural quantum states through efficient optimization","venue":null,"work_id":"f02e2bf4-4405-4e59-9dc8-8f9a0df9f22b","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.207738Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:98709dc6ae4445243a8d3d2eba087c883d19d031e97c76e39172339363882637","observation_id":"e7b77d1c-4eea-4d33-99cc-dc35d0036c4e","resolution":{"observed_at":"2026-08-05T14:49:01.665829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.641153Z","title":"Kronecker-factored approximate curvature for physics-informed neural networks","venue":null,"work_id":"34e14e01-e7d8-4c4f-abe4-e6718304158a","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.212775Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:c7e3d47210ba6777366a12ef2e77dc41f409206a8a6d4b2a236138f66f2475f3","observation_id":"c2cdfa77-2d01-4dd6-8c52-e194aac14364","resolution":{"observed_at":"2026-08-05T14:49:01.646967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.624033Z","title":"Stochastic model-based minimization of weakly convex functions","venue":null,"work_id":"9ae51c3c-c557-405c-8e4f-b7c88972630e","year":2019},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.218023Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:610e0ae3b70829b6fa43ca2734656d2be3d4c1a750f91c7ab2c95b127eb79539","observation_id":"3102763a-9f97-4ff0-8ac8-77d920f93fda","resolution":{"observed_at":"2026-08-05T14:49:01.629482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.224458Z","title":"Sharp analysis of sketch-and-project methods via a connection to randomized singular value decomposition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.224458Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:bb8bd0ce4cc63612a73c32c51bcc239b28ffab5af1c658e331e6596dc45be8d2","observation_id":"3553b4b1-1c2e-4555-b491-ee2434bbd00c","resolution":{"observed_at":"2026-08-05T14:49:00.224458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05818","last_updated":"2025-06-17T04:24:53Z","snapshot_observed_at":"2026-07-06T18:12:09.623654Z","submitted_at":"2024-05-09T14:56:49Z","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","version":2},"cited_work":{"arxiv_id":"2405.05818","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.05818","snapshot_observed_at":"2026-08-05T14:49:01.018989Z","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","venue":"cs.DS","work_id":"8501b053-30a4-48ac-8175-5e7d2270fe86","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.230545Z"},"links":{"cited_paper":"/paper/2405.05818","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:badbfaa0390c52ba7c26cd08e3bab2cc64fdb129841a45d6248b672903bea26e","observation_id":"eea4c31e-bf3e-42bc-9386-e7dde08c9776","resolution":{"observed_at":"2026-08-05T14:49:01.026155Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11673","last_updated":"2025-07-29T01:40:18Z","snapshot_observed_at":"2026-07-06T20:23:31.551214Z","submitted_at":"2025-01-20T18:55:51Z","title":"Randomized Kaczmarz Methods with Beyond-Krylov Convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11673","snapshot_observed_at":"2026-08-05T14:49:00.238671Z","title":"Randomized K aczmarz methods with beyond- K rylov convergence","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.238671Z"},"links":{"cited_paper":"/paper/2501.11673","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:54b10e4bf89877fa398a0f270f8561a9b49b258184f31ba111fbcaefa57f09f8","observation_id":"91546ce5-0fef-46f0-9642-ad475273b6c7","resolution":{"observed_at":"2026-08-05T14:49:00.238671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.19877","last_updated":"2025-04-10T05:23:08Z","snapshot_observed_at":"2026-07-06T19:59:01.756640Z","submitted_at":"2024-11-29T17:39:17Z","title":"Randomized Kaczmarz with tail averaging","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.19877","snapshot_observed_at":"2026-08-05T14:49:00.244912Z","title":"Randomized Kaczmarz with tail averaging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.244912Z"},"links":{"cited_paper":"/paper/2411.19877","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:33d2b3f77e4edd49e4236c12a775c628b1575597cf318f094a0faa00c29dfd85","observation_id":"967713e3-67a4-49b8-9684-23ed1cbf2d3d","resolution":{"observed_at":"2026-08-05T14:49:00.244912Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11235","snapshot_observed_at":"2026-08-05T14:49:00.254125Z","title":"Handbook of convergence theorems for (stochastic) gradient methods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.254125Z"},"links":{"cited_paper":"/paper/2301.11235","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:77a9d0fbfa4aa9fd5a2abda54da632f865fe563d49243006df1f038578bdd98b","observation_id":"b4394677-3d40-4776-9022-79941a13b3bd","resolution":{"observed_at":"2026-08-05T14:49:00.254125Z","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-05T14:49:01.570322Z","title":"A K aczmarz-inspired approach to accelerate the optimization of neural network wavefunctions","venue":null,"work_id":"124b5eb2-cc3a-4412-bbc3-c3fbe33abcde","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.264777Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:8a58eaab28e70b97719dd77a717f2cdc8c56a00efee3da3a094d155f5dd8211a","observation_id":"c3d9a9be-f8e2-40ff-ab1a-87e73c5bd4b2","resolution":{"observed_at":"2026-08-05T14:49:01.577063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.00882","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.910268Z","title":"Worth their weight: Randomized and regularized block Kaczmarz algorithms without preprocessing","venue":null,"work_id":"42cc4e81-82de-405e-bce6-1ee040003056","year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.270977Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:40f1d215670c39b0d1c13f4cd0072a5b8f728d072c12292e73c6001e864f97d3","observation_id":"94aa17a4-d3e5-47ec-9621-149cf688b72b","resolution":{"observed_at":"2026-08-05T14:49:00.919801Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.537668Z","title":"Accelerated stochastic matrix inversion: general theory and speeding up BFGS rules for faster second-order optimization","venue":null,"work_id":"e8ef2bae-382e-4964-af13-8b16d21b6c6c","year":2018},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.277116Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:d4263e0e4bf67af4ca522c051336210d073862d6b9e31db14795068a89231289","observation_id":"372524bc-7f3f-42a3-85b1-bb107e4836f0","resolution":{"observed_at":"2026-08-05T14:49:01.547402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.283175Z","title":"Randomized iterative methods for linear systems","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.283175Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:2d4a4ef4d4f8f8be844dc927afbec73decdbee61626e0ef4e4a19ca7e6b02d9b","observation_id":"18c8985c-fc75-429d-b7be-f6fb1617a07e","resolution":{"observed_at":"2026-08-05T14:49:00.283175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.02644","last_updated":"2025-07-10T14:46:55Z","snapshot_observed_at":"2026-08-06T20:21:45.833697Z","submitted_at":"2025-07-03T14:08:25Z","title":"Solving the Hubbard model with Neural Quantum States","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.02644","snapshot_observed_at":"2026-08-05T14:49:00.288533Z","title":"Solving the H ubbard model with neural quantum states","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.288533Z"},"links":{"cited_paper":"/paper/2507.02644","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:a2e4ee73f2851226a24451a47f46800e4148f4229626cf7071ab92fe77d6b78d","observation_id":"e8a55508-3746-4116-b34f-c3e8cef3ce84","resolution":{"observed_at":"2026-08-05T14:49:00.288533Z","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-05T14:49:00.294730Z","title":"Improving energy natural gradient descent through woodbury, momentum, and randomization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.294730Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:89da900c88a0c99731b451d71bab8466eb67645d926b0099ecaef2b9d5ba567e","observation_id":"565772f5-fb68-4656-b2d3-5db6955e5216","resolution":{"observed_at":"2026-08-05T14:49:00.294730Z","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-05T14:49:01.495967Z","title":"a tzle, and Frank No \\'e . Deep-neural-network solution of the electronic S chr \\","venue":null,"work_id":"25e26fca-0e5f-4e48-84a0-a63cb3c4e119","year":2020},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.301582Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:61e1a2178259a064b9ce3eadf4361bb4d2c97bae9f2ae3aafe2b13e094b120c1","observation_id":"09c70ade-d093-45e3-8252-b54e63f4805d","resolution":{"observed_at":"2026-08-05T14:49:01.501629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.477794Z","title":"Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification","venue":null,"work_id":"9a7dd2fc-5deb-49b9-b69c-729e5a4ad7d8","year":2018},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.307137Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:1ee967ac1c7e0bbb62f5adc06bff8b08e5e76fec42649f67ba425658fe750d8b","observation_id":"0fb2fcf4-f2d0-47fd-a322-84bdac11e6b6","resolution":{"observed_at":"2026-08-05T14:49:01.484479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.02570","last_updated":"2025-08-05T13:06:22Z","snapshot_observed_at":"2026-08-08T16:49:12.569180Z","submitted_at":"2025-08-04T16:25:14Z","title":"Neural Scaling Laws Surpass Chemical Accuracy for the Many-Electron Schr\\\"odinger Equation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.02570","snapshot_observed_at":"2026-08-05T14:49:00.312465Z","title":"Neural scaling laws surpass chemical accuracy for the many-electron S chr \\\"o dinger equation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.312465Z"},"links":{"cited_paper":"/paper/2508.02570","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:daa7b83e47edec17419f23be73f6b2ba2d565f396cdce88d6bc05c9d4c443d3e","observation_id":"18684f21-6038-405c-ad2d-aad3ce6d68b7","resolution":{"observed_at":"2026-08-05T14:49:00.312465Z","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-05T14:49:00.318568Z","title":"Characterizing possible failure modes in physics-informed neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.318568Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:62e92d31063a374e48986bdab1355d2a97f166a275021c2bb88decaaa5594fdf","observation_id":"d971a1a0-0bb5-42d2-81cd-1b2a64ca1dcb","resolution":{"observed_at":"2026-08-05T14:49:00.318568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05753","last_updated":"2025-04-08T07:33:04Z","snapshot_observed_at":"2026-08-07T16:07:38.854741Z","submitted_at":"2025-04-08T07:33:04Z","title":"Accelerated Natural Gradient Method for Parametric Manifold Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05753","snapshot_observed_at":"2026-08-05T14:49:00.323598Z","title":"Accelerated natural gradient method for parametric manifold optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.323598Z"},"links":{"cited_paper":"/paper/2504.05753","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:c1189d96aec6efd456d840ceeb990ca8c6f45af602955c4fe4a6a9671a8dda9f","observation_id":"90835d8f-76f1-4a0e-ab07-27847a9556f3","resolution":{"observed_at":"2026-08-05T14:49:00.323598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10599","last_updated":"2024-03-23T13:26:31Z","snapshot_observed_at":"2026-07-06T15:05:20.182589Z","submitted_at":"2023-03-19T08:29:49Z","title":"Convergence Analysis of Stochastic Gradient Descent with MCMC Estimators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10599","snapshot_observed_at":"2026-08-05T14:49:00.329779Z","title":"Convergence analysis of stochastic gradient descent with MCMC estimators","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.329779Z"},"links":{"cited_paper":"/paper/2303.10599","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:9ba00cc910caff60b4703b3a161ee34e1636cf291d38e65d9d70af7fa88696d0","observation_id":"d1dd41a5-2a9a-4abc-b4cd-9cbed69baf50","resolution":{"observed_at":"2026-08-05T14:49:00.329779Z","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-05T14:49:01.440318Z","title":"Ab initio calculation of real solids via neural network ansatz","venue":null,"work_id":"7e46f42b-89fc-42c7-81fd-8854d85fa5a4","year":2022},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.337367Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:fb47a03f22c815e21c7feed69266026a093baad8f32b1542cd15d066003c99d3","observation_id":"c8b3f353-a3b8-408e-be0a-501ea885112a","resolution":{"observed_at":"2026-08-05T14:49:01.447496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.346006Z","title":"The power of interpolation: Understanding the effectiveness of sgd in modern over-parametrized learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.346006Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:ffc31026aaf856292fea832e3db6896a199d7946d75c67bdcbdc3a3905d09669","observation_id":"e460a45b-dfd0-4749-93f9-b817ddae933f","resolution":{"observed_at":"2026-08-05T14:49:00.346006Z","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-05T14:49:01.403742Z","title":"New insights and perspectives on the natural gradient method","venue":null,"work_id":"d7038c12-b37e-4586-995d-d5998f8e04a0","year":2020},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.352238Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:85b97b3d258eb1211dc665cb5c188594bac3bc38eae4b42d04a264294ac00db2","observation_id":"2787dd6b-bc9c-404b-9c52-1902e26cc8c8","resolution":{"observed_at":"2026-08-05T14:49:01.409239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.378943Z","title":"Fast and furious convergence: Stochastic second order methods under interpolation","venue":null,"work_id":"3fd8d421-42f2-4b5e-8cea-9b4fc1100e65","year":2020},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.359208Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:cbdfbf67a15bca2fb45480e8d5820be3a1c7bc7bd40e975a6cd3a4c4267426f1","observation_id":"1084da51-dfac-42ca-879b-ec64c6c4511c","resolution":{"observed_at":"2026-08-05T14:49:01.387160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.360480Z","title":"Achieving high accuracy with PINN s via energy natural gradient descent","venue":null,"work_id":"f1f14f56-66a7-4848-a138-032ef5f8437d","year":2023},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.368004Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:45eb46fe4dbb918ac09de658f5158f7a5c178600294d3ea7395a7e5b2be2f821","observation_id":"11a40424-44cb-49c1-9a50-46d37d4547a5","resolution":{"observed_at":"2026-08-05T14:49:01.365795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.339917Z","title":"Paved with good intentions: analysis of a randomized block K aczmarz method","venue":null,"work_id":"7901fdfe-2fc3-4071-843f-d2b12cfb5a05","year":2014},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.375043Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:93acd2d6205f774c1575ac08aeac9de80a47329ff53bbfa31bd140dff5b0cf8d","observation_id":"87396a7e-5fd8-4a28-87b0-a05fc9347dec","resolution":{"observed_at":"2026-08-05T14:49:01.346764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.319559Z","title":"Stochastic gradient descent, weighted sampling, and the randomized K aczmarz algorithm","venue":null,"work_id":"298b70fb-d58a-426a-9aed-a484088d1f94","year":2014},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.380427Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:19f287741bd6ae2b2674d69705f49669929b61b8ec8d179815a2af492849e86b","observation_id":"426e60d3-9d3a-4449-8e16-e77c44507119","resolution":{"observed_at":"2026-08-05T14:49:01.325894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.301610Z","title":"Geometry of learning neural quantum states","venue":null,"work_id":"7a5e61ec-99e2-4be5-9d60-b030c6593a0d","year":2020},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.385467Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:f88ebb695e9a0ebd9db319bc9aa7b168affc83a7bfd093179272939b3a14b025","observation_id":"f57e8ee5-2373-4a31-a83a-b45814c0e824","resolution":{"observed_at":"2026-08-05T14:49:01.306620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.281244Z","title":"Ab initio solution of the many-electron S chr \\\"o dinger equation with deep neural networks","venue":null,"work_id":"ec27ae5e-fb7b-48e0-a69f-d481f56e591d","year":2020},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.390803Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:1cae19e01e41727fd654c1acfaffa9e9a1844128c5cae7aef9d62d88112cfbb0","observation_id":"28315eb8-f954-4c5f-908d-71257e9826de","resolution":{"observed_at":"2026-08-05T14:49:01.288348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.396211Z","title":"Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.396211Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:d9dfcaf0e0c69868945dea4a5882f3fb44661f126be82ed7bd7c08877f2e743a","observation_id":"f53da1b9-4d28-4f73-a72a-51f78bba02a1","resolution":{"observed_at":"2026-08-05T14:49:00.396211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01868","last_updated":"2024-06-03T23:35:42Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T19:46:43Z","title":"Challenges in Training PINNs: A Loss Landscape Perspective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01868","snapshot_observed_at":"2026-08-05T14:49:00.401473Z","title":"Challenges in training PINN s: A loss landscape perspective","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.401473Z"},"links":{"cited_paper":"/paper/2402.01868","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:1115abb163de1431a62d4301f2d354e360b78a7399ea336c58be303ed8dc2ab5","observation_id":"e48237f0-31b8-490d-97bc-4de55f4f073b","resolution":{"observed_at":"2026-08-05T14:49:00.401473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.02353","last_updated":"2019-06-05T23:13:42Z","snapshot_observed_at":"2026-07-06T07:58:21.319675Z","submitted_at":"2019-06-05T23:13:42Z","title":"Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.02353","snapshot_observed_at":"2026-08-05T14:49:00.406729Z","title":"Efficient subsampled G auss- N ewton and natural gradient methods for training neural networks","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.406729Z"},"links":{"cited_paper":"/paper/1906.02353","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:a6dfda494ed41815efd6950f734183f8fb3c0014eed31e8ae8e26d07843bb401","observation_id":"1d3b702c-8f56-4255-b2a7-0b712cbf2d65","resolution":{"observed_at":"2026-08-05T14:49:00.406729Z","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-05T14:49:01.252020Z","title":"A simple linear algebra identity to optimize large-scale neural network quantum states","venue":null,"work_id":"d9aa2468-8dd9-40c9-9188-d649f58b3397","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.412731Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:61842f1f280cd38e79271d3181e8e84b0da126aee2f2b2e34a863901613c1b60","observation_id":"6d35c56f-1e4e-4b9a-8256-372edb294e88","resolution":{"observed_at":"2026-08-05T14:49:01.257297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.234549Z","title":"Stochastic reformulations of linear systems: algorithms and convergence theory","venue":null,"work_id":"dbab3a9b-8d77-48d5-89cc-78388e9f32f3","year":2020},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.418215Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:5ba865a708bbf52196ac9d4ead21b8614aed806dfcb4a2e2d324a3408578eeac","observation_id":"8468e88f-24d4-4abf-9eba-4ae11b5cebc9","resolution":{"observed_at":"2026-08-05T14:49:01.239925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1601.04737","last_updated":"2016-02-26T04:04:24Z","snapshot_observed_at":"2026-07-31T17:55:04.199892Z","submitted_at":"2016-01-18T21:59:21Z","title":"Sub-Sampled Newton Methods I: Globally Convergent Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1601.04737","snapshot_observed_at":"2026-08-05T14:49:00.423692Z","title":"Sub-sampled newton methods i: globally convergent algorithms","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.423692Z"},"links":{"cited_paper":"/paper/1601.04737","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:2403b7878498e7513edb60a08bfb09e9bc67671e22995fd58250653f5b1100c3","observation_id":"0420a710-87d3-4d7d-910b-0e59bf2c194c","resolution":{"observed_at":"2026-08-05T14:49:00.423692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1601.04738","last_updated":"2016-02-26T04:06:39Z","snapshot_observed_at":"2026-07-06T04:43:17.092752Z","submitted_at":"2016-01-18T22:04:32Z","title":"Sub-Sampled Newton Methods II: Local Convergence Rates","version":3},"cited_work":{"arxiv_id":"1601.04738","doi":null,"metadata_source":"pith","pith_arxiv_id":"1601.04738","snapshot_observed_at":"2026-08-05T14:49:00.611468Z","title":"Sub-Sampled Newton Methods II: Local Convergence Rates","venue":"math.OC","work_id":"7010bb2d-e1b5-438c-b10c-d2c5dbaeb259","year":2016},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.430573Z"},"links":{"cited_paper":"/paper/1601.04738","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:efa79b2059bac0c71f0b534e227dd8dc891d7f99eb8878d13b9a1fa92b45b3dd","observation_id":"3e33c8db-00e8-4270-8bcc-ea1052eafb6e","resolution":{"observed_at":"2026-08-05T14:49:00.619748Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06087","last_updated":"2025-04-08T14:28:54Z","snapshot_observed_at":"2026-08-07T16:07:29.904538Z","submitted_at":"2025-04-08T14:28:54Z","title":"Accurate Ab-initio Neural-network Solutions to Large-Scale Electronic Structure Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.06087","snapshot_observed_at":"2026-08-05T14:49:00.437542Z","title":"Accurate ab-initio neural-network solutions to large-scale electronic structure problems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.437542Z"},"links":{"cited_paper":"/paper/2504.06087","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:7f963c01e137e50075ef276dd7c294c495e8eab0fb39f1f259f7a317c08e0fd6","observation_id":"6e0e94f5-f6ae-4398-831e-ae48c65b87f1","resolution":{"observed_at":"2026-08-05T14:49:00.437542Z","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-05T14:49:01.216051Z","title":"Unified variational approach description of ground-state phases of the two-dimensional electron gas","venue":null,"work_id":"8eb92c54-a75c-4c3a-8ac9-000b4fe9b188","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.446158Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:2ad461d41f34ef236d9385cdb0c1dcd661a773e2779abf4647e949dfda582aa2","observation_id":"a1785ba3-c2ab-416d-9d7d-814d1e8918ee","resolution":{"observed_at":"2026-08-05T14:49:01.222409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.198081Z","title":"Generalized L anczos algorithm for variational quantum M onte C arlo","venue":null,"work_id":"145eef8f-5f3c-4476-9b4f-aad06ac7fce4","year":2001},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.451960Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:03cab37a17b6366f2ecf4aa015a43fa15591a5d808ec8a9f5cbe2dc788b6f6a0","observation_id":"55c51297-8596-41aa-a290-e937b1e71e37","resolution":{"observed_at":"2026-08-05T14:49:01.203104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.457966Z","title":"When and why PINN s fail to train: A neural tangent kernel perspective","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.457966Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:cd344a30ad81a265872829feb8f84cbb1e6e2d3e0783638ea9411dcd45fb6b52","observation_id":"9db7b86d-f13a-45df-87e3-d69b26ce9361","resolution":{"observed_at":"2026-08-05T14:49:00.457966Z","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-05T14:49:01.163961Z","title":"Rayleigh- G auss- N ewton optimization with enhanced sampling for variational M onte C arlo","venue":null,"work_id":"e21d9eac-6900-4879-afdd-5008eeb9e26b","year":2022},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.463784Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:0e7d147b038dd3510c8f53b3c4ede46d81990de8896daecb22495148c1fcc954","observation_id":"f99e645f-09c7-4f8b-aff4-0899a4c22c8e","resolution":{"observed_at":"2026-08-05T14:49:01.170851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:01.145131Z","title":"Convergence analysis of an adaptively regularized natural gradient method","venue":null,"work_id":"c3862fc0-4bd9-48a3-86c5-4748bd472cb5","year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.470200Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:a71fc768c4c6c925c101da766ddee1d2aadef1c8ba70944f6d26f6690b8f49d3","observation_id":"655ce2fd-6f64-4446-94c1-f5cf2f96d801","resolution":{"observed_at":"2026-08-05T14:49:01.150515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00573","last_updated":"2025-06-13T11:46:16Z","snapshot_observed_at":"2026-07-06T18:55:37.298696Z","submitted_at":"2024-08-01T14:06:34Z","title":"Convergence Analysis of Natural Gradient Descent for Over-parameterized Physics-Informed Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00573","snapshot_observed_at":"2026-08-05T14:49:00.476226Z","title":"Convergence analysis of natural gradient descent for over-parameterized physics-informed neural networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.476226Z"},"links":{"cited_paper":"/paper/2408.00573","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:c08864d301890f357d9b382134700d5700db064fd07dcdc6a907e1e39d3fc326","observation_id":"2cb46781-6a41-4457-9d95-d86ccdc58040","resolution":{"observed_at":"2026-08-05T14:49:00.476226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05924","last_updated":"2021-03-25T07:39:30Z","snapshot_observed_at":"2026-07-06T09:27:43.917492Z","submitted_at":"2020-06-10T16:17:09Z","title":"Sketchy Empirical Natural Gradient Methods for Deep Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05924","snapshot_observed_at":"2026-08-05T14:49:00.481788Z","title":"Sketchy empirical natural gradient methods for deep learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.481788Z"},"links":{"cited_paper":"/paper/2006.05924","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:4b6330687aabbd2344c537907eaf052d2eca1f2527e470729474c4c4c094ad18","observation_id":"f6c1b974-166c-428b-aee3-aa490639e8b1","resolution":{"observed_at":"2026-08-05T14:49:00.481788Z","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-05T14:49:01.124629Z","title":"Fast convergence of natural gradient descent for over-parameterized neural networks","venue":null,"work_id":"9d8506f6-176f-4011-aaff-386c832daf7b","year":2019},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.489060Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:c8f352cab8e91dc1032072a7fa25153ce476f24896b07cdd13828272e8e9b5d2","observation_id":"48322d87-6968-4431-bc0f-bb28f07f1c60","resolution":{"observed_at":"2026-08-05T14:49:01.131699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:00.494243Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.494243Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:0c486dd184ce9cc280529a613690b46b923334d981ea11662d995864f7470e93","observation_id":"0e811519-ea3d-4683-ad1d-314c82de2943","resolution":{"observed_at":"2026-08-05T14:49:00.494243Z","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-05T14:49:00.500676Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.500676Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:bb438b9b6753903506f5cf8bd6c26d09043558eb90e29743fcbbff2f295082e6","observation_id":"581af0a2-0d1e-48da-bd8f-a0fb71614bf7","resolution":{"observed_at":"2026-08-05T14:49:00.500676Z","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-05T14:49:00.506761Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.506761Z"},"links":{"citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:276bad63773d3a1f5d64dcd5b71fd63dcae8d8a6ad17dc11b15931555472c38a","observation_id":"eacf04f2-5573-4232-9cd2-01b0299682b7","resolution":{"observed_at":"2026-08-05T14:49:00.506761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":3,"verified_fuzzy":28},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 1 inbound Pith citation observation for arXiv:2508.21022."}