{"as_of":"2026-08-20T17:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:391d37fe0b7998d45f31fdd3d0be1eed319bdda9ee92d9b6df40618f8f898fb4","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:18:22.224690Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:57:00.543598Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:57:00.576146Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"cited_work":{"arxiv_id":"2412.17740","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.17740","snapshot_observed_at":"2026-08-07T04:57:00.576146Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","venue":"cs.LG","work_id":"0914b9f5-291c-4464-8a0f-b7bdca0e2e18","year":2024},"citing_paper":{"arxiv_id":"2506.09438","last_updated":"2025-06-11T06:44:34Z","snapshot_observed_at":"2026-08-18T02:00:30.703411Z","submitted_at":"2025-06-11T06:44:34Z","title":"Generalization Error Analysis for Attack-Free and Byzantine-Resilient Decentralized Learning with Data Heterogeneity","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T04:57:00.543598Z"},"links":{"cited_paper":"/paper/2412.17740","citing_paper":"/paper/2506.09438"},"observation_digest":"sha256:a12b32fe90bb07b4218e9cc168a67b69d335977e3cb5a2fd185c811d19fbd207","observation_id":"9cc02eaf-d33f-4b4c-859c-e540e83fab3c","resolution":{"observed_at":"2026-08-07T04:57:00.581775Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.17740/citation-record","integrity":"/paper/2412.17740/integrity","json":"/paper/2412.17740/citation-record.json","paper":"/paper/2412.17740"},"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-11T05:18:25.995017Z","title":"Attacks on Robust Distributed Learning Schemes via Sensitivity Curve Maximization,","venue":null,"work_id":"d6c89c6e-027f-47ea-9deb-63d3bf058aba","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.899670Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:289cc5122afbfa196b3b54f1e0125e7013ab97535a15166d97ed61a04fe798fd","observation_id":"bc4a83a1-bf19-415f-a982-e74e9fd79c13","resolution":{"observed_at":"2026-08-11T05:18:25.999564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.977630Z","title":"Networked Signal and Information Processing: Learning by multiagent systems,","venue":null,"work_id":"b02cfc71-dcec-42ef-aa69-b32478eab79b","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.906503Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:89041d652d0b02eaa1cce4d9a052a2c0c2b8dcd7385e0c72796eb4637343dd41","observation_id":"9a90b12c-7d22-47e7-8a3a-b9a03a0e7327","resolution":{"observed_at":"2026-08-11T05:18:25.983457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.848200Z","title":null,"venue":null,"work_id":"53d6971a-7c87-499b-a66e-5bb1bdcbd980","year":2014},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.912936Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:96773f0571d14df7de4d3dfd1dbdb587e744452b38fd837147868e13f6181f26","observation_id":"d072386a-76db-48e3-895e-a400d844b0cb","resolution":{"observed_at":"2026-08-11T05:18:25.967044Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.636340Z","title":"Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent,","venue":null,"work_id":"edee08aa-bde0-4d15-b6aa-2c338f419de5","year":2017},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.919111Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:dd10c82841ead990e743d32687a588a3d1b53770e38df4471cd0650b150360a7","observation_id":"ab7be846-5a7e-4ff9-bb87-01abba2f5ebb","resolution":{"observed_at":"2026-08-11T05:18:25.761277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.620629Z","title":"Multitask Learning Over Graphs: An Approach for Distributed, Streaming Ma- chine Learning,","venue":null,"work_id":"372e7ab2-e1ab-40ad-9fdb-99ac4440a8c4","year":2020},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.924924Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:b3e399fbbcf0d1917f24a1176f26db90515c237d218461adb9ccf372fb3546c4","observation_id":"f3829944-3dbb-46a2-92c7-75f7e91129dc","resolution":{"observed_at":"2026-08-11T05:18:25.626326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.604559Z","title":"The Byzantine Generals Prob- lem,","venue":null,"work_id":"611dbfd4-2d70-4f9b-a961-d85684af691a","year":1982},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.930473Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:ec005196bd330e603593cc48355786982a75befe89479a1cfaaf15d4b149194d","observation_id":"4b98f08f-8262-4e43-bb6a-97fd870b6ed2","resolution":{"observed_at":"2026-08-11T05:18:25.609711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.402760Z","title":"Byzantine Machine Learning: A Primer,","venue":null,"work_id":"db9f93bb-a83a-42c3-889a-047328797706","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.936311Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:51be7a082be5a91214ebb14e4af0ad85fed144b191be47ec30762ebd952a0ffa","observation_id":"82807941-a937-4b86-a127-5e2da17b5591","resolution":{"observed_at":"2026-08-11T05:18:25.515866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.331523Z","title":"Communication Efficient Learning of Deep Networks from Decentralized Data,","venue":null,"work_id":"87338d98-ee44-46d1-8c39-3c0f0936cc99","year":2017},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.941022Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:5f67006095f3b6c2eebbb452033c95e0e29f312355e54166cb295a3b574c77fc","observation_id":"55a201f5-c5ac-4811-b64c-549c41998df7","resolution":{"observed_at":"2026-08-11T05:18:25.337914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.313531Z","title":"Federated Learning Under Impor- tance Sampling,","venue":null,"work_id":"852a0270-9a2b-4a93-866f-b8cecc51153e","year":2022},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.945231Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:ad0437f66454279f39f716de6b6c5c45af1a57db12f4509c85169d0a092d1dbf","observation_id":"c1ad4f3e-2387-4016-9502-b82b3cf19347","resolution":{"observed_at":"2026-08-11T05:18:25.320116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.295392Z","title":"Federated Learning of Tensor Generalized Linear Models with low Separation Rank,","venue":null,"work_id":"a03a8313-9c92-49ab-8d5a-c96111addd7f","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.950103Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:0b5940e540a296aeb285c531cb6bfc89d5557f2e479585910ef4786e5d6ad994","observation_id":"760ee2f3-3e3f-4baa-9e9d-421f863b8f70","resolution":{"observed_at":"2026-08-11T05:18:25.301691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.249225Z","title":"Distributed Learning in Non-Convex Environments—Part I: Agreement at a Linear Rate,","venue":null,"work_id":"a8912567-4e5d-453f-b5c5-6cebc1a93ad1","year":2021},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.954928Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:a1bf5fc1c4761df528a883fb19868525022d2ad13c35c1a02b08ed239be9115e","observation_id":"e93b900a-c10f-4f1f-9692-84ad51a89eaa","resolution":{"observed_at":"2026-08-11T05:18:25.285217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.159893Z","title":"Mean Aggregator Is More Robust than Robust Aggregators under Label Poisoning Attacks,","venue":null,"work_id":"2d38abfc-1154-49ed-ad83-9f7334635bd6","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.959784Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:dbc50cae03fbf53c5d2bc08255ea26690f40a1587e020709e6bc7ef72cf0ccc6","observation_id":"a143c4a5-6074-4f2c-9f13-386276f9f126","resolution":{"observed_at":"2026-08-11T05:18:25.165119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.142052Z","title":"Byzantine-Robust Dis- tributed Learning: Towards Optimal Statistical Rates,","venue":null,"work_id":"72022bcf-f1a5-4bfa-9b89-e51f557c2247","year":2018},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.964458Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:62b6d94a0a524d9b662eb61e6e1def10f3772d781995efcc169c2d8a8170903a","observation_id":"62367861-c33b-4f18-b3b4-144b7db63d18","resolution":{"observed_at":"2026-08-11T05:18:25.148387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.02757","last_updated":"2017-03-08T09:26:36Z","snapshot_observed_at":"2026-08-16T21:10:44.237485Z","submitted_at":"2017-03-08T09:26:36Z","title":"Byzantine-Tolerant Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.02757","snapshot_observed_at":"2026-08-11T05:18:21.969525Z","title":"Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.969525Z"},"links":{"cited_paper":"/paper/1703.02757","citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:3cd2d3beef95826b1905db916e951a3e147681915b4fb2b97b0b4fd8ffe67608","observation_id":"d859d062-a0d9-4b43-aa5e-ab066efa474a","resolution":{"observed_at":"2026-08-11T05:18:21.969525Z","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-11T05:18:25.125658Z","title":"Robust Aggregation for Federated Learning,","venue":null,"work_id":"6ff35905-55f3-4735-b23a-100aacdc1b6b","year":2022},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.974226Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:69a2cf82764df7a68aea211727c9aabff94efab014fe965c8e00d7fc797277a3","observation_id":"6e212a19-3306-4ffa-91ac-8b1f3c56a2ee","resolution":{"observed_at":"2026-08-11T05:18:25.131654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12581","last_updated":"2024-03-25T11:58:04Z","snapshot_observed_at":"2026-08-16T15:06:10.880889Z","submitted_at":"2023-08-24T05:49:58Z","title":"A Huber Loss Minimization Approach to Byzantine Robust Federated Learning","version":2},"cited_work":{"arxiv_id":"2308.12581","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.12581","snapshot_observed_at":"2026-08-11T05:18:22.489753Z","title":"A Huber Loss Minimization Approach to Byzantine Robust Federated Learning","venue":"cs.LG","work_id":"3a2c73da-2496-4335-ba71-608f346e63f6","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.978544Z"},"links":{"cited_paper":"/paper/2308.12581","citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:235dab5c0a2b392d5692b037e119615aa57fbfacb9607a6c8d241f3141171030","observation_id":"b5d5e0a7-6080-4318-83c4-f6f7561de527","resolution":{"observed_at":"2026-08-11T05:18:22.495270Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:25.082451Z","title":"Mixed Nash for Robust Federated Learning,","venue":null,"work_id":"76860853-6dab-4265-86a0-b82a795aa7e0","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.983574Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:2935ed6070fb4155a69f29da8636cce047e0d2ed54f9d454f575bf073feac462","observation_id":"1db68fb6-29ec-467a-84c1-0c3ac67dd32e","resolution":{"observed_at":"2026-08-11T05:18:25.115069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.920313Z","title":"MixTai- lor: Mixed Gradient Aggregation for Robust Learning Against Tailored Attacks,","venue":null,"work_id":"7b484f08-5112-4480-9875-ae0af1846715","year":2022},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.988306Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:651753dc1ce069b51037646f3332135142fdc35ac22ae5033d143ea18bce019e","observation_id":"04333dff-8d25-4ae3-94ce-f9a0b018aa8d","resolution":{"observed_at":"2026-08-11T05:18:24.925954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.903223Z","title":"Byzantines Can Also Learn From History: Fall of Centered Clipping in Federated Learning,","venue":null,"work_id":"5418c7ed-e021-4046-b8ea-5e0dc65fb99b","year":2010},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.993080Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:034cdf91af5cbdfe579eadff7d55a828ece1d2e1872480568469412ed3a8fae5","observation_id":"71389853-45fc-45ef-83f1-ae98513ed259","resolution":{"observed_at":"2026-08-11T05:18:24.909511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.886877Z","title":"Byzantine-Robust Federated Learning with Variance Reduction and Differential Privacy,","venue":null,"work_id":"2614024f-5b8f-4827-8af8-9c4086f48eed","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:21.997878Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:abe3edf4da9b8610b174e2ac7f87a178ac61cb4060fbe1eed175226e8a6f4a3d","observation_id":"c0923717-61ee-4a8f-b0fb-629602089a9d","resolution":{"observed_at":"2026-08-11T05:18:24.892864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.00529","last_updated":"2023-03-08T13:43:24Z","snapshot_observed_at":"2026-08-16T16:55:59.775646Z","submitted_at":"2022-06-01T14:40:29Z","title":"Variance Reduction is an Antidote to Byzantines: Better Rates, Weaker Assumptions and Communication Compression as a Cherry on the Top","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.00529","snapshot_observed_at":"2026-08-11T05:18:22.002434Z","title":"Variance Reduc- tion is an Antidote to Byzantines: Better Rates, Weaker Assumptions and Communication Compression as a Cherry on the Top,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.002434Z"},"links":{"cited_paper":"/paper/2206.00529","citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:f29a564af95b616955d8c4bfc7b7914e882df50c7677a6fc4c8a62741313ceed","observation_id":"4e415a52-89dc-4591-bdbf-a44902696d6c","resolution":{"observed_at":"2026-08-11T05:18:22.002434Z","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-11T05:18:24.872308Z","title":"Learning from History for Byzantine Robust Optimization,","venue":null,"work_id":"9c49d151-e3c3-4dc2-99be-c6e49758a805","year":2021},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.007555Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:71b2de98517a35994920439a0acdd242f607ef6f443ef4b309a57f4d0f429a2d","observation_id":"0ab92b4b-4922-44dd-acba-c1719f9e60ce","resolution":{"observed_at":"2026-08-11T05:18:24.877317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.857299Z","title":"Survey on Federated Learning Threats: Concepts, Taxonomy on Attacks and Defences, Experimental Study and Challenges,","venue":null,"work_id":"a92daa2b-a37a-4874-a9ab-7f602e849f24","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.012691Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:f463af67257137d046ac406c8c43b2840021ce39b061698c2dc28810586ef1ef","observation_id":"ca27ec3a-3566-434c-9aa2-516b6b0be9fb","resolution":{"observed_at":"2026-08-11T05:18:24.861903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.741879Z","title":"Reviewing Federated Learning Aggregation Algorithms; Strate- gies, Contributions, Limitations and Future Perspectives,","venue":null,"work_id":"1c14758d-4693-4790-8f5f-b9a579781172","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.017042Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:c756721ebc007f68838489906a094291d78b61bbb030e115d21d1d03df48e886","observation_id":"284a0261-aa55-40cf-bedb-c478a3add07c","resolution":{"observed_at":"2026-08-11T05:18:24.774795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.726592Z","title":"On the Pitfalls of Security Evaluation of Robust Federated Learning,","venue":null,"work_id":"6887ffcd-ed1b-4495-b5a0-dc4aaddb7d6b","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.021692Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:0fe70053c5073e80fa29bbead62caefadda0e80bc3fbc82951ff7d1316eac746","observation_id":"bf852b78-f4ce-4b93-b635-8c6c81399ab2","resolution":{"observed_at":"2026-08-11T05:18:24.731518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.710536Z","title":"Distributed Online Optimization with Byzantine Adversarial Agents,","venue":null,"work_id":"96b37fe3-efaa-4f45-850f-ffb1f653b1b4","year":2022},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.025936Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:50fc562209cade5e92a6de852a4337b7f02f38237481795809f73d3397c3a9d6","observation_id":"c64e3eb2-17a5-49ba-af6c-853b87d334ea","resolution":{"observed_at":"2026-08-11T05:18:24.716279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.665349Z","title":"ByRDiE: Byzantine-Resilient Distributed Coordinate Descent for Decentralized Learning,","venue":null,"work_id":"68d31681-0649-4b77-81db-6a4b1cdad2bd","year":2019},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.030723Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:ea430e2224184b1d5f7c8b5bbf0ac0af38c0705637c0157c93ac9ab56b1c6035","observation_id":"1f585efe-42da-42cc-b487-3186122d85cd","resolution":{"observed_at":"2026-08-11T05:18:24.700544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.500772Z","title":"BRIDGE: Byzantine-Resilient Decentralized Gradient Descent,","venue":null,"work_id":"ef6f92f2-3005-4375-83ff-10f0e3a818c0","year":2022},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.035599Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:cdafd4823a3fe63ca290e6cade7e4a7fb0b8abd5becd48a1af5bf6fb3c56b458","observation_id":"101e11e5-5bb8-4add-88bc-1761cac52497","resolution":{"observed_at":"2026-08-11T05:18:24.549701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.484097Z","title":"Byzantine-Robust Decentralized Learning via Remove-then-Clip Aggregation,","venue":null,"work_id":"56bd4554-34fe-4158-8ae4-4655fc15e153","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.040303Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:c828a2c13c4730fdc2d513db92ea3786f1899a30853db2b8c6048a27d59f2b7c","observation_id":"e2b3e5c0-c897-4504-90a4-2d86384dc0bb","resolution":{"observed_at":"2026-08-11T05:18:24.489956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01545","last_updated":"2023-04-20T15:22:15Z","snapshot_observed_at":"2026-08-16T17:23:53.342388Z","submitted_at":"2022-02-03T12:04:36Z","title":"Byzantine-Robust Decentralized Learning via ClippedGossip","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01545","snapshot_observed_at":"2026-08-11T05:18:22.046031Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.046031Z"},"links":{"cited_paper":"/paper/2202.01545","citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:e930052589318373431c44e6710025d0b69c2a900c4bcb797afcbe30e95f2101","observation_id":"991819ad-7ce6-4e44-a60e-2621b12c3431","resolution":{"observed_at":"2026-08-11T05:18:22.046031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17970","last_updated":"2024-04-27T18:17:36Z","snapshot_observed_at":"2026-08-16T13:57:19.036529Z","submitted_at":"2024-04-27T18:17:36Z","title":"Privacy-Preserving Aggregation for Decentralized Learning with Byzantine-Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.17970","snapshot_observed_at":"2026-08-11T05:18:22.050757Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.050757Z"},"links":{"cited_paper":"/paper/2404.17970","citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:e47ecf0133f566d4381dd5c521e0c043f03f532db03cd734b627f8db35317a08","observation_id":"35c5e864-e238-451e-b7c6-4f7786c26a1a","resolution":{"observed_at":"2026-08-11T05:18:22.050757Z","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-11T05:18:24.469126Z","title":"Byzantine-Resilient Decentralized Stochastic Optimization With Robust Aggregation Rules,","venue":null,"work_id":"8b7be662-6c99-4226-a017-571a499fd962","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.055864Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:9d6424e834aa7040a1db3f588bb187e5ac600f5683252b8d484f8e73c3e6c1a9","observation_id":"e6e65177-f425-4542-8566-4b8dee9fe8fa","resolution":{"observed_at":"2026-08-11T05:18:24.474337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.452760Z","title":"Secure Distributed Optimization Under Gradient Attacks,","venue":null,"work_id":"756df8b5-7f36-45f6-991f-61bdfab7008c","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.060687Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:c14c2c73f53694cc9f3c052f15cc08265484847fb44411c3af97a7ff9dd4ae62","observation_id":"2a5777d5-7420-4e9d-b0df-810cf0303eca","resolution":{"observed_at":"2026-08-11T05:18:24.457901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.328401Z","title":"Robust and Efficient Aggregation for Distributed Learning,","venue":null,"work_id":"0d6a5f58-087d-4c88-9548-2227839a8cef","year":2022},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.065604Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:facbe19d012f85b27cd9d171300018a652bb570dd89986382122972aa366cd7b","observation_id":"706c07d8-fbb7-4290-9b8f-2a06e41e37c7","resolution":{"observed_at":"2026-08-11T05:18:24.403723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.291363Z","title":"Robust M-Estimation Based Distributed Expectation Maximization Algorithm with Robust Aggregation,","venue":null,"work_id":"3aba592a-9a14-4dcf-8b26-6d822d927144","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.070451Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:ccf76dd64c764dd01d90d76cb2ab28f26c896384815dd60ff6776cb43959febf","observation_id":"be128fbe-8c20-46ad-a794-28c38f390e26","resolution":{"observed_at":"2026-08-11T05:18:24.296257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.276095Z","title":"Robust Network Topologies for Distributed Learning,","venue":null,"work_id":"9af5cc7b-9e74-4ccf-a433-a21b76580332","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.074921Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:feb04ceafdaf21eb2b429b0f291ea021c8e0d766a08b207d7ed426f26f9d623c","observation_id":"3ddf22e8-a162-4b9b-b03e-cfab0019d756","resolution":{"observed_at":"2026-08-11T05:18:24.281218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.11815","last_updated":"2021-11-21T19:04:57Z","snapshot_observed_at":"2026-08-05T22:36:46.924843Z","submitted_at":"2019-11-26T20:10:04Z","title":"Local Model Poisoning Attacks to Byzantine-Robust Federated Learning","version":4},"cited_work":{"arxiv_id":"1911.11815","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.11815","snapshot_observed_at":"2026-08-11T05:18:22.362290Z","title":"Local Model Poisoning Attacks to Byzantine-Robust Federated Learning","venue":"cs.CR","work_id":"994dd3c6-b93d-4261-bb65-fba46c6ade2c","year":2019},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.079147Z"},"links":{"cited_paper":"/paper/1911.11815","citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:8d2b8231ee8de3b5d2dd03be7a6ad9a73bdb0f904009325dd9e1de548608a4d1","observation_id":"09d2bfe1-60c8-4563-98bb-c8eb837cac11","resolution":{"observed_at":"2026-08-11T05:18:22.396629Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.260106Z","title":"Manipulating the Byzantine: Optimizing Model Poisoning Attacks and Defenses for Federated Learning.,","venue":null,"work_id":"4e9e426f-3e5e-4876-99f2-f349ef4607e0","year":2021},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.084486Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:906b0260e2816648c33bb9ab41bdb6ed9c332a77fa26da1cbdfcc47fd1d4147b","observation_id":"38ccdf00-2358-48da-9248-92aad6a4d308","resolution":{"observed_at":"2026-08-11T05:18:24.265454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:24.211496Z","title":"Attack of the Tails: Yes, You Really Can Backdoor Federated Learning,","venue":null,"work_id":"fe10cf68-60ec-4592-beb8-992c3ec919a7","year":2020},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.088994Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:226ef3febd599ea8828d5812346c6f4da30b8ca3c4a95936c3fbe29d1e11a8aa","observation_id":"d8cec554-65e8-46c5-8065-4fd0e2353062","resolution":{"observed_at":"2026-08-11T05:18:24.249518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.970240Z","title":"On the (In)security of Peer- to-Peer Decentralized Machine Learning,","venue":null,"work_id":"1936c7c7-62c6-41a2-a8fe-743a467977ae","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.093489Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:67b910d575df313825f8a0d4d87f36ddeee4f3123bf07212054dde6c91b34e67","observation_id":"2ebf84f7-8e93-4a5e-b954-d6c4f61915e7","resolution":{"observed_at":"2026-08-11T05:18:24.083345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08632","last_updated":"2024-07-11T16:12:53Z","snapshot_observed_at":"2026-08-16T13:35:01.530924Z","submitted_at":"2024-07-11T16:12:53Z","title":"Generalization Error Matters in Decentralized Learning Under Byzantine Attacks","version":1},"cited_work":{"arxiv_id":"2407.08632","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.08632","snapshot_observed_at":"2026-08-11T05:18:22.263251Z","title":"Generalization Error Matters in Decentralized Learning Under Byzantine Attacks","venue":"cs.LG","work_id":"f06ad40c-a816-4c36-80e0-4ddf2f50ede7","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.097893Z"},"links":{"cited_paper":"/paper/2407.08632","citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:ef5d5428af07a8a338553537ee5251ea35c7eb065f75d4dd467957d851f8ac79","observation_id":"cccacdfa-c68d-44df-830d-ff978122d817","resolution":{"observed_at":"2026-08-11T05:18:22.302496Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.811981Z","title":"Fall of Empires: Breaking Byzantine- Tolerant SGD by Inner Product Manipulation,","venue":null,"work_id":"b54ee3ff-fbdd-4e7a-bc4f-a1700122f4c5","year":2020},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.102725Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:bb41b579173ec0e261ac1f7f09c3fabaa4bcaf865313d000f6f1dc61e014ef38","observation_id":"3877f10d-bf53-4c7d-a9d1-8e177419b52c","resolution":{"observed_at":"2026-08-11T05:18:23.816556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.795831Z","title":"A Little Is Enough: Cir- cumventing Defenses For Distributed Learning,","venue":null,"work_id":"44a8b415-5caf-4502-aaa6-8be4ba7ee67c","year":2019},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.107945Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:ac5bf364d529f0a41be0d2b45b4c58dcb0e03f71e7340e2439842c25f3cf6c95","observation_id":"5ed97dfa-24fb-4e88-a6db-dfd81dffab94","resolution":{"observed_at":"2026-08-11T05:18:23.802153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.668448Z","title":"Threats to Federated Learning,","venue":null,"work_id":"777507c6-a1b8-4630-994d-1f4e88678f1a","year":2020},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.112651Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:001a15664c6163630fdf6cf1dcc480f24f282e0c85152a9a03f761eff002d874","observation_id":"ded3354d-6013-408e-aef4-e329af8bb77c","resolution":{"observed_at":"2026-08-11T05:18:23.785331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.607477Z","title":"A robust analysis of adversarial attacks on federated learning environments,","venue":null,"work_id":"7450f0b6-39da-4db9-9159-321cf1eed7be","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.116818Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:091ba8acdd3b06b4b989991abc9f36aefb02fd717b88a2ddc06919af40fe255f","observation_id":"75562374-c66c-48f6-80d6-c4031383301d","resolution":{"observed_at":"2026-08-11T05:18:23.612615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.590427Z","title":"Ro- bust Estimation in Signal Processing: A Tutorial-Style Treatment of Fundamental Concepts,","venue":null,"work_id":"b5b42472-7466-43d9-810c-d7017eae1ccd","year":2012},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.120742Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:319c92dfb543a3bf298cc0be320b7a05972ff536f5f2c857521c3bad53420fad","observation_id":"b43defa7-be5d-4ab2-8c59-370806be4250","resolution":{"observed_at":"2026-08-11T05:18:23.597020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.572909Z","title":null,"venue":null,"work_id":"0884b403-70af-4838-b00c-3a580ee089fd","year":2018},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.126274Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:674ab7e3d7b1954f3a13f6328250eaa71f612d73049ffc3cdd34d666c1d11e08","observation_id":"ad7bed3b-ff7a-480f-99ac-3a193e030f36","resolution":{"observed_at":"2026-08-11T05:18:23.578609Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.387921Z","title":null,"venue":null,"work_id":"4086dc8a-2726-4532-97a7-25f4f743ad1d","year":2019},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.131459Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:d8cb6d1a9c957658c566e1b5de617ebac9be5fa33705b7ef6dd2c73fb5a4dfaa","observation_id":"0923318f-be57-468e-bbac-f5119b8ee1de","resolution":{"observed_at":"2026-08-11T05:18:23.471357Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.367473Z","title":null,"venue":null,"work_id":"711f6207-9473-40df-a9c0-5ebff020378d","year":1977},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.136130Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:8b95aa685e47a9446e58e6df377c8c174596aace57017a0090cf9005e31477c0","observation_id":"b9930758-8df4-404c-b841-0276f21787e8","resolution":{"observed_at":"2026-08-11T05:18:23.376592Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.351766Z","title":"John W. Tukey’s Contributions to Robust Statistics,","venue":null,"work_id":"318ea871-731b-4427-b8d3-a1020c66f13a","year":2002},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.140732Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:150894b81d9f6f543b2927e35391ae3271774e072faca0451e406fdd79d93355","observation_id":"b9bf64df-39f5-4d73-85e2-eba25dcae61e","resolution":{"observed_at":"2026-08-11T05:18:23.356732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.336982Z","title":null,"venue":null,"work_id":"3ac7fa42-1642-461c-8932-88c59effaf25","year":1972},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.145210Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:b253da0369c5f72b210330a486c0c110a6f4c433c7059cdac50de956b543402b","observation_id":"6de8818d-067f-4a9d-a71b-5f1dd986c038","resolution":{"observed_at":"2026-08-11T05:18:23.341805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.316976Z","title":null,"venue":null,"work_id":"01ce20b9-9d67-41a3-b4be-e5071dbb38c1","year":2018},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.150339Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:3b6a82b4ad2ae7fd002694a7adcb44bfb8644e4482e0d438dff3df9811f6fb2b","observation_id":"17b975ee-ad3b-4355-9c03-55b2a558c0ce","resolution":{"observed_at":"2026-08-11T05:18:23.324995Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.075925Z","title":null,"venue":null,"work_id":"4eed05a7-9351-4c35-93fd-476bcb587d98","year":1986},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.155366Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:b0a9bee9f40adf1bcccc2c229c2cd044967492131a2601728066002201e50077","observation_id":"18ee1b4c-04e2-4301-a1d8-a72a6c7b6760","resolution":{"observed_at":"2026-08-11T05:18:23.163888Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.061856Z","title":"Byzantine-Robust Learning on Heterogeneous Datasets via Bucketing,","venue":null,"work_id":"f6ed2fef-a9ca-45fe-b028-9b9e3daa92a9","year":2022},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.160131Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:bb27688cb61a5f23780dcad9962df3ad416a326bc35882e1d0c7c460dbc4ca79","observation_id":"0ec27fcf-b8c8-4d3a-883f-7a0962b010f9","resolution":{"observed_at":"2026-08-11T05:18:23.066436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.046835Z","title":"D 2: Decentralized Training over Decentralized Data,","venue":null,"work_id":"478b24ca-ddba-41a0-a968-60d3d4b2ebb7","year":2018},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.164842Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:f3a708d5b81e9f92354e44bab6746c33beeaf504eaf2cbc945cbfa3b674e86ac","observation_id":"aae90f14-b403-4b11-9cef-b6f094178597","resolution":{"observed_at":"2026-08-11T05:18:23.051967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.032081Z","title":"Robust M-Estimation Based Bayesian Cluster Enumeration for Real Elliptically Symmetric Distributions,","venue":null,"work_id":"0ffca880-b29d-4f2a-a3db-b433f170d6bb","year":2021},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.169341Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:126654ca5b2298c48f45856b44d2019e2188d4e5e66f1e8ffdd5124c6cfec4fa","observation_id":"7ad99067-87cb-4d41-9202-fe4342c1e933","resolution":{"observed_at":"2026-08-11T05:18:23.036944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.016318Z","title":"A review on robust M-estimators for regression analysis,","venue":null,"work_id":"c4c1438e-2a2f-4099-99b5-1af30e770c50","year":2021},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.173046Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:a52de1d2c5f49297211ba624602a20b1f0fbf15314ad901e0b0f7feea710f8a5","observation_id":"ed40e39e-064b-4087-b50c-33aac13d256d","resolution":{"observed_at":"2026-08-11T05:18:23.021961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:23.000457Z","title":"On the point for which the sum of the distances to n given points is minimum,","venue":null,"work_id":"3a856570-cbd6-448d-8aeb-b83fa7c64bec","year":2009},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.177187Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:11600949745e8f5a05f3067052b7372df1ae1c1ac9ad6192d15b56064b134886","observation_id":"5253ec83-a2c9-433b-b13b-41d049f6631e","resolution":{"observed_at":"2026-08-11T05:18:23.005794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.803581Z","title":"Weiszfeld’s Method: Old and New Results,","venue":null,"work_id":"72e90ee1-ddd6-4295-8c29-cd45fbc3693d","year":2015},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.182111Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:40a00083327bec459f878abb6ec431b285fd5fba3e3dee892fcaf7288bf4e961","observation_id":"db54a18a-a40c-4023-b0d9-59c89c21afc5","resolution":{"observed_at":"2026-08-11T05:18:22.910054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.784165Z","title":"Breakdown Points of Affine Equivariant Estimators of Multivariate Location and Covariance Ma- trices,","venue":null,"work_id":"836dbba3-42d9-43e0-8cab-cd04677e743f","year":1991},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.186879Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:d379b55a8fd1094533e0093b62e3b514fd1f393df8b4f5b9eb57a52aa3460e8b","observation_id":"0ed9c24e-f710-4af6-b544-9e33789ac249","resolution":{"observed_at":"2026-08-11T05:18:22.789292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.768174Z","title":"Raynal, D","venue":null,"work_id":"7c71c4f6-83b0-4f37-96c6-20af2d1db586","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.191776Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:11ff1df88ca7ad3405fb552ea1b8724556ffc4faf4648cc932092dc06eddb7a0","observation_id":"63b4dca4-2b69-4056-b20b-6846fc57196f","resolution":{"observed_at":"2026-08-11T05:18:22.773069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.752588Z","title":"FABA: An Algorithm for Fast Ag- gregation against Byzantine Attacks in Distributed Neural Networks,","venue":null,"work_id":"b371dc8c-21ff-4a28-9525-2a09adac6baa","year":2019},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.196698Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:862c277f78c493ed6d936f90787be0eafb1c375f3697d05df43b8b7736c23459","observation_id":"1763ef89-360c-4db2-b97f-ed3c9631c081","resolution":{"observed_at":"2026-08-11T05:18:22.757663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.735239Z","title":"Enhancing federated learning robustness through randomization and mixture,","venue":null,"work_id":"6b5d70a6-dcac-4375-811f-3d8ab79cc5fa","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.201357Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:79a21603ea12402c9afc4eeb36e1f5e05a716325e745a8cb13c72e8f327d4858","observation_id":"870290d9-bf70-4369-8e5e-2cdf1a6f0e4a","resolution":{"observed_at":"2026-08-11T05:18:22.741361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.649120Z","title":"An Experimental Study of Byzantine-Robust Aggregation Schemes in Federated Learning,","venue":null,"work_id":"2da16069-fb52-4d06-a389-5be9d17e16fc","year":2023},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.205839Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:72c933a4352a41891a794529f5a4f499f18086b555cecc25d9cfaafd055baca3","observation_id":"6d055cee-95cc-4343-b52b-3ac1372e9e4e","resolution":{"observed_at":"2026-08-11T05:18:22.694132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.572368Z","title":"Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environment,","venue":null,"work_id":"af5e3b1e-cf9c-4003-aac9-0cde229bf13b","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.210464Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:62cd959a87b719f2f4b95c24742bdec5f1e1b744eab191679a0f8ce40f79c909","observation_id":"15f8d05d-62c1-4c3c-b1d3-4ce3a7ca4bf3","resolution":{"observed_at":"2026-08-11T05:18:22.593936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.556324Z","title":"How To Backdoor Federated Learning,","venue":null,"work_id":"6c598361-7c5e-4688-a0b0-01ee79043efc","year":2020},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.215005Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:94305f6553e9b68740ce2776d022f26d797dde85aaf3543ffb910b21c8f0a089","observation_id":"c3286aad-58f2-4e60-a308-3438afc60b5e","resolution":{"observed_at":"2026-08-11T05:18:22.561435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.540475Z","title":"LeCun, C","venue":null,"work_id":"bf2f93ae-701f-457f-a769-60d7944ade77","year":1998},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.219789Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:a931318247b53ac2cdacae4de990d8796157c3bdbe9e9c64e4802103b0623f4c","observation_id":"73f2f026-250c-4699-a543-c55dd5aaccda","resolution":{"observed_at":"2026-08-11T05:18:22.545296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T05:18:22.523423Z","title":"Raynal and C","venue":null,"work_id":"280f837a-147b-4894-948f-a7db6147d1b2","year":2024},"citing_paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:22.224690Z"},"links":{"citing_paper":"/paper/2412.17740"},"observation_digest":"sha256:8ffde470087c3a729bbe58c8cbb13e9645524a21981b0ba0e31ea735fc3701bd","observation_id":"01ef85a4-3cfe-456a-8419-d205a6d62c10","resolution":{"observed_at":"2026-08-11T05:18:22.529010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.17740","last_updated":"2024-12-23T17:44:03Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T10:37:08.477615Z","submitted_at":"2024-12-23T17:44:03Z","title":"Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":54},"total_outbound_references":68},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 1 inbound Pith citation observation for arXiv:2412.17740."}