{"as_of":"2026-08-15T22:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:82c607abb4e2d4b2523765d0839f86d9c6f7847be1455eb7d45ba02bcc8cdd5c","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:41:11.357890Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.18060/citation-record","integrity":"/paper/2508.18060/integrity","json":"/paper/2508.18060/citation-record.json","paper":"/paper/2508.18060"},"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-05T16:41:12.209603Z","title":"An overview of implementing security and privacy in federated learning,","venue":null,"work_id":"b0f4fe89-2ef7-45de-ad7c-2e8c6a037bdb","year":2024},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.292547Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:00d92c5a63d8ec3f01c5092c9db4b4e166c9444c107bf332ef1d44c41006e5fe","observation_id":"efaf7e0c-8e15-4e2c-aca8-c4aa9aeebfdd","resolution":{"observed_at":"2026-08-05T16:41:12.303418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:12.133094Z","title":"Federated learning: Challenges, methods, and future directions,","venue":null,"work_id":"0ab6955f-5733-4410-b2c3-993b401769ea","year":2020},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.295556Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:73dab039c5a339de99e1cfb2b9eae3d8979ef3aa2888f60ca68279d65b81282d","observation_id":"2caf1b57-b25e-4818-bc87-2270e067690f","resolution":{"observed_at":"2026-08-05T16:41:12.161239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:12.058223Z","title":"Communication-efficient learning of deep networks from decentralized data,","venue":null,"work_id":"49af7ec0-2f04-483e-a13c-0076f166fd9c","year":2017},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.298360Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:b1ed89458c276cfa24bfd094adda9767c44387cf79115731e6be2b199dc4e085","observation_id":"f5e843c8-7e53-4367-bc1f-2027bf585b32","resolution":{"observed_at":"2026-08-05T16:41:12.094205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.971172Z","title":"The byzantine generals prob- lem,","venue":null,"work_id":"ff6d705c-b1a2-4859-9419-8feae2b1182e","year":2019},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.301137Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:83bda7c45fe1031f215d8c4b67fb98d06a14f98789bf151de06e729af34ec9bd","observation_id":"802e28c5-6a85-4cf7-8af9-2c7a287a6e60","resolution":{"observed_at":"2026-08-05T16:41:12.016021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.851588Z","title":"A little is enough: Circumvent- ing defenses for distributed learning,","venue":null,"work_id":"f1780b82-3e48-463d-8e2c-dc1ed3aa6e0c","year":2019},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.303856Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:f810bae74e64bdc2b2f2a754751fd13afe997bd3e60be6e6da9bebfc1d9daf63","observation_id":"9da8ddc8-b271-4f15-b5bd-701a88a9b8f5","resolution":{"observed_at":"2026-08-05T16:41:11.925715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.772388Z","title":"Fall of empires: Breaking byzantine- tolerant sgd by inner product manipulation,","venue":null,"work_id":"a40b5951-29ac-43f0-b759-a85e0d671eb5","year":2020},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.306745Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:bada5366569c52c9d0960e498c7422d45be251fe0fab6c30b33d3915a5683ef9","observation_id":"9afc323f-c483-40c4-9691-b76c9ebaee03","resolution":{"observed_at":"2026-08-05T16:41:11.810012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.605527Z","title":"Siren: Byzantine-robust federated learning via proactive alarming,","venue":null,"work_id":"85fdf9ef-db6a-4a69-ae34-5fa2b9de0fa1","year":2021},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.309568Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:c787a41e04764fc8970b4370b67508ba2524a72d294f8aa4ca0d50deaa5b56e8","observation_id":"b23336c8-a84f-4b6d-b057-8f9c4afefd05","resolution":{"observed_at":"2026-08-05T16:41:11.691689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.562357Z","title":"An experimental study of byzantine- robust aggregation schemes in federated learning,","venue":null,"work_id":"dc62140c-1f6a-45b6-8470-855c3a21d9d9","year":2023},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.312098Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:1a120457c59f55412f5a8f9d311aa1bd09f909f09a6acef4a3224e071b46a91c","observation_id":"59920740-d2df-4a05-b2a8-4acab1000b61","resolution":{"observed_at":"2026-08-05T16:41:11.571104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:41:11.314588Z","title":"Local model poisoning attacks to {Byzantine-Robust} federated learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.314588Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:891b11e73d9b41e2b0a427070886ae775c36e93b9fc5b90dbc8c2db00d1c672c","observation_id":"c9b397c7-0b1e-47d2-9e43-122633c1509f","resolution":{"observed_at":"2026-08-05T16:41:11.314588Z","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-05T16:41:11.537673Z","title":"Federated learning with extremely noisy clients via nega- tive distillation,","venue":null,"work_id":"df4147ed-45d1-4949-8d17-23c690f008c8","year":2024},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.321260Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:2b8db2419f840555f1b5d37eb36f19210ee55406897ca96bc549d3b35d812063","observation_id":"2f4c0a5b-c57f-45d0-a550-e8841ba02f31","resolution":{"observed_at":"2026-08-05T16:41:11.545992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.519785Z","title":"Fedcor: Correlation-based active client selection strategy for heteroge- neous federated learning,","venue":null,"work_id":"ce2e9beb-9901-4c8f-b642-9fbb17090322","year":2022},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.323952Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:329d9bd1bffb0b6232a0c4117c67ff4669011b6860de764c760b05e7218c88fd","observation_id":"8def7033-b631-49ed-98e2-3261b2317b72","resolution":{"observed_at":"2026-08-05T16:41:11.526800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.508025Z","title":"Byzantine-robust dis- tributed learning: Towards optimal statistical rates,","venue":null,"work_id":"31a3fe60-4173-4068-80e5-c694aa7c7004","year":2018},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.326549Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:a0c424b1f7b752a38449a909b1795d529215a6e952b10c4c7cde4fbf49039280","observation_id":"719c9eb8-d4fd-478b-b47b-3e2a547e880e","resolution":{"observed_at":"2026-08-05T16:41:11.512013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.490846Z","title":"Ma- chine learning with adversaries: Byzantine tolerant gradient descent,","venue":null,"work_id":"447a8aff-27ee-4a41-bcc0-ec297bcfb72f","year":2017},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.329197Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:2966af9ed272d7f1572d830bcfd627af2bab337762445a291ce07c186717295b","observation_id":"f9043d5f-e306-458d-b89f-c0e33f505f44","resolution":{"observed_at":"2026-08-05T16:41:11.498220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:41:11.474146Z","title":"Byzantine-robust federated learning through spatial-temporal analysis of local model updates,","venue":null,"work_id":"d424b90e-8966-4f63-bbef-82c33cc9a78e","year":2021},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.331888Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:558f2fba7c67df9680075976fb864c3a8fa685e52a36633c4dbbc78e6fa91118","observation_id":"2e7221ab-858b-4f6e-999e-e32a57582e5a","resolution":{"observed_at":"2026-08-05T16:41:11.482018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13995","last_updated":"2022-04-12T01:56:47Z","snapshot_observed_at":"2026-07-06T10:28:06.533127Z","submitted_at":"2020-12-27T18:43:39Z","title":"FLTrust: Byzantine-robust Federated Learning via Trust Bootstrapping","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13995","snapshot_observed_at":"2026-08-05T16:41:11.334303Z","title":"Fltrust: Byzantine- robust federated learning via trust bootstrapping,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.334303Z"},"links":{"cited_paper":"/paper/2012.13995","citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:e04a7170d8219916920e2ee12a4f6223547bcae57105b8750a7c8745ce195a14","observation_id":"c63f17c6-d1d5-4cf6-9f30-c10840d93f8b","resolution":{"observed_at":"2026-08-05T16:41:11.334303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12780","last_updated":"2024-06-10T13:43:21Z","snapshot_observed_at":"2026-08-15T17:20:11.755620Z","submitted_at":"2024-02-20T07:40:11Z","title":"Byzantine-Robust Federated Learning: Impact of Client Subsampling and Local Updates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12780","snapshot_observed_at":"2026-08-05T16:41:11.337041Z","title":"Byzantine-robust federated learning: Impact of client subsampling and local updates,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.337041Z"},"links":{"cited_paper":"/paper/2402.12780","citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:83033203b76dd60d35a91fe7cfce00bb402db21c384ea30aff381f62d500a20d","observation_id":"081bc29c-0835-4073-b5ad-8733fbe7e5d5","resolution":{"observed_at":"2026-08-05T16:41:11.337041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.12672","last_updated":"2026-04-29T05:45:33Z","snapshot_observed_at":"2026-08-02T16:06:51.431814Z","submitted_at":"2025-08-18T07:11:21Z","title":"Robust Federated Learning under Adversarial Attacks via Loss-Based Client Clustering","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.12672","snapshot_observed_at":"2026-08-05T16:41:11.339830Z","title":"Robust federated learning under adversarial attacks via loss-based client clustering,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.339830Z"},"links":{"cited_paper":"/paper/2508.12672","citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:3a63e59d2eb5b44be79add3e306cca04ede5c7818f0b7397b1e20dd1c5b4d8a0","observation_id":"34bbe838-d472-4058-99da-aa6f6a14b540","resolution":{"observed_at":"2026-08-05T16:41:11.339830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:41:11.342485Z","title":"Ensemble distillation for robust model fusion in federated learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.342485Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:5d8cbc5740a472296a5b42135a1fdaa68c2e8e2d34fbaa9fbc84db33af24b8c7","observation_id":"5a3da7a0-f505-448a-96ba-400f76ab91b1","resolution":{"observed_at":"2026-08-05T16:41:11.342485Z","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-05T16:41:11.454568Z","title":"Learning multiple layers of features from tiny images,","venue":null,"work_id":"5efa969f-91a1-465e-9fa5-572340bf9fb1","year":2009},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.344821Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:6c6325ee0035158046eb5503c11563f56259a0a2af99a797c9ea8e19a91e3d9f","observation_id":"9ef35f1d-dee6-4bbe-a54f-5bd40b9b009d","resolution":{"observed_at":"2026-08-05T16:41:11.460322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-05T16:41:11.347118Z","title":"Fashion-mnist: A novel image dataset for benchmarking machine learning algorithms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.347118Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:48a70bd5fe480153566f8d269f9d670215b4c34be5e7df1e94b83c37e7a0270b","observation_id":"a8f9a35c-0e9a-414d-92fb-dc49f4f24e25","resolution":{"observed_at":"2026-08-05T16:41:11.347118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:41:11.349832Z","title":"Mnist handwritten digit database,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.349832Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:0d4c85116972ed9b088cfb44974cc23580ed2dbe10a17039e02c9bd212a3f82c","observation_id":"9ec52f54-5bde-4a82-b428-0ac2e9cc6c12","resolution":{"observed_at":"2026-08-05T16:41:11.349832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.14390","last_updated":"2022-03-05T20:30:32Z","snapshot_observed_at":"2026-07-06T09:42:35.058716Z","submitted_at":"2020-07-28T17:59:07Z","title":"Flower: A Friendly Federated Learning Research Framework","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.14390","snapshot_observed_at":"2026-08-05T16:41:11.352635Z","title":"Flower: A friendly federated learning research framework,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.352635Z"},"links":{"cited_paper":"/paper/2007.14390","citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:0693c7a45c698df0b4a969267e3655700f4861d0e6e194c57557ee500ce5aed8","observation_id":"9cd886dc-ca06-453b-ada4-94d25211fd34","resolution":{"observed_at":"2026-08-05T16:41:11.352635Z","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-05T16:41:11.430360Z","title":"Multi-task federated learning for person- alised deep neural networks in edge computing,","venue":null,"work_id":"a942f637-a90a-4eda-a8cb-b889867459ee","year":2021},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.355403Z"},"links":{"citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:0aef2a6739c86292a7893bb6385832c5a50b5130c116c49cdaebed9e364e5534","observation_id":"9aa41c0a-d627-408a-b782-5860d442d21a","resolution":{"observed_at":"2026-08-05T16:41:11.440134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00295","last_updated":"2021-09-08T23:37:17Z","snapshot_observed_at":"2026-08-13T06:06:10.844945Z","submitted_at":"2020-02-29T16:37:29Z","title":"Adaptive Federated Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00295","snapshot_observed_at":"2026-08-05T16:41:11.357890Z","title":"Adaptive federated optimization,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:11.357890Z"},"links":{"cited_paper":"/paper/2003.00295","citing_paper":"/paper/2508.18060"},"observation_digest":"sha256:5ce0cf8d01d53053ddb2d6997052d200b1b44f715ca5bb9d6fcab5d6b3e00b99","observation_id":"e6b11a63-784e-4662-a863-27c9e109c1ab","resolution":{"observed_at":"2026-08-05T16:41:11.357890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.18060","last_updated":"2025-08-25T14:20:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T13:03:42.048897Z","submitted_at":"2025-08-25T14:20:19Z","title":"FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":24},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2508.18060."}