{"as_of":"2026-08-09T20:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e258f745a1240f96265c9ee254c4f8f67be48f818bb5e5748c5ede1fcb487eda","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T23:25:10.683435Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:23:19.534857Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T21:56:15.628231Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"cited_work":{"arxiv_id":"2502.04164","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04164","snapshot_observed_at":"2026-07-01T21:56:15.628231Z","title":"Efficient distributed optimization under heavy-tailed noise","venue":null,"work_id":"3474d926-8a56-4d52-ad36-5ad0ca7dcdf7","year":2025},"citing_paper":{"arxiv_id":"2505.03736","last_updated":"2026-04-16T07:40:20Z","snapshot_observed_at":"2026-07-06T21:19:53.873736Z","submitted_at":"2025-05-06T17:59:36Z","title":"Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-22T15:49:07.709952Z"},"links":{"cited_paper":"/paper/2502.04164","citing_paper":"/paper/2505.03736"},"observation_digest":"sha256:c6152325ec795498adabe9769f437665d987756f4504ce5336fa3d5ba93619de","observation_id":"83021658-c0d8-4c80-bc1a-9682767e7ce8","resolution":{"observed_at":"2026-05-22T15:51:45.783447Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.04164","snapshot_observed_at":"2026-08-04T16:23:19.534857Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.15543","last_updated":"2026-05-25T16:32:52Z","snapshot_observed_at":"2026-08-06T13:05:42.112772Z","submitted_at":"2025-09-19T02:51:19Z","title":"Nonconvex Decentralized Stochastic Bilevel Optimization under Heavy-Tailed Noise","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T16:23:19.534857Z"},"links":{"cited_paper":"/paper/2502.04164","citing_paper":"/paper/2509.15543"},"observation_digest":"sha256:21ef97b265381ce887bebdb91b5fcd9d48c2832cac7a37fea17e050fafcc7a51","observation_id":"46c058ec-0070-4cb4-89be-994f0eb02d27","resolution":{"observed_at":"2026-08-04T16:23:19.534857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.04164","snapshot_observed_at":"2026-08-04T13:25:35.212715Z","title":"Efficient distributed optimization under heavy-tailed noise,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01377","last_updated":"2026-06-02T08:11:16Z","snapshot_observed_at":"2026-08-06T12:50:41.925411Z","submitted_at":"2025-10-01T19:06:11Z","title":"DeMuon: A Decentralized Muon for Matrix Optimization over Graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T13:25:35.212715Z"},"links":{"cited_paper":"/paper/2502.04164","citing_paper":"/paper/2510.01377"},"observation_digest":"sha256:221c8eb8a63fbbdad8bebf45b693dea8ff44aaf96ef3c93acafa45fcead2db4a","observation_id":"bde2b1b6-02a2-44bd-86a1-2d5104aa394f","resolution":{"observed_at":"2026-08-04T13:25:35.212715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"cited_work":{"arxiv_id":"2502.04164","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04164","snapshot_observed_at":"2026-07-01T21:56:15.628231Z","title":"Efficient distributed optimization under heavy-tailed noise","venue":null,"work_id":"3474d926-8a56-4d52-ad36-5ad0ca7dcdf7","year":2025},"citing_paper":{"arxiv_id":"2606.01720","last_updated":"2026-06-01T05:36:26Z","snapshot_observed_at":"2026-07-06T23:42:16.661228Z","submitted_at":"2026-06-01T05:36:26Z","title":"A Note on Stability for Orthogonalized Matrix Momentum with Client Sampling","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T16:03:26.866407Z"},"links":{"cited_paper":"/paper/2502.04164","citing_paper":"/paper/2606.01720"},"observation_digest":"sha256:231678b8837877ff855a9a412200bfb2cf928ab15289467e825ca5ed91c51f70","observation_id":"62d921b8-eea2-4103-ab29-8a0c94fa8180","resolution":{"observed_at":"2026-07-01T21:56:15.629908Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.04164/citation-record","integrity":"/paper/2502.04164/integrity","json":"/paper/2502.04164/citation-record.json","paper":"/paper/2502.04164"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.06917","last_updated":"2021-07-14T18:09:08Z","snapshot_observed_at":"2026-07-31T18:13:22.254060Z","submitted_at":"2021-07-14T18:09:08Z","title":"A Field Guide to Federated Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06917","snapshot_observed_at":"2026-08-08T23:25:10.647358Z","title":"B., Al-Shedivat, M., Andrew, G., Avestimehr, S., Daly, K., Data, D., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.647358Z"},"links":{"cited_paper":"/paper/2107.06917","citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:3cd1cfb876b7881c700b7aee8d5d4b8d731bbb63420acd938d96d5caf0f582fa","observation_id":"3224570d-ca0c-41ca-b271-05c3fabbba22","resolution":{"observed_at":"2026-08-08T23:25:10.647358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06003","last_updated":"2023-10-30T08:07:50Z","snapshot_observed_at":"2026-08-09T17:56:40.463715Z","submitted_at":"2023-10-09T15:08:32Z","title":"Rethinking Memory and Communication Cost for Efficient Large Language Model Training","version":2},"cited_work":{"arxiv_id":"2310.06003","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.06003","snapshot_observed_at":"2026-08-08T23:25:10.724910Z","title":"Rethinking Memory and Communication Cost for Efficient Large Language Model Training","venue":"cs.LG","work_id":"f5b94b4f-21ad-4fba-92c1-b9b6e5d85f61","year":2023},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.650999Z"},"links":{"cited_paper":"/paper/2310.06003","citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:25d7f31a8e1aeb1db598820a378e64c8a55742fa8e743e81dc9654fff316474a","observation_id":"4874ca7c-6149-475c-af08-ecfccd1c3232","resolution":{"observed_at":"2026-08-08T23:25:10.730519Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-08T23:25:10.654885Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.654885Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:a5a70c017e6ae3e16ad361d6c7efaeda54ff79c9b38604ad0eeb9491279684c7","observation_id":"b74541a3-d9ef-456f-87cf-c1c5d6c37342","resolution":{"observed_at":"2026-08-08T23:25:10.654885Z","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-08T23:25:10.803676Z","title":"Such results elucidate the additional difficulties induced by efforts to remove the bounded gradient condition","venue":null,"work_id":"c3a80f27-316b-43c7-8358-86e4d5940dba","year":2019},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.669207Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:1074a8b74f0144615ab2d165bf46912dbb1b91d7f7bcb55ff2c482901a5cfee6","observation_id":"59b0bb1d-61a2-4e04-94c5-25f3d7be6b8c","resolution":{"observed_at":"2026-08-08T23:25:10.806924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.785636Z","title":"Can the algorithm decrease distance to the true w∗ or not?","venue":null,"work_id":"e6a7e5f9-bfaa-4042-b9e4-ce10a4bedd41","year":2019},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.676617Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:e7f99bf5f679da96495f0253bec8fa53a906d8ba104e9faf875cb278befa1648","observation_id":"24bfd7e7-6728-4022-8bb1-728f4fcff3bf","resolution":{"observed_at":"2026-08-08T23:25:10.789014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.776127Z","title":"By incorporating datasets that span various linguistic challenges, GLUE provides a rigorous testbed for assessing the generalization capabilities of NLP models","venue":null,"work_id":"ac318584-bfd3-40f2-b9f6-e88421a29a3a","year":2019},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.680098Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:15b441162b6a053893a1f3460802d80d81cc14fca8cb8f81f145a18a0057b58d","observation_id":"5d272659-e35a-4798-b2e5-0ca37c106cf9","resolution":{"observed_at":"2026-08-08T23:25:10.779615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.766610Z","title":"Generative Models We additionally evaluate our method using T5 (Raffel et al., 2020), a state-of-the-art text-to-text transformer model developed by Google Research","venue":null,"work_id":"38e11924-80eb-44c1-8085-1df4c9c65bd4","year":2020},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.683435Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:1df8b73a8697fbca06e548a68dacc7f69113fc65cfdd53656b84e83dca62f809","observation_id":"edfb27bc-b8cb-49bd-bf48-481542a35e3f","resolution":{"observed_at":"2026-08-08T23:25:10.770046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.840671Z","title":"and Chen, B","venue":null,"work_id":"4ac665f9-51e6-4da5-967f-a9b636012df0","year":2024},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.643664Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:3b3b1318eb3b8d61c54091776957b706672d7b5953a61aba0a917085383fb014","observation_id":"33446e0d-3a93-423a-9084-dbfb50686d64","resolution":{"observed_at":"2026-08-08T23:25:10.843814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.822237Z","title":null,"venue":null,"work_id":"e6a41784-5365-47ac-9d43-8bf42308ca67","year":2021},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.662157Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:f246a468d7e0eb9f57861c7c1498cb7231132c8a60684f774aeb2ed75fe40c9c","observation_id":"5b7643e7-acca-4ffd-b11e-1b2b9100777c","resolution":{"observed_at":"2026-08-08T23:25:10.825364Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.849594Z","title":"Overview of the iwslt 2017 evaluation campaign","venue":null,"work_id":"ef0d6837-ea9c-410d-a27b-0b35e2946509","year":2017},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.632349Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:8b2b5160b5d81adf2d648fb4b2d85125acd6caffcd9fa1ce20db2e55455734eb","observation_id":"149ca8d5-2ea9-48ed-80d9-fe15be0cfbf8","resolution":{"observed_at":"2026-08-08T23:25:10.852818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.794967Z","title":"By finetuning RoBERTa on GLUE, we assess its generalization capabilities and robustness","venue":null,"work_id":"b64a1781-4fc6-4fd3-a0ac-4c235a87189a","year":2019},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.673215Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:f67b7306b99632b2a6b101dbdcd331bb5ae62b43b7d83bba39f0db31a27aa261","observation_id":"63e6757f-4e0e-4332-9742-3a10ca53c29c","resolution":{"observed_at":"2026-08-08T23:25:10.798065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.05250","last_updated":"2016-10-11T02:42:36Z","snapshot_observed_at":"2026-08-08T11:05:45.903773Z","submitted_at":"2016-06-16T16:36:00Z","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05250","snapshot_observed_at":"2026-08-08T23:25:10.636231Z","title":"Squad: 100,000+ questions for machine comprehension of text","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.636231Z"},"links":{"cited_paper":"/paper/1606.05250","citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:f7c5ee61bab0284d6006adc8eb997dc4d3bf90f962face5d6178a0a8f3b93997","observation_id":"a4188f0c-1a37-4bed-9711-b058904b163d","resolution":{"observed_at":"2026-08-08T23:25:10.636231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.09767","last_updated":"2019-05-03T12:58:04Z","snapshot_observed_at":"2026-07-06T06:41:03.009337Z","submitted_at":"2018-05-24T16:38:51Z","title":"Local SGD Converges Fast and Communicates Little","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.09767","snapshot_observed_at":"2026-08-08T23:25:10.639899Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.639899Z"},"links":{"cited_paper":"/paper/1805.09767","citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:4943f82c278296fcaf476e3539de3aac17d6db3c912d66c38a47a19f0605dfe7","observation_id":"d272633e-84c3-4551-9f32-b3ad7aaeb6fd","resolution":{"observed_at":"2026-08-08T23:25:10.639899Z","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-08T23:25:10.812709Z","title":"Their analysis reveals an inverse logarithmic dependence on the confidence level","venue":null,"work_id":"f0d94820-b561-4f7a-854d-8089a1ce0dfa","year":2020},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.665781Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:7a3a996e1895ab822454679839d94099d18021f39a5764c6d70414257a0e1204","observation_id":"c7fdc244-cff0-41df-9a20-ba775f23779a","resolution":{"observed_at":"2026-08-08T23:25:10.816389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:25:10.831317Z","title":"15 C.2 Dynamics of Avg- L2Clip under Failing Compute Nodes","venue":null,"work_id":"2850f4ef-3ee8-4ec8-947e-83f47626a9a1","year":2017},"citing_paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T23:25:10.658625Z"},"links":{"citing_paper":"/paper/2502.04164"},"observation_digest":"sha256:24423cc16cee93df707fde14414eed47d2b75e8b2820a91c521ba57f6593e8a4","observation_id":"d2cd17d3-1787-4b55-b2c4-392104097000","resolution":{"observed_at":"2026-08-08T23:25:10.834534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.04164","last_updated":"2025-08-14T07:03:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T17:56:19.846534Z","submitted_at":"2025-02-06T15:47:18Z","title":"Efficient Distributed Optimization under Heavy-Tailed Noise"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":15},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 4 inbound Pith citation observations for arXiv:2502.04164."}