{"as_of":"2026-08-10T04:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f4d8dda905407405a54110c1f9d91bd110771d0260580562b6b04b80de7cba5","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:39:53.250759Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T02:20:14.366194Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.01498","last_updated":"2021-02-25T06:34:39Z","snapshot_observed_at":"2026-07-06T06:26:35.067161Z","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","version":2},"cited_work":{"arxiv_id":"1803.01498","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1803.01498","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Byzantine-robust distributed learning: Towards optimal statistical rates","venue":null,"work_id":"2f8b8f86-0262-4dd8-a4aa-0027566502ac","year":2018},"citing_paper":{"arxiv_id":"1907.02707","last_updated":"2019-07-05T07:33:05Z","snapshot_observed_at":"2026-08-02T08:51:20.896490Z","submitted_at":"2019-07-05T07:33:05Z","title":"Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T02:17:40.576094Z"},"links":{"cited_paper":"/paper/1803.01498","citing_paper":"/paper/1907.02707"},"observation_digest":"sha256:645ab881007ed080a8b5d42e33332d0a28cdb6214e3f847491ce3746cf86cf9e","observation_id":"213897f7-9399-4dd6-b8e6-ddeb12841695","resolution":{"observed_at":"2026-05-25T02:20:14.369720Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.01498","last_updated":"2021-02-25T06:34:39Z","snapshot_observed_at":"2026-07-06T06:26:35.067161Z","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","version":2},"cited_work":{"arxiv_id":"1803.01498","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1803.01498","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Byzantine-robust distributed learning: Towards optimal statistical rates","venue":null,"work_id":"2f8b8f86-0262-4dd8-a4aa-0027566502ac","year":2018},"citing_paper":{"arxiv_id":"2407.09658","last_updated":"2026-04-09T17:42:49Z","snapshot_observed_at":"2026-07-06T18:45:39.741597Z","submitted_at":"2024-07-12T19:38:42Z","title":"BoBa: Boosting Backdoor Detection through Data Distribution Inference in Federated Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T23:09:32.656257Z"},"links":{"cited_paper":"/paper/1803.01498","citing_paper":"/paper/2407.09658"},"observation_digest":"sha256:947e1f895b9468a7919cacf3012d8a4486e739cdc4b624a81ad8caaecbd23168","observation_id":"83bf5ad1-4e06-40c2-a3dc-82063330dc9c","resolution":{"observed_at":"2026-05-23T23:13:37.031130Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.01498","last_updated":"2021-02-25T06:34:39Z","snapshot_observed_at":"2026-07-06T06:26:35.067161Z","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.01498","snapshot_observed_at":"2026-08-09T13:39:53.250759Z","title":"Byzantine-robust distributed learning: Towards optimal statistical rates,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02038","last_updated":"2025-02-21T02:55:12Z","snapshot_observed_at":"2026-08-09T13:32:10.040834Z","submitted_at":"2025-02-04T06:12:43Z","title":"SMTFL: Secure Model Training to Untrusted Participants in Federated Learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T13:39:53.250759Z"},"links":{"cited_paper":"/paper/1803.01498","citing_paper":"/paper/2502.02038"},"observation_digest":"sha256:a815d211b8c9a38dcf8002654784712f5385ca129b070b758372e82cdb51bfb0","observation_id":"7b98ff38-5947-4d15-9d31-e011531a041d","resolution":{"observed_at":"2026-08-09T13:39:53.250759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.01498","last_updated":"2021-02-25T06:34:39Z","snapshot_observed_at":"2026-07-06T06:26:35.067161Z","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.01498","snapshot_observed_at":"2026-08-07T15:06:53.735458Z","title":"[Young et al., 1999] K.D","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.16403","last_updated":"2025-05-29T00:20:42Z","snapshot_observed_at":"2026-08-07T14:59:28.408515Z","submitted_at":"2025-05-22T08:54:17Z","title":"Performance Guaranteed Poisoning Attacks in Federated Learning: A Sliding Mode Approach","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:06:53.735458Z"},"links":{"cited_paper":"/paper/1803.01498","citing_paper":"/paper/2505.16403"},"observation_digest":"sha256:684e72217810d324875d6d9bb82770542f5919968c60650688ade1ea43295050","observation_id":"bfbaa9ad-353c-4011-b02a-0f39d73914a2","resolution":{"observed_at":"2026-08-07T15:06:53.735458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.01498","last_updated":"2021-02-25T06:34:39Z","snapshot_observed_at":"2026-07-06T06:26:35.067161Z","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.01498","snapshot_observed_at":"2026-08-06T11:21:54.090044Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.22790","last_updated":"2025-07-31T19:24:08Z","snapshot_observed_at":"2026-08-07T13:58:33.824531Z","submitted_at":"2025-07-30T15:55:18Z","title":"Optimizing Federated Learning Configurations for MRI Prostate Segmentation and Cancer Detection: A Simulation Study","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T11:21:54.090044Z"},"links":{"cited_paper":"/paper/1803.01498","citing_paper":"/paper/2507.22790"},"observation_digest":"sha256:3e6ee0a3a5e27493c35565fbf6dd43b67aaea02297dd0a0def5eb5e7326e8c03","observation_id":"f15629cf-b319-404a-8ce0-ebadab4695cf","resolution":{"observed_at":"2026-08-06T11:21:54.090044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.01498","last_updated":"2021-02-25T06:34:39Z","snapshot_observed_at":"2026-07-06T06:26:35.067161Z","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.01498","snapshot_observed_at":"2026-08-05T13:28:49.338280Z","title":"Byzantine-robust distributed learning: Towards optimal statistical rates,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00634","last_updated":"2025-08-30T23:36:22Z","snapshot_observed_at":"2026-08-07T18:28:30.356932Z","submitted_at":"2025-08-30T23:36:22Z","title":"Enabling Trustworthy Federated Learning via Remote Attestation for Mitigating Byzantine Threats","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T13:28:49.338280Z"},"links":{"cited_paper":"/paper/1803.01498","citing_paper":"/paper/2509.00634"},"observation_digest":"sha256:575a0c32f586692d76fd1f5d24283e254e5d6bd1a1b771ecaa32cef76377cc1c","observation_id":"b93fe95c-d18f-4753-9f4d-62a32db025c8","resolution":{"observed_at":"2026-08-05T13:28:49.338280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1803.01498/citation-record","integrity":"/paper/1803.01498/integrity","json":"/paper/1803.01498/citation-record.json","paper":"/paper/1803.01498"},"outbound":[],"paper":{"arxiv_id":"1803.01498","last_updated":"2021-02-25T06:34:39Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T06:26:35.067161Z","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1803.01498."}