{"as_of":"2026-08-11T11:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7bb5dbad9b6ddf7a4c0018fac5fd26165da0ce87e50754fcd218fc7761b5d530","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:10:43.689753Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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.09621/citation-record","integrity":"/paper/2501.09621/integrity","json":"/paper/2501.09621/citation-record.json","paper":"/paper/2501.09621"},"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-10T20:10:44.616987Z","title":"Robust training in high dimensions via block coordinate geometric median descent","venue":null,"work_id":"3ddd97ca-1f31-4910-9e86-830409a21211","year":2022},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.409301Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:284355432961b45783ae64f7bd1e86d5c8de23aa2e8666e7b7be19f6730bc547","observation_id":"3074be22-59f7-42c7-a388-ac7313c0ddb9","resolution":{"observed_at":"2026-08-10T20:10:44.622348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.592563Z","title":"Byzantine stochastic gradient descent","venue":null,"work_id":"561423a3-3248-4cc6-bf6e-b6798d38ed44","year":2018},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.417531Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:2f439d9caeb64afb30261883d4ffb1f4bc635f039751f17a2e42b01b1b36ff84","observation_id":"852e1621-ab87-49bb-943d-c682c9f447ef","resolution":{"observed_at":"2026-08-10T20:10:44.600547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.14368","last_updated":"2021-04-02T17:25:48Z","snapshot_observed_at":"2026-08-05T07:11:03.003731Z","submitted_at":"2020-12-28T17:19:32Z","title":"Byzantine-Resilient Non-Convex Stochastic Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.14368","snapshot_observed_at":"2026-08-10T20:10:43.423034Z","title":"Byzantine-resilient non-convex stochastic gradient descent","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.423034Z"},"links":{"cited_paper":"/paper/2012.14368","citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:1a54d1a1e4348aa624a7fdc05ea3b2c6afaa74365d7376fd0ca86e2826d0babc","observation_id":"23811c01-b92a-4aa5-86d9-2c4278582225","resolution":{"observed_at":"2026-08-10T20:10:43.423034Z","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-10T20:10:44.567605Z","title":"Fixing by mixing: A recipe for optimal byzantine ml under heterogeneity","venue":null,"work_id":"d3b17acf-1434-40d4-8a13-a27a44791656","year":2023},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.432006Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:e38f501d8f733b6ffd52a83df12be44102e48bc4011d2da8b44224bf0afb370d","observation_id":"17a25422-6399-4452-adc2-57786619250d","resolution":{"observed_at":"2026-08-10T20:10:44.575300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.545091Z","title":"A tight convergence analysis for stochastic gradient descent with delayed updates","venue":null,"work_id":"a80c516e-6f85-41f9-ae63-f3701a90c60b","year":2020},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.438825Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:f605be2cd98ba163b52f07798503b432efb845c92958acb0d623779d07d15daa","observation_id":"f01e5eb3-befb-41ee-b470-7bb87e1fab34","resolution":{"observed_at":"2026-08-10T20:10:44.551737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.521256Z","title":"Asynchronous distributed learning: Adapting to gradient delays without prior knowledge","venue":null,"work_id":"cbca5c35-c300-4e5b-a3eb-b60bf22787ef","year":2021},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.444552Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:79bccac7520ead76d5e7d97409b25cffe3bd78da9d15a43646c1d53832f9c93c","observation_id":"0f04219f-fab4-4ced-9913-c8b0cc59cf10","resolution":{"observed_at":"2026-08-10T20:10:44.528544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.449168Z","title":"A little is enough: Circumventing defenses for distributed learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.449168Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:961e21c47a0336751dd3c2366033b459d8b7784e4085a4d46accc6b7f3ee2f37","observation_id":"d48f9259-209a-4b34-8127-93ac20997c60","resolution":{"observed_at":"2026-08-10T20:10:43.449168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:10:43.453740Z","title":"Machine learning with adversaries: Byzantine tolerant gradient descent","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.453740Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:22e502cd97ac37348214a0057669d54022ec18f6fca36857066ff958f291cacb","observation_id":"e61cc54f-0ed5-4365-bbe4-645c0021c5c8","resolution":{"observed_at":"2026-08-10T20:10:43.453740Z","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-10T20:10:44.469220Z","title":"Distributed statistical machine learning in adversarial settings: Byzantine gradient descent","venue":null,"work_id":"f5b002c4-dab1-4d1a-9300-4caf136a1a69","year":2017},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.458623Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:d0139ddcbfd165f9ec4e6c1e1c48c500fbd35596a42f0a17f2e66ab5b4c86102","observation_id":"fedbe929-836d-48c6-a36a-69eaa5b14c17","resolution":{"observed_at":"2026-08-10T20:10:44.479071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.445215Z","title":"Asynchronous stochastic optimization robust to arbitrary delays","venue":null,"work_id":"edd3c30a-9239-4201-846c-d6fae44c9cfe","year":2021},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.464306Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:a79b468ac31c4af3faac3720f157c831451a21f61ca227358e69173b1b8ada78","observation_id":"00c281a1-44c7-416b-aad9-0fc76dd9cee2","resolution":{"observed_at":"2026-08-10T20:10:44.451517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.418760Z","title":"Anytime online-to-batch, optimism and acceleration","venue":null,"work_id":"f9b585eb-34c9-436e-a539-48eea0c6661c","year":2019},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.469446Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:909a76df90fa9ea846f0785ae9f15f43f030c90b262e0bc03ca00f513ea2cc20","observation_id":"2a87d5a2-c438-4830-9461-ac58e5c6f849","resolution":{"observed_at":"2026-08-10T20:10:44.426510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.474856Z","title":"Momentum-based variance reduction in non-convex sgd","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.474856Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:b58876b56ed0fafd2419e1e0a0ae5422a383aec5e2ca21fe9e1f28990b50585b","observation_id":"c2b6f27e-9457-4185-9e6e-ee46460994ad","resolution":{"observed_at":"2026-08-10T20:10:43.474856Z","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-10T20:10:44.381115Z","title":"Fault tolerant ml: Efficient meta-aggregation and synchronous training","venue":null,"work_id":"d7740f23-d4e0-4821-9861-914c51ffdbad","year":2024},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.479553Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:92fe0bfae2ca9b8eefe96df41f059c77bd10f68e2f9c517e6de50b27654e5dea","observation_id":"681f37b6-568c-4772-8a33-1d8941e887ab","resolution":{"observed_at":"2026-08-10T20:10:44.386138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.360059Z","title":"Asynchronous byzantine machine learning (the case of sgd)","venue":null,"work_id":"93290edb-abe9-4ff9-bbf4-c5791422ff77","year":2018},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.485956Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:36c9e0ba77ecacccce66401a9edd5a13d8fc9925ca8af014df156e254754ba1b","observation_id":"d89bd4b5-63ae-47ce-9906-2d8255a9db38","resolution":{"observed_at":"2026-08-10T20:10:44.366806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.494140Z","title":"Optimal distributed online prediction using mini-batches","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.494140Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:5fb369ecb25274fd0dc8d824ec175aef913d1c8bf87bc1b8d94f870639081064","observation_id":"760e5692-fef9-4db0-afcc-277ddbd5d134","resolution":{"observed_at":"2026-08-10T20:10:43.494140Z","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-10T20:10:44.316010Z","title":"Distributed momentum for byzantine-resilient stochastic gradient descent","venue":null,"work_id":"497b8838-6dc6-4ad1-89ba-90d0ea39e796","year":2021},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.501219Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:cee7aa61c6cca96725e2e9800047841bb587bfbedfe2d875d8e521614f24592a","observation_id":"f655c7b5-8f81-43f6-800c-94edec8cf88f","resolution":{"observed_at":"2026-08-10T20:10:44.324515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.290621Z","title":"Online learning and stochastic approximations","venue":null,"work_id":"6ce98cd0-3d2b-4c99-980a-a751512a62ce","year":1998},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.507307Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:cb654b2af6ac718e878dcbacabcb0dad2fdae248309348c5aecf68aecb51a403","observation_id":"240a6873-e1fe-4886-aeec-26c7545212ec","resolution":{"observed_at":"2026-08-10T20:10:44.295770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.274085Z","title":"Aflguard: Byzantine-robust asynchronous federated learning","venue":null,"work_id":"2b035418-dc4c-478e-9f8d-6249f46fb483","year":2022},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.518698Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:868711ff8f226e5d2dde23e2bd86d88c11e7118c1e76b5b71e0f5eaa508d7e33","observation_id":"53c73060-2821-4e0c-8403-251395697bee","resolution":{"observed_at":"2026-08-10T20:10:44.280371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.253276Z","title":"Byzantine machine learning made easy by resilient averaging of momentums","venue":null,"work_id":"bba6614b-e7ef-4360-b656-9f17df9fe77b","year":2022},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.524203Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:5236dc26eb133aec9fab5f35d95c59a998600ff80ee3cc62b83cbca5188480bd","observation_id":"6d3b7b9e-8d71-41a5-a359-3157769e2a82","resolution":{"observed_at":"2026-08-10T20:10:44.259634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.230905Z","title":"The hidden vulnerability of distributed learning in byzantium","venue":null,"work_id":"41d336e2-48bc-4f6f-9e89-1ffb2dde773d","year":2018},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.529010Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:be7a4cdb68634948f8e0d6ce3627f1baa2ef51da1d9634ca07195e3a9df5e649","observation_id":"a06ddaf7-5034-4f9a-b29d-a105aad490f9","resolution":{"observed_at":"2026-08-10T20:10:44.237301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.203332Z","title":"Byzantine machine learning: A primer","venue":null,"work_id":"e22e5ae7-087e-436b-a27e-d28e1f55a3cd","year":2023},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.533798Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:c6f6fa88718d0276f12a06214827c12f8fd83cf9f2c8cdaf736ee7490fced734","observation_id":"8e766cc5-7b08-40dd-8abe-a6d7e5d1b0de","resolution":{"observed_at":"2026-08-10T20:10:44.209357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.544211Z","title":"Introduction to online convex optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.544211Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:ca4ae6f393f6febc784580bf66773937d0b14028a5496e92b950e9cf58203e92","observation_id":"54dae628-ed7b-41ff-b1c5-a3f89573bce6","resolution":{"observed_at":"2026-08-10T20:10:43.544211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09365","last_updated":"2023-11-22T09:08:15Z","snapshot_observed_at":"2026-08-07T05:21:15.626151Z","submitted_at":"2020-06-16T17:58:53Z","title":"Byzantine-Robust Learning on Heterogeneous Datasets via Bucketing","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09365","snapshot_observed_at":"2026-08-10T20:10:43.550047Z","title":"Byzantine-robust learning on heterogeneous datasets via bucketing","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.550047Z"},"links":{"cited_paper":"/paper/2006.09365","citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:b07736f72b9f36f302653617ca4e0bc562ba3f1b8d6ddc26a46666073d4995aa","observation_id":"52293f56-1210-497d-b8f6-cca42c480a80","resolution":{"observed_at":"2026-08-10T20:10:43.550047Z","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-10T20:10:44.158832Z","title":"Learning from history for byzantine robust optimization","venue":null,"work_id":"e348f4fa-0991-4b35-8aa6-cc1cfc7fecbf","year":2021},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.556588Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:df6480cc8c536e48b2b44fa3a9e4174f19f7d74e3789b3249b5b6291b736ad1e","observation_id":"1e24099c-5e51-43af-97ac-4247a77aafc0","resolution":{"observed_at":"2026-08-10T20:10:44.164941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.139687Z","title":"Unixgrad: A universal, adaptive algorithm with optimal guarantees for constrained optimization","venue":null,"work_id":"a7589237-7ad2-44b5-97ed-f896d84cd6af","year":2019},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.562429Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:afdb04364c9313fdc23068bd564da2c37e0874748038161b57b05f4f26f01004","observation_id":"bb2cc015-3f0c-4fc4-bde5-2509fdd0b28d","resolution":{"observed_at":"2026-08-10T20:10:44.144963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.117053Z","title":"The cifar-10 dataset","venue":null,"work_id":"6f842d17-7da2-4251-928b-b7b2eac46353","year":2014},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.569780Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:73e876354712e0657bef852943aa907376056c2fa04e3ebc75483a137291316a","observation_id":"9c835be1-5c19-4a41-830f-aaf8f0bf79c2","resolution":{"observed_at":"2026-08-10T20:10:44.124778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:44.088219Z","title":"The byzantine generals problem","venue":null,"work_id":"175b3fc4-6601-40ae-8ecb-a738ae45ef01","year":2019},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.578377Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:e2afe687d5e984b4df4eb0a1ca7099729a24a9c9524742ac950c2100e683147a","observation_id":"c0b9da89-715a-4068-9ea9-61d771270256","resolution":{"observed_at":"2026-08-10T20:10:44.093024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0911.0491","last_updated":"2009-11-03T05:25:51Z","snapshot_observed_at":"2026-07-06T02:03:36.168517Z","submitted_at":"2009-11-03T05:25:51Z","title":"Slow Learners are Fast","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0911.0491","snapshot_observed_at":"2026-08-10T20:10:43.587146Z","title":"Slow learners are fast","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.587146Z"},"links":{"cited_paper":"/paper/0911.0491","citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:f6b9c5281117c26400e0b64aad3cffacfc47480dd0cf9c73c1a046ccb0f6f7db","observation_id":"825d3919-43fe-483f-ac2a-e006dbf2746b","resolution":{"observed_at":"2026-08-10T20:10:43.587146Z","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-10T20:10:44.066519Z","title":"Mnist handwritten digit database, 2010","venue":null,"work_id":"047d1faa-1c05-4872-8fba-da89df0a97c1","year":2010},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.597070Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:579990e24d74e68b1fc0156a064e0c979377094d733b750f3370be0019d18f1e","observation_id":"ea492579-1c55-402e-8c5e-f3a6445d2587","resolution":{"observed_at":"2026-08-10T20:10:44.076479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04172","last_updated":"2025-03-05T06:51:11Z","snapshot_observed_at":"2026-08-05T18:40:30.657863Z","submitted_at":"2023-04-09T06:18:34Z","title":"$\\mu^2$-SGD: Stable Stochastic Optimization via a Double Momentum Mechanism","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04172","snapshot_observed_at":"2026-08-10T20:10:43.603582Z","title":"^2 -sgd: Stable stochastic optimization via a double momentum mechanism","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.603582Z"},"links":{"cited_paper":"/paper/2304.04172","citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:140a777d7ee9a202eaf6b2064892d8ab0aaee508c51e3f204a6f247e07886e3c","observation_id":"ece070db-4477-4351-a538-7c88003dfe9f","resolution":{"observed_at":"2026-08-10T20:10:43.603582Z","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-10T20:10:44.045754Z","title":"Asynchronous sgd beats minibatch sgd under arbitrary delays","venue":null,"work_id":"4aaedaca-2c1c-40d0-bc40-cce17971738b","year":2022},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.609293Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:e0f27b56c73f9ea536eb3ff14156fd107a087c9227449d92617f663b3d6b145f","observation_id":"040c8fb5-4906-49b7-be8a-7d46695e2dbe","resolution":{"observed_at":"2026-08-10T20:10:44.051930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.617918Z","title":"Some methods of speeding up the convergence of iteration methods","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.617918Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:7368efeab6a8ffa6d5b57eb85119fee1f232d6a0ad6cfdb3553659d21a857d1c","observation_id":"dce3318c-019f-453d-b06e-e73f89d03eb7","resolution":{"observed_at":"2026-08-10T20:10:43.617918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05350","last_updated":"2021-06-16T15:44:47Z","snapshot_observed_at":"2026-08-10T03:02:49.223784Z","submitted_at":"2019-09-11T20:54:49Z","title":"The Error-Feedback Framework: Better Rates for SGD with Delayed Gradients and Compressed Communication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05350","snapshot_observed_at":"2026-08-10T20:10:43.622565Z","title":"The error-feedback framework: Better rates for sgd with delayed gradients and compressed communication","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.622565Z"},"links":{"cited_paper":"/paper/1909.05350","citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:ce0f569d8a350c1e1a0fa5ab8507964f507eaccdc97f49176b73a655931cf616","observation_id":"7fa0e1ab-6e9f-470c-b19b-1f6c11bc3f21","resolution":{"observed_at":"2026-08-10T20:10:43.622565Z","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-10T20:10:44.008852Z","title":"Fall of empires: Breaking byzantine-tolerant sgd by inner product manipulation","venue":null,"work_id":"c6f57a82-6d6a-437b-a056-ec5a2b187718","year":2020},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.630851Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:68e79e80cf89f595f9064638999f7afd8870bfe0f391f91daa9b53157595bc07","observation_id":"8bf4456d-2953-4dc7-9beb-2d3a7cb7d0ea","resolution":{"observed_at":"2026-08-10T20:10:44.021439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.990102Z","title":"Zeno++: Robust fully asynchronous sgd","venue":null,"work_id":"48d4196b-8ddc-4c06-87cd-05499fd1061f","year":2020},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.639356Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:fefd55250bad92cb1853aea2f67c67a694fb921446d8176557b9a2c6c1f80eeb","observation_id":"0502525a-d912-4a8a-b77a-d9dcbd702b9b","resolution":{"observed_at":"2026-08-10T20:10:43.996090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.970631Z","title":"Basgd: Buffered asynchronous sgd for byzantine learning","venue":null,"work_id":"e28ccdc9-d9e8-48e3-b997-22720c8b0ec1","year":2021},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.655278Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:3f5bf1108d89222326cae8998da807970fe5e5d0b885b6b6311684842f2140bf","observation_id":"c810f3e9-9587-4ed1-9a5e-2481adc59a19","resolution":{"observed_at":"2026-08-10T20:10:43.978044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.951892Z","title":"Buffered asynchronous sgd for byzantine learning","venue":null,"work_id":"5ba2f634-3099-4950-af42-24c59c668bb1","year":2023},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.661886Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:a14975efab5c709c17791dd02c7b20330fd917067223ba4f8d8d6d1f0dada0e9","observation_id":"191839d7-69fa-4d9d-9f60-e8864793f35e","resolution":{"observed_at":"2026-08-10T20:10:43.957895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.669538Z","title":"Byzantine-robust distributed learning: Towards optimal statistical rates","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.669538Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:788907c8897641c2f0f118fda93154e0ef059883fd1bcf3f87cc7f08ce1ea5bf","observation_id":"59d81b98-b7e5-4a4c-8ae9-234c516d2477","resolution":{"observed_at":"2026-08-10T20:10:43.669538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-06T23:27:24.356320Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.18223","snapshot_observed_at":"2026-08-10T20:10:43.676745Z","title":"A survey of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.676745Z"},"links":{"cited_paper":"/paper/2303.18223","citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:a5172b17e66c333166f4c1582e8502c967b9fb321e3355df77b5fb5338c9c3e9","observation_id":"c3e900f6-ec22-4025-adbe-7fe7fc27d2b8","resolution":{"observed_at":"2026-08-10T20:10:43.676745Z","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-10T20:10:43.899951Z","title":"Asynchronous byzantine-robust stochastic aggregation with variance reduction for distributed learning","venue":null,"work_id":"0386cbbd-412a-48c1-bc05-56105083907f","year":2023},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.683818Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:fca2e77bd2c3046098dc6aff1841811d3f703c7450f3f14b60d4ff13af30b36f","observation_id":"fc0b7424-7146-4e2a-9e6c-3db9191c68c1","resolution":{"observed_at":"2026-08-10T20:10:43.905867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:10:43.873322Z","title":"Asynchronous byzantine-robust stochastic aggregation with variance reduction for distributed learning","venue":null,"work_id":"6f955c60-2d85-4896-987f-caf6320cad6d","year":2024},"citing_paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T20:10:43.689753Z"},"links":{"citing_paper":"/paper/2501.09621"},"observation_digest":"sha256:4be035a127c34b0ff07db1a649310245e0021d1bf4c41cd9ebacfe1a69970c96","observation_id":"a2d0d8c0-a55c-47dc-8213-dece72b088d3","resolution":{"observed_at":"2026-08-10T20:10:43.881444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.09621","last_updated":"2025-06-04T13:31:26Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T19:47:48.888569Z","submitted_at":"2025-01-16T16:00:52Z","title":"Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":28},"total_outbound_references":41},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2501.09621."}