{"as_of":"2026-08-05T08:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0e1b7b59539566da31822959bf2cf97695d4c5f0e687e5345b66d8ed5b76f30","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T03:42:57.288700Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2606.15832/citation-record","integrity":"/paper/2606.15832/integrity","json":"/paper/2606.15832/citation-record.json","paper":"/paper/2606.15832"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Beznosikov and A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:57d8a8eb47f8496f0848dbefe9ef3eab633da6859dd9f140cf8746cf86f33543","observation_id":"0a732cc1-82ee-48bb-925b-e3c989914206","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05633","last_updated":"2020-04-02T12:50:38Z","snapshot_observed_at":"2026-07-06T06:44:53.896543Z","submitted_at":"2018-06-14T16:22:30Z","title":"Improving SAGA via a Probabilistic Interpolation with Gradient Descent","version":2},"cited_work":{"arxiv_id":"1806.05633","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1806.05633","snapshot_observed_at":"2026-07-03T17:48:46.079770Z","title":null,"venue":null,"work_id":"61ff885f-fb67-4a37-902c-a544da729d31","year":2018},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/1806.05633","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:ff3e49fbb817e79df22540d9610dfe12c134ffaf8f02bb6dea11986d814dbda1","observation_id":"10520edd-acac-495f-8022-7c3513b10e63","resolution":{"observed_at":"2026-07-03T17:48:46.081089Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:01882f213250789cdece81e340b756ea5002794ff9ecb2a1a710e9e2f0b7cb05","observation_id":"35769b93-9f3e-410e-96de-0464be62f38a","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Brown et al","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:59b5b334bc0ff405b151056659291698e3440f0fef464a8e0411128ee3bec7a8","observation_id":"a5481dc8-f32e-401f-994c-5be713168bda","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:0ac269e0bf6a0995f7bc0ac244e6bc1de4673631c327fd768993c7fee20e073d","observation_id":"5f870e53-72ac-4b20-832c-d8a8ec097733","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:e6319a47bff2783f711a957493f06a226024d9d48e362275d8b0023be97ccb1c","observation_id":"3783e425-84ea-424b-87a1-fc69bc3b1cc8","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05968","last_updated":"2022-06-22T23:10:37Z","snapshot_observed_at":"2026-07-06T12:07:23.642452Z","submitted_at":"2021-11-10T22:12:52Z","title":"Linear Speedup in Personalized Collaborative Learning","version":4},"cited_work":{"arxiv_id":"2111.05968","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.05968","snapshot_observed_at":"2026-07-03T17:48:46.085424Z","title":"M., Karimireddy, S","venue":null,"work_id":"d318bf33-d932-4f9a-b548-302af123943d","year":2021},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2111.05968","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:ef01355936e8e342dfd1b3400ac3a070df436425a208796037cd04969dde15d1","observation_id":"37756d8b-af3a-48bc-8047-6228cf432560","resolution":{"observed_at":"2026-07-03T17:48:46.087071Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Condat and P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:87646375e83bb86a5fad4488b274ef8a0517546936083a9cc1cdabdbc71d9b4f","observation_id":"582274a3-9801-4642-8027-88d00dfcd062","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Defazio, F","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:2a6da1ad7aa162895ca5dd86e25a17ab93b80876cbb78616e284e7bbd1f1be3a","observation_id":"5e6d2519-48c8-4c55-b59f-88177809083f","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Demidovich, G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:1fd9b881644e042c59180056df9276256a951f48f44a0de7c213bb805a045a61","observation_id":"de8a8636-ae71-4b07-9115-bff016104224","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Evgeniou and M","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:fb6016ff2922508288a9ab84fb1f63361d91f3ff51ff375354e4f628568da269","observation_id":"1baaf628-3ca3-4662-8ba2-cd3d993c6216","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:61b3caca32f736593a5224655b30d4bd5cde35bf8d066b0ff4b765b46ef8d92d","observation_id":"31ed114c-38ce-4b08-9de0-4040af7cae7c","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.03294","last_updated":"2025-06-20T17:11:24Z","snapshot_observed_at":"2026-07-06T11:55:17.935458Z","submitted_at":"2021-10-07T09:29:14Z","title":"EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedback","version":2},"cited_work":{"arxiv_id":"2110.03294","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.03294","snapshot_observed_at":"2026-07-03T17:48:46.065528Z","title":"arXiv preprint arXiv:2110.03294 , year=","venue":null,"work_id":"b552f7f8-0508-4ff3-81be-f7d528277954","year":2021},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2110.03294","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:1a733b74a58a2f5e4c084c50ee8b77e68f77c2857dbe948e0051a0596618dcd9","observation_id":"73aa8a36-2323-423c-ac45-4732017b96f6","resolution":{"observed_at":"2026-07-03T17:48:46.067082Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Goodfellow, Y","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:5001b4eb7f3f57373525262cc48fc41b933764a95fe33103dbf789f7f796060e","observation_id":"56700e2f-5038-4a0f-9bbd-795aae0a1ae7","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.13169","last_updated":"2022-09-27T09:42:38Z","snapshot_observed_at":"2026-07-06T13:04:27.256772Z","submitted_at":"2022-04-27T20:02:34Z","title":"FedShuffle: Recipes for Better Use of Local Work in Federated Learning","version":3},"cited_work":{"arxiv_id":"2204.13169","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.13169","snapshot_observed_at":"2026-07-03T17:48:46.079973Z","title":"Horváth, M","venue":null,"work_id":"f3fdde3a-a3aa-4943-8e4f-268c90f1b61a","year":2022},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2204.13169","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:af7fa362bdc9b40ab2a1189493ba72fb690ebf7a4ec1a3faff0c383a599930b4","observation_id":"ab0f08f9-cfc8-43f3-b765-e840dcc3e3d1","resolution":{"observed_at":"2026-07-03T17:48:46.081521Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Johnson and T","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:4ca20d30b04ec5ba06aa4a55faa498c647397e4aa3f79a3e9a8d7ded34bd47e2","observation_id":"a1870e26-b232-4dc5-83e1-329366fc2aec","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.03606","last_updated":"2021-06-08T08:14:57Z","snapshot_observed_at":"2026-07-06T09:45:35.459864Z","submitted_at":"2020-08-08T21:55:07Z","title":"Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning","version":2},"cited_work":{"arxiv_id":"2008.03606","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2008.03606","snapshot_observed_at":"2026-07-03T17:48:46.106003Z","title":"Mime: Mimicking centralized stochastic algorithms in federated learning.arXiv preprint arXiv:2008.03606, 2020a","venue":null,"work_id":"aa79d608-ae8e-481c-ad74-0ca942b21655","year":2008},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2008.03606","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:ff91b8b5c505e53e63ab5ef3798fa2adc5a113acc3e5f1cb7fa2c55c0c961b9f","observation_id":"5b146191-541e-4f26-9b94-e0e9a0bda9c5","resolution":{"observed_at":"2026-07-03T17:48:46.107866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Khaled and C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:713b3d9659a239c69433f9c8263718334189ef7e1b210b7a14dd0096d24e2f8f","observation_id":"dbc0bece-af64-4f27-af29-a19187110b7e","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.02527","last_updated":"2016-10-08T13:25:15Z","snapshot_observed_at":"2026-07-06T05:13:51.685562Z","submitted_at":"2016-10-08T13:25:15Z","title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence","version":1},"cited_work":{"arxiv_id":"1610.02527","doi":"10.48550/arxiv.1610.02527","metadata_source":"pith","pith_arxiv_id":"1610.02527","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence","venue":"cs.LG","work_id":"d9bc6bd5-0d8b-49f8-bac1-0534db3e670a","year":2016},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/1610.02527","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:468505cdd59880c86c32e983183ea042fc06a2755ef4638977007194592949da","observation_id":"56126b63-177e-4493-871d-e4e358de31b9","resolution":{"observed_at":"2026-07-03T17:48:46.074955Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Kovalev, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:7eb490cde1e97f65540b2d4fa229b234b031f168bb896810be19b1e9652e4c73","observation_id":"de4cab78-4282-4b85-8049-cc663621eff8","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.15136","last_updated":"2022-05-30T14:28:02Z","snapshot_observed_at":"2026-07-06T13:15:28.653910Z","submitted_at":"2022-05-30T14:28:02Z","title":"Optimal Gradient Sliding and its Application to Distributed Optimization Under Similarity","version":1},"cited_work":{"arxiv_id":"2205.15136","doi":"10.48550/arxiv.2205.15136","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.15136","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2205.15136 , year=","venue":"arXiv (Cornell University)","work_id":"9acdb1b2-3337-40c5-846c-1cace452c320","year":2022},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2205.15136","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:9901538f577d797499b3be927b869ac413716a11616409607e826de80a5eaefc","observation_id":"a0357d80-e50a-47b1-a982-3c49a36ebebe","resolution":{"observed_at":"2026-07-03T17:48:46.112032Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:4d023c1aa359e92e0b7dec004dcb2ed4b185a67e64e1160f6ebb88c56e288072","observation_id":"679deffd-3e5d-4dd3-afb9-68cc2bb75f47","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:fdef22c3c040db5c8b66d5cc5fb21fccc9f7944ae77bc1105d145f33824d9ac9","observation_id":"aece457e-b35a-4459-af05-5607dc8159f5","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:ec3a91757e32976b2cd1776e4c9a98514060170f05ac97b153dc901b52d0c313","observation_id":"9abac48d-bb0d-446d-ac64-d4627c8e23d8","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:b7be8265bcebbb2c8228b1d0ec51a6ce114b9acef022c41140cccf81510dddbf","observation_id":"d7b72a6f-96b8-4661-b7ac-88496b97caf2","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.01447","last_updated":"2021-10-10T19:03:07Z","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","version":3},"cited_work":{"arxiv_id":"2103.01447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01447","snapshot_observed_at":"2026-07-03T17:48:46.076812Z","title":"arXiv preprint arXiv:2103.01447 , year=","venue":null,"work_id":"2493b71f-3c43-49ad-bbd2-690538dc6d42","year":2021},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2103.01447","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:e687b78640876a973f178ebb4e13eaab80a3d42aafa26e276cec99118d5c0c51","observation_id":"94b25f71-bd67-4437-a415-e36a0d01142b","resolution":{"observed_at":"2026-07-03T17:48:46.078192Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:6f3e799a054626ae1d3f731baf3eba02181968509cefc3c154b6277accbda550","observation_id":"6d941344-f339-438f-a1fb-9485e57c4404","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:3ee9d098fd0e7d34712c6c720f926fd3b3e64cc2cb2089ee8b745bf7cd7f7aeb","observation_id":"37917051-45ca-4a54-9493-e8a85ba28e72","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Nesterov.Introductory lectures on convex optimization: a basic course","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:c43848f3afe88a39e2559857d6ee310c5580016d57b88c1f7228d688d73f8dfb","observation_id":"9ce1f26e-cc16-4e5a-8329-d663dc92c0ec","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:328a38a02ea4c06c7006ca393019806d30e9abfdf833603ec94781de3925823c","observation_id":"4caa5990-d9a0-4a79-9fd0-7b83c31a5910","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:747e60328a7758669514d933b7e1c57ba336f53a762470a095f184376447a330","observation_id":"22522b0e-0d8d-4a58-844d-2e09d79b702b","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Radford, J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:328229320a6c1ab3d65fe0c3f945caaec17ffd68c870ab868752aab91ad920fe","observation_id":"2cfae958-0bf0-46f3-991e-7255a590eb89","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Richtárik, I","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:6dbc5d13fb44303ec3b3e28d160c8480c863bcdc38a97508254b670078fbf684","observation_id":"45b4ca71-0f3a-4503-85e8-c992d66d747e","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Richtárik, I","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:a547a2ee0479d8955944c7da09683f28e766d137ccb2661c6e544573652c3590","observation_id":"d329cdb8-772a-4649-b0af-e58c171e5051","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Sadiev, G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:634321d47b48601ab82ed479f6b3626e878cfa540a6f720a2778349c37c9da10","observation_id":"e1d0e7b7-181e-43c4-9198-e612751c59c8","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","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":"2511.14501","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T17:48:46.088039Z","title":"Sadiev, Y","venue":null,"work_id":"32f9a1c8-4561-4b82-84af-191dfc6df26a","year":2025},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:11ed67a611658cfd6435079c7a935058ec51784ff8e1b170c9c69d0ca7e4f5db","observation_id":"11b91a3b-f605-4126-ae9b-39e00f594d04","resolution":{"observed_at":"2026-07-03T17:48:46.105397Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Schmidt, N","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:e5b17dad23749609ba522a7c70d392c5b2a089bf1a921d34f3f8d5202e0e2966","observation_id":"0908913e-9dee-41fa-b619-e9c878dcadc2","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Shalev-Shwartz and S","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:d2a7ac011680b91bb52da2ae09909b78ba1d76cd726e27344e22e23504072ab0","observation_id":"728d656f-f8e9-41c9-9123-79de26d4fff4","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Sokolov.Non-convex Stochastic Optimization With Biased Gradient Estimators","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:9b83ddf6cf90bd74f53dad52d9847c6e299d5d2c01dce3dbc92053536a1fe774","observation_id":"b6653b84-7639-4889-a906-ce10b987d2db","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.17082","last_updated":"2024-12-22T16:18:34Z","snapshot_observed_at":"2026-07-06T20:11:46.794148Z","submitted_at":"2024-12-22T16:18:34Z","title":"MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes","version":1},"cited_work":{"arxiv_id":"2412.17082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.17082","snapshot_observed_at":"2026-07-03T17:48:46.082635Z","title":"Sokolov and P","venue":null,"work_id":"eed9302d-7e73-4ac7-9756-e1b17708ccf7","year":2024},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2412.17082","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:75375cf40132ffd7b9821d25716acdecc073ac42ef9032abd27f77945784f867","observation_id":"f2983867-bf35-4c4d-ad6d-afc139d6f709","resolution":{"observed_at":"2026-07-03T17:48:46.084304Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03820","last_updated":"2025-08-05T18:09:55Z","snapshot_observed_at":"2026-07-06T22:08:21.728198Z","submitted_at":"2025-08-05T18:09:55Z","title":"Bernoulli-LoRA: A Theoretical Framework for Randomized Low-Rank Adaptation","version":1},"cited_work":{"arxiv_id":"2508.03820","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.03820","snapshot_observed_at":"2026-07-03T17:48:46.085172Z","title":"Sokolov, A","venue":null,"work_id":"bca8a731-a7b0-459c-84aa-8f97206c6d36","year":2025},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2508.03820","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:583571b184ee1eae6568154d247f040e64167fbe482ca7e852b9af3aeacbd866","observation_id":"1e450ce1-1b81-4330-bc54-e9ec96aec927","resolution":{"observed_at":"2026-07-03T17:48:46.086935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:6659f6d04b7135a3496f8ad788bfaf1dae9c65c95df3c48cdf176233d09f49ba","observation_id":"c057bd1e-f61e-4944-a330-f28cce49c722","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Tyurin and P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:987db8a2064d68fc3185051cf94ebff34c1471970be24593bef6f178e7c48a05","observation_id":"cac7f1f6-d0cb-446b-82a0-e2a59025085b","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Tyurin, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:ccfed0ad078283dc210b70cc30adb40b6a7d7ad9a6bf6b14d0b32e2cfd5a350c","observation_id":"6eb73bf3-1cc9-4056-b9c5-d4f89707810a","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:30f5ae24b145ccf989287fc4e2f46ebf706ea07c111bba2ffda825323c128cb6","observation_id":"b81403c6-d7e1-4d19-8e8a-d0a6e187f0e1","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:7f8ffb56d3653f1863a519d8d9058143516086a163c700e1547366509e30e016","observation_id":"3cf3d4dd-54d9-45ad-8e39-e520f2c72fa3","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01115","last_updated":"2024-06-03T08:48:49Z","snapshot_observed_at":"2026-07-06T18:24:17.711867Z","submitted_at":"2024-06-03T08:48:49Z","title":"Cohort Squeeze: Beyond a Single Communication Round per Cohort in Cross-Device Federated Learning","version":1},"cited_work":{"arxiv_id":"2406.01115","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01115","snapshot_observed_at":"2026-07-03T17:48:46.071100Z","title":null,"venue":null,"work_id":"b945cdc8-26f2-4d02-9b97-36596cd6ed95","year":2024},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2406.01115","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:97f996bee36cfc44c696a9171cfef22b8d16ca281a681f82ae4d66bfa4beb67b","observation_id":"4d625581-2b75-439f-abad-6e28fea14f72","resolution":{"observed_at":"2026-07-03T17:48:46.072490Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"Zhang and L","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:b62d8e110c5a8c898e4583052ea64fc9655b36346d93b310eb8fef1fed66be8d","observation_id":"313235d1-1e46-499c-bc90-32b4ad61bdbd","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.04755","last_updated":"2021-08-10T15:41:27Z","snapshot_observed_at":"2026-08-05T02:55:08.407151Z","submitted_at":"2021-08-10T15:41:27Z","title":"FedPAGE: A Fast Local Stochastic Gradient Method for Communication-Efficient Federated Learning","version":1},"cited_work":{"arxiv_id":"2108.04755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.04755","snapshot_observed_at":"2026-07-03T17:48:46.109312Z","title":"arXiv preprint arXiv:2108.04755 , year=","venue":null,"work_id":"95da3572-eb6d-432b-b9d8-b9f5ab768460","year":2021},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2108.04755","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:f3fa38fd48449e39c9c98872849f05fdf0321b87fa162ecb92cfa10b40897e6b","observation_id":"9a6acba9-4df2-465a-ac12-ac228feefdbe","resolution":{"observed_at":"2026-07-03T17:48:46.110880Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"The probability of this event is the complement of Case 1: 1− 𝑝 𝑛","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:cebf45986d42c3a9a8e689d5b7fe0de1ad4093c7894a4b982df99b853f39abd4","observation_id":"44d4355c-6800-454c-b22d-8097927b8c39","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T03:42:57.288700Z","title":"outer” deviations are grouped inside one squared norm and the “inner","venue":null,"work_id":null,"year":2080},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:df65b44e7e7f930650c861fd1aedeb25807fd4f99901b3b1b935e311d1214397","observation_id":"64cbfcf9-f742-4547-adde-8f18355be1ca","resolution":{"observed_at":"2026-06-27T03:42:57.288700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":51},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2606.15832."}