{"as_of":"2026-08-14T20:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6734fa6a48842d024fae6f133225284b8da1741eb72a380b005d8b6ab2a56c1b","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T13:56:23.354620Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.15941/citation-record","integrity":"/paper/2501.15941/integrity","json":"/paper/2501.15941/citation-record.json","paper":"/paper/2501.15941"},"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-10T13:56:24.323234Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods.Journal of Machine Learning Research, 18(221):1–51, 2018","venue":null,"work_id":"afee94ed-341e-4f75-86c4-53800191885f","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.929494Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:c77dd93fd70a971c32476b034418888d9f6c528ee900c35223dbc01e35f703d0","observation_id":"9e68bc43-b433-43d6-b937-0563dfcf9ddc","resolution":{"observed_at":"2026-08-10T13:56:24.328182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.308863Z","title":"Natasha 2: Faster non-convex optimization than sgd","venue":null,"work_id":"b28d7ac3-a7e6-415b-90b3-a2e8057bac1f","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.935098Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:03429857dcdf865d9071d7615348948f04df7786c90c9f8c83b286aa3bc775a0","observation_id":"1224008a-f5d0-4cf9-89fc-0a7aa8a469a1","resolution":{"observed_at":"2026-08-10T13:56:24.313474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.295080Z","title":"Optimal black-box reductions between optimization objectives.Advances in Neural Information Processing Systems, 29, 2016","venue":null,"work_id":"36324bc3-9d86-432f-bf42-a4f0bfe64a5d","year":2016},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.940115Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:ae8d606e4dcf81c301c78f2f96bbf512bead495b6fd05672426598b8ee2ab0b1","observation_id":"9c16467b-d449-4413-8613-deabfb14dc02","resolution":{"observed_at":"2026-08-10T13:56:24.299544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.280651Z","title":"Variance reduction for faster non-convex optimization","venue":null,"work_id":"95beee0e-bc7c-481a-ac84-bf0281e36c91","year":2016},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.945209Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:e666dcb766305b6a450994f6e36be9253909864ca763830880c3b983b509860d","observation_id":"cc1026ab-fa66-49d5-a663-6ac7477b17e0","resolution":{"observed_at":"2026-08-10T13:56:24.285335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:22.950117Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.950117Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:31d6b721b814410e91395f91cda6ed1fd479cb748a3efaa51416354b1cb71b56","observation_id":"c279e3a7-7a2e-400c-96ed-a985afb75044","resolution":{"observed_at":"2026-08-10T13:56:22.950117Z","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-10T13:56:24.256940Z","title":"On the convergence of block coordinate descent type methods.SIAM Journal on Optimization, 23(4):2037–2060, 2013","venue":null,"work_id":"5b36285b-94f3-4005-9f3b-442d2f338b8c","year":2013},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.955145Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:a2a23a10d9082458a13924531be971c76723e25320d2bde4e7ea696ad56fff04","observation_id":"c63d7874-ff72-41cb-ade2-0d2a6ce2e4e4","resolution":{"observed_at":"2026-08-10T13:56:24.261871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.242540Z","title":"A multi-batch l-bfgs method for machine learning","venue":null,"work_id":"f9c16d9f-9911-4255-90c4-0c13ccba89c0","year":2016},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.960800Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:e0b091ef2038e63e9a15f89a9a0db6655b10ef81b7fa51fedf28c3f06ad7dbdd","observation_id":"fedc4dd7-bfb7-401a-904a-4073166c360e","resolution":{"observed_at":"2026-08-10T13:56:24.247276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.228989Z","title":"Convergence rate analysis of a stochas- tic trust-region method via supermartingales.INFORMS Journal on Optimization, 1(2):92–119, 2019","venue":null,"work_id":"2d1dfc07-1856-470e-82e9-6f964ea564f6","year":2019},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.965774Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:4cb3af72b4ae49cdf3b9635df82579bbd8b21cbe083e18439f647fe08616978c","observation_id":"713fffb2-3b44-48b8-8635-b976fa3b3d06","resolution":{"observed_at":"2026-08-10T13:56:24.233426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.215431Z","title":"Exact and inexact subsampled Newton methods for optimization","venue":null,"work_id":"dd78a8cf-37e7-45da-9fc7-e6e6ab337159","year":2019},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.970606Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:95eb7fc1bd0e8be41899ba4bc77a594fa6024b2c5375a2ec84b9b708c2bf3a04","observation_id":"22f85712-26d5-46fe-b521-46d9b47762fc","resolution":{"observed_at":"2026-08-10T13:56:24.219862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.200562Z","title":"A progressive batching l-bfgs method for machine learning","venue":null,"work_id":"f13ad059-4094-4951-852a-051620e4cdf8","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.975444Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:ed34423012b190356479411a391efdab59c23c2596349cf82928c5e3e88a87ed","observation_id":"61cb4b31-dcdf-456a-8339-9bc477327068","resolution":{"observed_at":"2026-08-10T13:56:24.205724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.185099Z","title":"On the use of stochastic Hessian information in optimization methods for machine learning.SIAM Journal on Optimization, 21(3):977–995, 2011","venue":null,"work_id":"b626f64d-b3c3-4a91-94a4-b143b630e53d","year":2011},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.981162Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:c6f28192ecdeb8f1ebb586b337a406ab621e619452305d6c0588b845198a0ecf","observation_id":"6a97abc0-03f5-4b4f-b0a8-04c66c1b47d8","resolution":{"observed_at":"2026-08-10T13:56:24.189922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.170607Z","title":"SAN: stochastic average Newton algo- rithm for minimizing finite sums","venue":null,"work_id":"0dbb746a-b9b5-44f3-b96c-72c4d4b106e5","year":2022},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.987140Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:5f89e6ab77e5828b4688eb052401c7a52978eb0160dd6ad5a9e0a00fe8f09373","observation_id":"74f27e5e-1c97-41a7-a418-dee0b7e35c2f","resolution":{"observed_at":"2026-08-10T13:56:24.175323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.156750Z","title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives.Advances in Neural Information Processing Systems, 27, 2014","venue":null,"work_id":"3f2b3eff-1fd4-4592-a6ba-0d6731d48d91","year":2014},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.991966Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:90b5edebeb29457f49c6afde1e0e30c7330ee6c7854427180b34081813ef9c2d","observation_id":"a8674d4d-fa0f-4bd1-b42d-13348fbc2242","resolution":{"observed_at":"2026-08-10T13:56:24.161301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.142430Z","title":"Stochastic variance-reduced newton: Accelerating finite-sum minimization with large batches","venue":null,"work_id":"6b35c9d5-996d-4e15-84ef-7d7225b87eb6","year":2023},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:22.996500Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:75c6d5e578f6477cfac90132a7bd3dcf084677f5baf13f40de734954b6feeb73","observation_id":"2715eccc-5dfd-47fb-8220-744734428a49","resolution":{"observed_at":"2026-08-10T13:56:24.147549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14742","last_updated":"2023-08-28T17:43:04Z","snapshot_observed_at":"2026-08-13T10:25:32.977342Z","submitted_at":"2023-08-28T17:43:04Z","title":"Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of Newton Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.14742","snapshot_observed_at":"2026-08-10T13:56:23.000956Z","title":"Minimizing quasi-self-concordant functions by gradient regularization of newton method","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.000956Z"},"links":{"cited_paper":"/paper/2308.14742","citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:d90e3fa3fd786bc3a6bdf58aa1d29b571f4578d5d7d0cd2c88882e6f86226406","observation_id":"5cb150ca-d708-4c86-ba45-178d415f9e19","resolution":{"observed_at":"2026-08-10T13:56:23.000956Z","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-10T13:56:24.128008Z","title":"Convergence rates of sub-sampled Newton methods.Advances in Neural Information Processing Systems, 28, 2015","venue":null,"work_id":"794dcc8a-ad19-43cf-99a7-7da84158bbc0","year":2015},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.006008Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:d01d04e26990a5dc3e436e8c4b3f8fa8d8a5153c4c4f8eac6798516b02ffc397","observation_id":"e72cfad6-039f-46b2-b7a5-d9399348f5eb","resolution":{"observed_at":"2026-08-10T13:56:24.132748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.010937Z","title":"Variable selection via nonconcave penalized likelihood and its oracle properties","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.010937Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:15265b5d4929bd27452c1dad40d812f8f013f3b86c3a0321425f867dcd44c50f","observation_id":"1794690a-1ffd-41c0-a251-44ee3ae25e3b","resolution":{"observed_at":"2026-08-10T13:56:23.010937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01088","last_updated":"2024-11-02T00:18:59Z","snapshot_observed_at":"2026-08-02T05:22:18.754526Z","submitted_at":"2024-11-02T00:18:59Z","title":"CRONOS: Enhancing Deep Learning with Scalable GPU Accelerated Convex Neural Networks","version":1},"cited_work":{"arxiv_id":"2411.01088","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.01088","snapshot_observed_at":"2026-08-10T13:56:23.447001Z","title":"CRONOS: Enhancing Deep Learning with Scalable GPU Accelerated Convex Neural Networks","venue":"cs.LG","work_id":"8d1eb4db-9fd4-4f6d-aeb2-26da2cf5d9e2","year":2024},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.015873Z"},"links":{"cited_paper":"/paper/2411.01088","citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:caa98adaf0d26b29ec82fc20a396bc45a9a95af669ed17a03bc445a6463e7eba","observation_id":"5a52081f-e3fe-46b0-8b2e-eed2ea3f37d5","resolution":{"observed_at":"2026-08-10T13:56:23.452127Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.104527Z","title":"PROMISE: Preconditioned stochastic optimization methods by incorporating scalable curvature estimates.Journal of Machine Learning Research, 25(346):1–57, 2024","venue":null,"work_id":"4a32dbaf-e20c-4755-a7c2-525d5135ea58","year":2024},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.021023Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:d0b1869c8e7780db26dbeca93e2a475fbeedd390b9c2871f05f2a5497579d426","observation_id":"822eb63e-a289-4d32-aa62-18d8d8647387","resolution":{"observed_at":"2026-08-10T13:56:24.109088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.090606Z","title":"Sketchysgd: reliable stochastic opti- mizationviarandomizedcurvatureestimates","venue":null,"work_id":"c0d6cd81-4a8d-49dc-8d50-8d6f6c5672ae","year":2024},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.025822Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:2a52da5a009286dcc4d810915e5e6fd46138e3d04c9ab669760927ca1cf42fca","observation_id":"1fd93d12-03ee-42dd-b61a-d90503d5fcc2","resolution":{"observed_at":"2026-08-10T13:56:24.095134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.077210Z","title":"Randomized nyström preconditioning.SIAM Journal on Matrix Analysis and Applications, 44(2):718–752, 2023","venue":null,"work_id":"3c5b49eb-452a-4458-a2d9-3c5800545ba5","year":2023},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.030681Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:4793072346ddf97ad6964b6759d7f3656edcbb751182f54054acaa3e6a31cfbd","observation_id":"5f69db10-1215-4b35-bd3a-53337710b3cb","resolution":{"observed_at":"2026-08-10T13:56:24.081722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14758","last_updated":"2024-04-23T05:45:52Z","snapshot_observed_at":"2026-08-13T00:24:06.881106Z","submitted_at":"2024-04-23T05:45:52Z","title":"Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients","version":1},"cited_work":{"arxiv_id":"2404.14758","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.14758","snapshot_observed_at":"2026-08-10T13:56:23.423840Z","title":"Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients","venue":"math.OC","work_id":"a1bfdcae-eeaf-4c63-829e-9e7c008e270a","year":2024},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.035374Z"},"links":{"cited_paper":"/paper/2404.14758","citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:3553d34ea3df8e669791ce5cd1f3e1370b09a5ad0b9444378e977c6ad0dd96ba","observation_id":"4c908ee3-d39c-4177-9948-03e4941da07a","resolution":{"observed_at":"2026-08-10T13:56:23.430746Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.063356Z","title":"RSN: Randomized Subspace Newton","venue":null,"work_id":"81396e1b-a01f-45f4-9dab-cc6378adf620","year":2019},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.041201Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:4b54247c4d03d10bb30818c3dcfadc873a25a26c8565f09917b66fdb8cdb2117","observation_id":"ba4d2879-b07c-48b0-ab45-4af6fa1944e2","resolution":{"observed_at":"2026-08-10T13:56:24.067774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.048361Z","title":"SGD: General analysis and improved rates","venue":null,"work_id":"8a27f9ca-0152-4717-8f3e-789434e187a0","year":null},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.045844Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:12d99ccdb59d82eacc4b545a88d633b44021de71d55764ca33f5f3416ad15c7e","observation_id":"ede529d4-2645-4d74-a85d-4841c5b6987b","resolution":{"observed_at":"2026-08-10T13:56:24.053621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.034715Z","title":"Datamodels: Predicting predictions from training data","venue":null,"work_id":"a53ae42f-d5a6-40d8-b1ac-f33d8252cac1","year":2022},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.050748Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:597ea490e61c7181de3a04c8f389c160fd7568fffa6f5216beb9a6feb5097cc3","observation_id":"7fa19c2a-d7b5-4924-9835-75cf0372d76d","resolution":{"observed_at":"2026-08-10T13:56:24.039360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.020911Z","title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization.Advances in Neural Information Processing Systems, 29, 2016","venue":null,"work_id":"9ac2329f-7856-4124-82b6-a156dcfba4d6","year":2016},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.055483Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:93f9a3dd2607e62c4efc8dc55bfa4766e766873fac6e0d99644b6decc32e4ebe","observation_id":"4be55c71-9cf4-415c-8913-988f25c2c4e6","resolution":{"observed_at":"2026-08-10T13:56:24.025456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:24.006926Z","title":"Accelerating stochastic gradient descent using predictive variance reduction","venue":null,"work_id":"8ab60edd-a9ac-413e-87d0-6257a428371a","year":2013},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.060086Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:e97d6c608b0a6dd7e89bdf0ca652deacbaf6d6c4be59addcde065750f03f2809","observation_id":"e6f395c3-0f08-460b-912d-e6209e411100","resolution":{"observed_at":"2026-08-10T13:56:24.011442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00413","last_updated":"2018-06-01T15:58:54Z","snapshot_observed_at":"2026-08-14T19:08:29.177573Z","submitted_at":"2018-06-01T15:58:54Z","title":"Global linear convergence of Newton's method without strong-convexity or Lipschitz gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.00413","snapshot_observed_at":"2026-08-10T13:56:23.064996Z","title":"Global linear convergence of Newton’s method without strong-convexity or Lipschitz gradients.arXiv preprint arXiv:1806.00413, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.064996Z"},"links":{"cited_paper":"/paper/1806.00413","citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:8e7cbaa2cd235c4c05c683c67f88f15e1182275c1d8e5ba6fba115772ec2ba43","observation_id":"6a56cc64-467c-4e83-9687-a37f2a8ef4c1","resolution":{"observed_at":"2026-08-10T13:56:23.064996Z","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-10T13:56:23.993056Z","title":"Sub-sampled cubic regularization for non-convex optimization","venue":null,"work_id":"f5038f67-a19e-4953-8063-69b96a9149df","year":1904},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.069961Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:467e0794dbc3b13bcd6ba6d5a07efb0f9a8f47f7b95615073160cdc46a281c2c","observation_id":"0135f964-c441-4b5d-81f8-21056fa8d684","resolution":{"observed_at":"2026-08-10T13:56:23.997548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.978720Z","title":"Do subsampled newton methods work for high-dimensional data? In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 4723–4730, 2020","venue":null,"work_id":"1ebc7674-b2bd-4837-ad9f-b82f42d031bc","year":2020},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.074569Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:7a93e48747cb4b803dc34f8b891340dce0f4a8021893341b6abdfc3348ac069b","observation_id":"783fbce7-b145-467a-8df4-08368436082d","resolution":{"observed_at":"2026-08-10T13:56:23.983522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.965051Z","title":"On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization, 2017","venue":null,"work_id":"a445304e-f95e-4b0c-afcc-f6031a80fa85","year":2017},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.079092Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:5638163879f734cf0800ed855cd94866976fdd5ef8c3ca90dd2ce4a8e10f590a","observation_id":"fb972571-9b01-42d3-941d-338c79783a82","resolution":{"observed_at":"2026-08-10T13:56:23.969621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.950667Z","title":"Activityidentificationandlocallinearconvergenceofforward– backward-type methods","venue":null,"work_id":"c33c2fbf-7328-49a9-a74c-a661aa0952ea","year":2017},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.083502Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:081751e37221b70fa39500ab7e4b71ba40f3d90ae335a399a2acbc4291c78d76","observation_id":"0a4d5d4f-1b7a-41c3-b0e5-630e59f65129","resolution":{"observed_at":"2026-08-10T13:56:23.955429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.936355Z","title":"Local convergence properties of douglas–rachford and al- ternating direction method of multipliers","venue":null,"work_id":"a243ef57-5c9f-4be0-9657-12f80c3b2ca6","year":2017},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.088003Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:fd9985db2a50581a9a4eaa9f0ce5fb92e94bf0887cb62c1f13136d420455981c","observation_id":"e6845616-8400-4523-a9b1-4ec618387cfc","resolution":{"observed_at":"2026-08-10T13:56:23.941034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.921592Z","title":"Catalyst acceleration for first-order convex optimization: from theory to practice.Journal of Machine Learning Research, 18(212):1–54, 2018","venue":null,"work_id":"de0b83b0-a4e8-457b-928b-4fc3f232f0b4","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.093102Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:22ea306048b03399059af9b84c9f48a89af4b78b38960923c703e2b50c1b046e","observation_id":"e9d006e4-7d6b-4cb8-b83e-b7918f5def35","resolution":{"observed_at":"2026-08-10T13:56:23.926635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.907422Z","title":"Controlburn: Featureselectionbysparseforests","venue":null,"work_id":"dff3cadb-92c0-4e8f-b385-869c1f51d117","year":2021},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.097604Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:96def8819c6efa9ec1359b1864044469e4400bc4088cc3dd60842a987f9009ed","observation_id":"4e58e66f-562d-40cc-bb98-5802f1bb168c","resolution":{"observed_at":"2026-08-10T13:56:23.912116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.892385Z","title":"On the complexity analysis of randomized block-coordinate descent methods","venue":null,"work_id":"e58c3f99-8c94-45eb-baca-8849c2e552b6","year":2015},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.102490Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:346ebdcb048d4365473b34170ecb13cea01fd9f0f2a893839895936410a07be0","observation_id":"07316c28-6549-4716-94ac-e3e7b61e5f21","resolution":{"observed_at":"2026-08-10T13:56:23.897910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.878155Z","title":"Fast and furious convergence: Stochastic second order methods under interpolation","venue":null,"work_id":"8c262729-8c6e-4077-99b7-5c710b61d820","year":2020},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.106952Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:36dee85f8583a7b2603aa78b3aff33943a3160d3d90d2b44480c7cad5e2547b0","observation_id":"4c72f6c6-f585-4445-8a1f-a027d88d71ea","resolution":{"observed_at":"2026-08-10T13:56:23.882703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.864478Z","title":"A linearly-convergent stochastic L-BFGS algorithm","venue":null,"work_id":"04843931-15f7-4a1c-9864-af67d58e2429","year":2016},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.111302Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:66375b236e0f164e633b942be03473c131c92f2d59a6e95415ad38e0cdbd7207","observation_id":"d0846b56-c4b7-498d-b61e-89d119a91f5f","resolution":{"observed_at":"2026-08-10T13:56:23.869081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.850700Z","title":"Gradientmethodsforminimizingcompositefunctions","venue":null,"work_id":"34495ba7-ed00-42cd-aa74-80e13c0e3feb","year":2013},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.115644Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:63a9680dc5b1630d8c2535f4958bd88e8ddb04564a4c0d3d97f5007e29cc9e00","observation_id":"22e3fe70-4d12-4f0f-98b5-e4003f092352","resolution":{"observed_at":"2026-08-10T13:56:23.855148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.836791Z","title":"Springer, 2018","venue":null,"work_id":"d2a28c2d-7bea-4a4c-a2a2-1b9e20db9b1b","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.119916Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:a0ba1f70332e64b43f429747cc743972627e44e5754e2902d0bd1714488f2efc","observation_id":"5cc36bcc-b3fd-4a95-80d1-7a06b6045be3","resolution":{"observed_at":"2026-08-10T13:56:23.841251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.823247Z","title":"Catalyst for gradient-based nonconvex optimization","venue":null,"work_id":"9fffc6d6-ac48-42e5-b9d1-16d4d14bc9b0","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.124598Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:fa2f322d6943a85196ffa5d39acc561a74ab9b53276fe70d65767ec5da9b115d","observation_id":"c362cd41-337e-42bf-a6e0-d87d39967b4c","resolution":{"observed_at":"2026-08-10T13:56:23.827780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.809616Z","title":"Neural networks are convex regularizers: Exact polynomial-time convex optimization formulations for two-layer networks","venue":null,"work_id":"a4275743-1c55-4a22-934b-6c06de7a4424","year":2020},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.129165Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:6bd3d0b20edaeaae9dc715656f715c7688ccedc7ad894e5554555a1a4e036f12","observation_id":"88a5d890-cd2a-4cdf-91dd-9df99123ceff","resolution":{"observed_at":"2026-08-10T13:56:23.814432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.795989Z","title":"Newton sketch: A near linear-time optimization algorithm with linear-quadratic convergence.SIAM Journal on Optimization, 27(1):205–245, 2017","venue":null,"work_id":"991c17f7-8cc9-42a0-911c-5447e4e2c8ad","year":2017},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.133671Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:199b2aaaca87f1cda836438dbaeb021243b85d30a3878c69cec586d8ca97b38d","observation_id":"e1faad9a-185a-405a-94a1-4588e97e2b2d","resolution":{"observed_at":"2026-08-10T13:56:23.800541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.782282Z","title":"Local convergence properties of saga/prox-svrg and acceleration","venue":null,"work_id":"31dfb0a9-252f-4a7e-a645-c78dd114c18e","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.250069Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:48e0f1d99476888bcb1b49068385e6880a3bb0bf302b313ca410edcf7a30adb9","observation_id":"51e4e687-5d3e-4e42-a322-fc59cb419350","resolution":{"observed_at":"2026-08-10T13:56:23.786940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01868","last_updated":"2024-06-03T23:35:42Z","snapshot_observed_at":"2026-08-13T04:28:05.188111Z","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-10T13:56:23.255190Z","title":"Challenges in training pinns: A loss landscape perspective.arXiv preprint arXiv:2402.01868, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.255190Z"},"links":{"cited_paper":"/paper/2402.01868","citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:f90e875b57b9231001ad74cdc7fb8126de9179bcfe056eb7eeb0b84c91d7cdbd","observation_id":"9b28f786-59b8-4c7f-be47-32f69906d738","resolution":{"observed_at":"2026-08-10T13:56:23.255190Z","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-10T13:56:23.767991Z","title":"Stochastic variance reduction for nonconvex optimization","venue":null,"work_id":"f3bc9c91-7ef0-44e0-83be-8c21df58b9fc","year":2016},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.260357Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:e6a18a985615b4716e828627e71715b9fde63cc22f017c2cc22ffa3e4ba9d62b","observation_id":"1358ea6c-7ea6-49c7-8c7f-f4dcfe89a032","resolution":{"observed_at":"2026-08-10T13:56:23.772703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.753545Z","title":"Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function.Mathematical Programming, 144(1):1–38, 2014","venue":null,"work_id":"83c28cc3-3317-412a-9f38-0dc2560feb15","year":2014},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.265524Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:bd42f850d1e8d9cd867277d97bd909cab697ec743d105aa7d87fcaf0853d73bd","observation_id":"51fb3acd-5891-4c99-886c-03018d6f9d5b","resolution":{"observed_at":"2026-08-10T13:56:23.758247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.739672Z","title":"Newton-mr: Inexact Newton method with minimum residual sub-problem solver.EURO Journal on Computational Optimization, 10:100035, 2022","venue":null,"work_id":"3e2788fd-4e19-4112-a5f3-9998a7eacc8c","year":2022},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.270083Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:c4aff4aef51692bb7193dc5e22b07069b11ef9f05745a410f9947aae35f396f6","observation_id":"bee0719c-9b9c-4bd5-856c-b3572903ea0a","resolution":{"observed_at":"2026-08-10T13:56:23.744341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.725602Z","title":"Sub-sampled Newton methods.Mathematical Program- ming, 174(1):293–326, 2019","venue":null,"work_id":"d8c8f564-ac6e-4d0c-bd5f-597b52ff7759","year":2019},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.274571Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:3fb9bb20179a5c411836651251c120424161ac46780ee559c85b2fdd8844c7d7","observation_id":"6a3f4a9c-42e1-4a0a-8ecb-7cbed142ca58","resolution":{"observed_at":"2026-08-10T13:56:23.730311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.712082Z","title":"Are we there yet? manifold identification of gradient-related proximal methods","venue":null,"work_id":"66986544-bdb8-414d-a3e0-e6fc4402f9ca","year":2019},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.279228Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:3172223bc5d21fc63066ccae0bcc7b41cd9589e51243878e3b4b38f495cd0881","observation_id":"4b149ffe-ce9a-4b84-aed7-db6547ff494a","resolution":{"observed_at":"2026-08-10T13:56:23.716546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.697346Z","title":"Stochastic cubic regular- ization for fast nonconvex optimization.Advances in Neural Information Processing Systems, 31, 2018","venue":null,"work_id":"4893b38b-5c02-477d-884a-538224441d63","year":2018},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.283569Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:99c94823abdf17af2309a93ea7bf580300b4b7c343ef00c83c5795a7adad872f","observation_id":"461a9f56-d897-48d4-97df-346762fd0c1a","resolution":{"observed_at":"2026-08-10T13:56:23.702816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.683264Z","title":"Fixed-rank approximation of a positive- semidefinite matrix from streaming data.Advances in Neural Information Processing Systems, 30, 2017","venue":null,"work_id":"84fdb9a2-ad30-4505-9cce-6853ccbd1e3f","year":2017},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.288490Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:35d2b66759cc0c4ae848bee33480c27981c4019284f87e8dfe45f7b29c1c0dc4","observation_id":"4ea55321-1ea8-45d4-9230-6285a5f6301b","resolution":{"observed_at":"2026-08-10T13:56:23.688095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.668938Z","title":"Fixed-rank approximation of a positive- semidefinite matrix from streaming data","venue":null,"work_id":"bc35c01d-8145-40c5-af8b-aabde6d0b46f","year":2017},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.293208Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:69f5447cd614eac2c144532d70ce4dfd4ef1a02cfcdab5f72b58fea3c544d3fb","observation_id":"ff7f042c-43b3-419a-a9b6-b0760c0fb73d","resolution":{"observed_at":"2026-08-10T13:56:23.673685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.654242Z","title":"Utilizing second order information in minibatch stochastic variance reduced proximal iterations","venue":null,"work_id":"22d2ad49-e116-4f3f-b5b5-d8b7022c18f7","year":2019},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.297946Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:5a24d45a2019c574b5dbe56763d675026ed591557caf70ccc9671b8d96a29482","observation_id":"3d11e5fc-25f6-46cd-8ea9-5351d33fb086","resolution":{"observed_at":"2026-08-10T13:56:23.659030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.639971Z","title":"A proximal stochastic gradient method with progressive variance reduction","venue":null,"work_id":"3190c29a-300b-42e1-8af1-147faaeed3da","year":2014},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.302517Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:273bae2700b5dbd801db229d5bd1fd217cdd170893c1a3e01cbdf0db6c63876b","observation_id":"7ef791b8-4365-4611-a18a-cef1a3867b6c","resolution":{"observed_at":"2026-08-10T13:56:23.644556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.625500Z","title":"Newton-type methods for non-convex optimization under inexact Hessian information.Mathematical Programming, 184(1-2):35–70, 2020","venue":null,"work_id":"d787c5f4-2229-412f-ad68-fbd7c3702797","year":2020},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.307133Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:7246aa3350bc1cb7912b4e73c0032768db0901c4e5fdb5be14a9e8b76a858a0a","observation_id":"d0fd77f3-eb6f-4161-8fd5-b16f2543c2d3","resolution":{"observed_at":"2026-08-10T13:56:23.630801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.610616Z","title":"Inexact nonconvex Newton-type methods","venue":null,"work_id":"d4ebff1c-710c-4a6e-b09c-0685264dcd49","year":2021},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.311454Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:4de676cf1a8ab7d9d4424b3f8d3adf9601dbe79c62b6ea8dc992ea788047201d","observation_id":"908e22a2-c2a3-4c6f-b15e-51dd3b81a939","resolution":{"observed_at":"2026-08-10T13:56:23.615588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.596065Z","title":"Inexact newton-cg algo- rithms with complexity guarantees.IMA Journal of Numerical Analysis, 43(3):1855–1897, 2023","venue":null,"work_id":"83a6241c-c14f-4e0c-8d58-316b6d84af95","year":2023},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.315955Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:15b3cfe25207b2b553ea3dee08676cc2d0715acc5a447b6d281d3d15165bed17","observation_id":"4e49ec12-b3b7-4f03-8809-009a2e2a39ad","resolution":{"observed_at":"2026-08-10T13:56:23.600862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.581216Z","title":"Approximate Newton methods.Journal of Machine Learning Research, 22(66):1–41, 2021","venue":null,"work_id":"5ab35fa7-f6e6-43a8-a763-a91398b9320b","year":2021},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.320506Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:bdb106c4eb10216afee6c750c267c036877dc803a1dcf9c65d7a9a63bf843be7","observation_id":"74c18bc2-5817-4ba4-9fc6-10996659873d","resolution":{"observed_at":"2026-08-10T13:56:23.586338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.567030Z","title":"Sketched Newton–Raphson.SIAM Journal on Opti- mization, 32(3):1555–1583, 2022","venue":null,"work_id":"3e60ce62-20e9-4ebe-b80c-b0c9ccafd550","year":2022},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.325269Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:fc46f09a935117496e59586cf020605c9626386e465ad7b4fc18b043133354a3","observation_id":"f44818ec-c562-46fd-93f4-c1474ae4eec4","resolution":{"observed_at":"2026-08-10T13:56:23.571743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.552008Z","title":"R 1 Sm S−1X s=0 mX k=1 ˆw(s) k ! − R(w⋆) # ≤ ∥w0 − w⋆∥2 P (0) 0 + (2η − η2) (R(w0) − R(w⋆)) . Rearranging, we find that E","venue":null,"work_id":"055db4c4-b133-4ae7-bf59-724a69929733","year":2010},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.329821Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:fcd15b04df83a459ecf4e00a5a99858c51db7bf81e9e55d3f7dcc1c8903b4785","observation_id":"72ce393e-48e7-497b-bfdc-7971da144e42","resolution":{"observed_at":"2026-08-10T13:56:23.556937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.536131Z","title":null,"venue":null,"work_id":"57840508-fd05-4a70-9732-c677edd2dec3","year":null},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.335284Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:312c4869fa81199b95b834cb6310d519e3009921cfd200f5c10a731bc64c34b4","observation_id":"f4810a62-46e3-42a4-a642-79798e660d90","resolution":{"observed_at":"2026-08-10T13:56:23.540583Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.521642Z","title":null,"venue":null,"work_id":"0edffb90-361c-4d94-9215-42f353471ae5","year":null},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.340108Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:460861866f7c5f424f4c77fb5fb848dc4665c28e230fe5a40f070ae07a778634","observation_id":"61192d3f-d821-434e-aedd-8ce6ab668f65","resolution":{"observed_at":"2026-08-10T13:56:23.526213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.506970Z","title":null,"venue":null,"work_id":"037720a5-42de-41a0-86db-197d48da2236","year":null},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.345369Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:06d62b4895a589bc992c0665bcdcae750ebd35c427d1bb9fe2b5b44b0162e548","observation_id":"e39a1135-66c4-49f6-9d93-b2bb1e85618e","resolution":{"observed_at":"2026-08-10T13:56:23.511748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.492490Z","title":null,"venue":null,"work_id":"49c64ea7-5342-49d5-a652-019518515571","year":null},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.350039Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:430985b3a8586c41d70379e8781f023ec06c5fa16bfceb9cbff3ed8195f2931d","observation_id":"d130616d-86fd-4db8-b97c-d05ea19e80e9","resolution":{"observed_at":"2026-08-10T13:56:23.496927Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T13:56:23.478103Z","title":null,"venue":null,"work_id":"c019b05a-ed4e-4563-8b1d-6a40888a0a78","year":null},"citing_paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T13:56:23.354620Z"},"links":{"citing_paper":"/paper/2501.15941"},"observation_digest":"sha256:8836bf9d7869aa0a4be486a12983405f9de84eca35c6ff4e6dd79a1a2a2820e1","observation_id":"b41cb540-f407-4c85-be96-85ca7897557d","resolution":{"observed_at":"2026-08-10T13:56:23.482668Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.15941","last_updated":"2025-01-27T10:36:45Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-11T00:42:50.258316Z","submitted_at":"2025-01-27T10:36:45Z","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":9,"verified_exact":2,"verified_fuzzy":54},"total_outbound_references":66},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:2501.15941."}