{"as_of":"2026-08-08T18:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b8d774b0e6d7fe95e896a79559c2b6ce5f34da6373cfae86c416c7b9b8fab12","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:43:19.864924Z","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-12T09:36:26.283482Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.17381","last_updated":"2025-01-29T02:28:03Z","snapshot_observed_at":"2026-08-04T22:56:55.182475Z","submitted_at":"2025-01-29T02:28:03Z","title":"Do We Really Need to Design New Byzantine-robust Aggregation Rules?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17381","snapshot_observed_at":"2026-08-07T15:43:19.864924Z","title":"Do we really need to design new byzantine-robust aggregation rules? arXiv preprint arXiv:2501.17381, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14024","last_updated":"2025-05-20T07:26:54Z","snapshot_observed_at":"2026-08-07T15:40:03.712919Z","submitted_at":"2025-05-20T07:26:54Z","title":"FedGraM: Defending Against Untargeted Attacks in Federated Learning via Embedding Gram Matrix","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:19.864924Z"},"links":{"cited_paper":"/paper/2501.17381","citing_paper":"/paper/2505.14024"},"observation_digest":"sha256:c15cecd4cff0cfee9ad9e5e76f895abe2be47607f6c2163e4864adcc74e2569c","observation_id":"f2fade37-6539-4816-987c-4b93406357b7","resolution":{"observed_at":"2026-08-07T15:43:19.864924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17381","last_updated":"2025-01-29T02:28:03Z","snapshot_observed_at":"2026-08-04T22:56:55.182475Z","submitted_at":"2025-01-29T02:28:03Z","title":"Do We Really Need to Design New Byzantine-robust Aggregation Rules?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17381","snapshot_observed_at":"2026-08-07T04:48:54.371332Z","title":"In9th International Conference on Learning Representations (ICLR)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.09824","last_updated":"2025-09-05T09:28:02Z","snapshot_observed_at":"2026-08-07T20:06:03.096018Z","submitted_at":"2025-06-11T15:04:43Z","title":"A Weighted Loss Approach to Robust Federated Learning under Data Heterogeneity","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T04:48:54.371332Z"},"links":{"cited_paper":"/paper/2501.17381","citing_paper":"/paper/2506.09824"},"observation_digest":"sha256:7617469fc3062d49b76ffb3dcd9db20c8d579ec94c91de8f2d4ea4656148be3f","observation_id":"afa2a573-87d2-4084-8de3-7693c9730673","resolution":{"observed_at":"2026-08-07T04:48:54.371332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17381","last_updated":"2025-01-29T02:28:03Z","snapshot_observed_at":"2026-08-04T22:56:55.182475Z","submitted_at":"2025-01-29T02:28:03Z","title":"Do We Really Need to Design New Byzantine-robust Aggregation Rules?","version":1},"cited_work":{"arxiv_id":"2501.17381","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.17381","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"dfe06d70-855b-49ac-bc62-bc437c9f0d05","year":2025},"citing_paper":{"arxiv_id":"2604.27434","last_updated":"2026-04-30T05:18:44Z","snapshot_observed_at":"2026-07-06T23:12:52.141592Z","submitted_at":"2026-04-30T05:18:44Z","title":"AdaBFL: Multi-Layer Defensive Adaptive Aggregation for Bzantine-Robust Federated Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T10:26:19.049908Z"},"links":{"cited_paper":"/paper/2501.17381","citing_paper":"/paper/2604.27434"},"observation_digest":"sha256:f5fbdf7dd8fc6ae1d71ed3bf01c6c6edbd43c80ee01998a5ad3947d94205e519","observation_id":"25843397-0274-4e7b-82b1-21b82243328c","resolution":{"observed_at":"2026-05-12T09:36:26.285037Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.17381/citation-record","integrity":"/paper/2501.17381/integrity","json":"/paper/2501.17381/citation-record.json","paper":"/paper/2501.17381"},"outbound":[],"paper":{"arxiv_id":"2501.17381","last_updated":"2025-01-29T02:28:03Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-04T22:56:55.182475Z","submitted_at":"2025-01-29T02:28:03Z","title":"Do We Really Need to Design New Byzantine-robust Aggregation Rules?"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.17381."}