{"as_of":"2026-08-09T09:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:33eb6525adca7674837c8dc590903d3810c7acbaf4976b1fc398b5cdc2747a86","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:49:29.218728Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:49:28.674872Z","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-12T10:31:30.255929Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.07565","snapshot_observed_at":"2026-08-06T18:49:28.674872Z","title":"Secure cooperative gradient coding: Optimality, reliability, and global privacy,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.674872Z"},"links":{"cited_paper":"/paper/2507.07565","citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:7f9ab17500c9778ebfedfa6494d0675845ff559f6bc7ee4035ef71c8136ff458","observation_id":"baa2fad4-c2c1-417a-bcdb-7b2df3366d67","resolution":{"observed_at":"2026-08-06T18:49:28.674872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"cited_work":{"arxiv_id":"2507.07565","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.07565","snapshot_observed_at":"2026-07-14T02:20:17.718375Z","title":"Coding-enforced robust secure aggregation for federated learning under unreliable communication","venue":null,"work_id":"f5458e34-ba35-4f31-a664-c0d35666c922","year":2025},"citing_paper":{"arxiv_id":"2604.28080","last_updated":"2026-04-30T16:26:44Z","snapshot_observed_at":"2026-07-06T23:13:24.960159Z","submitted_at":"2026-04-30T16:26:44Z","title":"Perfectly Private Over-the-Air Computation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-07T05:46:56.326229Z"},"links":{"cited_paper":"/paper/2507.07565","citing_paper":"/paper/2604.28080"},"observation_digest":"sha256:5ed06a5bbe8ee45d3789fd017014d00f3e61b5d9c5c796439847bfe706b0cb87","observation_id":"97345ddb-4786-4d44-a106-a44e86567dfd","resolution":{"observed_at":"2026-07-14T02:20:17.718375Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2507.07565/citation-record","integrity":"/paper/2507.07565/integrity","json":"/paper/2507.07565/citation-record.json","paper":"/paper/2507.07565"},"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-06T18:49:35.907527Z","title":"Federated learning- empowered mobile network management for 5g and beyond networks: From access to core,","venue":null,"work_id":"9121a2be-f8fe-412f-b985-e3dac4c88a9f","year":2024},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:23.848737Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:afcce749835acd9189c771960b9ec69cfcf416ab205917c0a2fccc0525536c79","observation_id":"384b635f-d31d-4a85-aec0-3e40e930e275","resolution":{"observed_at":"2026-08-06T18:49:35.962912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:35.754132Z","title":"Advances and open challenges in federated foundation models,","venue":null,"work_id":"179e1334-0e4f-4ee7-aca4-1accf8e3bea6","year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:23.943351Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:61f79f705baa07854094b279471279ac20b7252969aa76c2af9a8a93fc9bbcdb","observation_id":"43c6e52b-2523-4f6f-885c-90b9b823d8c6","resolution":{"observed_at":"2026-08-06T18:49:35.830127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:35.553257Z","title":"The algorithmic foundations of differential privacy,","venue":null,"work_id":"29cd26cf-1cc3-4aea-aa53-82ce7377da0f","year":2014},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:24.083538Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:7137b938484d897096f388f428186a7d6305b4bb65de5a6a863ef01f08384b0a","observation_id":"69f920b6-1666-4255-be93-bbf6258274e2","resolution":{"observed_at":"2026-08-06T18:49:35.643320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:35.345554Z","title":"Privacy preserving semi-decentralized mean estimation over intermittently-connected networks,","venue":null,"work_id":"a24a51f9-f5c4-4e5c-be3a-6a69b1a74a6a","year":2024},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:24.233600Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:2365e93f7305c5e7072f7f3fb671dbcc8c110ab73e406212ec2ce1d316c8e7a0","observation_id":"18f8fc2e-485b-4998-8f7c-916adc8cd88b","resolution":{"observed_at":"2026-08-06T18:49:35.438402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:35.148183Z","title":"Attack-aware noise calibration for differential privacy,","venue":null,"work_id":"5470a87f-576f-494b-b488-b12328b8f015","year":2024},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:24.409875Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:b0ed63f1c8d964ad0af5eb2d4a831f2544293bc2dd75972c7b020db93d75046a","observation_id":"a39f4033-45d2-42a3-9d6b-c1dd6b1e4390","resolution":{"observed_at":"2026-08-06T18:49:35.232028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:34.958820Z","title":"Locally differen- tially private online federated learning with correlated noise,","venue":null,"work_id":"98c822f2-9e39-4d42-af51-ef609d4ce87f","year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:24.491020Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:8366be50a88eedccadd07ef3ca25d9e8c2a48d3a012ec35c5fa4a1918255589b","observation_id":"90bb1794-781d-4188-92a6-f98ec4d5d965","resolution":{"observed_at":"2026-08-06T18:49:35.065840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2501.14644","last_updated":"2025-07-23T08:55:02Z","snapshot_observed_at":"2026-08-07T01:39:10.054887Z","submitted_at":"2025-01-24T17:05:00Z","title":"Optimizing Privacy-Utility Trade-off in Decentralized Learning with Generalized Correlated Noise","version":2},"cited_work":{"arxiv_id":"2501.14644","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.14644","snapshot_observed_at":"2026-08-06T18:49:30.117242Z","title":"Optimizing Privacy-Utility Trade-off in Decentralized Learning with Generalized Correlated Noise","venue":"cs.LG","work_id":"384b257c-cc79-4df7-8747-3bea0e0d15e4","year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:24.670776Z"},"links":{"cited_paper":"/paper/2501.14644","citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:39aa24b9c8fdb71a4c88787024c429d8f4e9bb5248eb45cfab20c8acec410a07","observation_id":"6f368b1e-535b-4ec2-8714-2c02d0612d9f","resolution":{"observed_at":"2026-08-06T18:49:30.250064Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:34.810853Z","title":"Dap-fl: Federated learning flourishes by adaptive tuning and secure aggregation,","venue":null,"work_id":"321b3d8f-8237-4791-8892-686d14864265","year":1923},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:24.843436Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:94532aaea1d42d05d00d5754db1e2c69dcaa6e51721ec0c38e4b471100e936ca","observation_id":"f3294f96-260f-40a1-b269-36f1f78c7a9b","resolution":{"observed_at":"2026-08-06T18:49:34.868945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:34.635587Z","title":"Practical secure aggregation for privacy-preserving machine learning,","venue":null,"work_id":"9e0be04b-a4c5-4de3-8ec5-ca0b43bf451e","year":2017},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:24.995600Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:f85f537c1306d8ec439b180f84202050e783a69baa43fdf2ebf00c8885e5523c","observation_id":"3ad6c118-2b39-48d6-aeea-cee5d7cac91b","resolution":{"observed_at":"2026-08-06T18:49:34.717320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:34.441808Z","title":"Securing secure aggregation: Mitigating multi-round privacy leakage in federated learning,","venue":null,"work_id":"06a6f61a-e8c1-4720-b713-3b2c72881521","year":2023},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:25.216274Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:dccabf99328a5b7e1a7abdc06ccffeab2377578adcdef509bdbe35cecb7cd92b","observation_id":"0953b6ba-d834-4ffb-a481-a00bb1e90148","resolution":{"observed_at":"2026-08-06T18:49:34.538368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:34.246815Z","title":"Privacy-preserving deep learning via additively homomorphic encryption,","venue":null,"work_id":"649ac0de-b457-4d43-afe2-5a45c81478c9","year":2018},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:25.366847Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:30943989d78efe741a72a9a33d19ac1796f876372a27eba411fb216cfb0ccd6a","observation_id":"92f36ab3-6ffe-4ae0-aeac-027e59476a81","resolution":{"observed_at":"2026-08-06T18:49:34.337082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:34.060943Z","title":"Turbo-aggregate: Breaking the quadratic aggregation barrier in secure federated learning,","venue":null,"work_id":"86521122-a892-4d76-9ba0-c6f8230e9dfa","year":2021},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:25.547896Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:0e046af6baecc64669516248bce02a312478ff2b0831f80dd290988a0163941c","observation_id":"737a5dab-0681-46e0-ac29-6e6feeef12f7","resolution":{"observed_at":"2026-08-06T18:49:34.146782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:33.891890Z","title":"Information theoretic secure aggregation with user dropouts,","venue":null,"work_id":"f25729dd-4d94-44cf-b582-f826cf55981d","year":2022},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:25.726673Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:c76d1daf50573a247882d1496e63f4b8f2888cd29ca53b4b728cf334d7f5e53e","observation_id":"d83d4820-a4ba-428f-8985-778d276ce91e","resolution":{"observed_at":"2026-08-06T18:49:33.966445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:25.873844Z","title":"Fundamental limits of hierarchical secure aggregation with cyclic user association,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:25.873844Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:3e758bd1dc35d138bedb760010b027019f51ff312d6ed746b00607f686ad8d9e","observation_id":"de2fc6b7-92b7-4c1c-acfc-43a127fb40c7","resolution":{"observed_at":"2026-08-06T18:49:25.873844Z","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-06T18:49:33.728690Z","title":"Mds variable generation and secure sum- mation with user selection,","venue":null,"work_id":"7c401d65-3547-4439-a115-2b104d4cd176","year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:26.010945Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:cd4e018653d1774c015729c9e548dcaf3a00d34412a4a36c4626d0ab22c98dee","observation_id":"49d8dc09-0997-425e-b825-dc4bf36c1370","resolution":{"observed_at":"2026-08-06T18:49:33.809709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:33.570280Z","title":"Over-the-air feder- ated learning with privacy protection via correlated additive perturbations,","venue":null,"work_id":"97f42abf-9414-4444-a596-8fe8eef2e282","year":2022},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:26.082963Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:c1c6eec0dafe2100126cb918defa62457c184f38042373aa65502edfb1b1aba1","observation_id":"5135d2ca-8b38-4411-94e0-5369a18217e8","resolution":{"observed_at":"2026-08-06T18:49:33.637891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:33.402363Z","title":"Cod- edpaddedfl and codedsecagg: Straggler mitigation and secure aggregation in federated learning,","venue":null,"work_id":"07c01a78-2c63-46e9-a2be-cec1b02f4e9a","year":2013},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:26.221945Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:2a5e788c1952b9d68f3274235f9a29d873b48b4855bdefcf490ebb1059004aef","observation_id":"d325fe37-db47-480b-ae35-f952f713059e","resolution":{"observed_at":"2026-08-06T18:49:33.473303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:33.227553Z","title":"SCAFFOLD: Stochastic controlled averaging for federated learning,","venue":null,"work_id":"174f878c-1a06-44b6-b8ee-e9e53b7e2693","year":2020},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:26.374243Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:c2f4eb02446ab77742adb3f10538bc0dea77b90b5cb0d5666ca3ef350e6cd33a","observation_id":"1d1cfa78-a7d3-434a-9954-8642831c2ace","resolution":{"observed_at":"2026-08-06T18:49:33.311883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:33.000350Z","title":"Tackling the objective inconsistency problem in heterogeneous federated optimization,","venue":null,"work_id":"9bdc730e-6fdd-42c3-9d13-2ffb2e008cb1","year":2020},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:26.576428Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:d4f88e42a368911a754ae9ff84437d2451b6404146f3af94395ae0d86252e0fc","observation_id":"66274975-80cb-4896-be7e-2aabf51e3beb","resolution":{"observed_at":"2026-08-06T18:49:33.123322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:32.863085Z","title":"Quantized federated learning under transmission delay and outage constraints,","venue":null,"work_id":"e7165e12-a11b-486a-bf67-c55d65aa0d95","year":2021},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:26.707063Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:aaf34df4771e3221b4ddfc66105c0a28ca2309b1bb116e8f2268f77116a0ac9c","observation_id":"02ebf258-b8a5-4664-a1ba-354e620a7c06","resolution":{"observed_at":"2026-08-06T18:49:32.950002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":"2505.11304","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:29.834751Z","title":"Heterogeneity- aware client sampling: A unified solution for consistent federated learning,","venue":null,"work_id":"ed4a6460-fa47-4087-87e3-88b3bceb7ce7","year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:26.889795Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:9e3374f8c04b96a39e5d96a033e33ccf374b63b4314c07f65c4b4ba5912a098f","observation_id":"aa08f3c0-2382-4979-96dd-fa0aa386810b","resolution":{"observed_at":"2026-08-06T18:49:29.958412Z","resolver_source":"raw_fallback","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:32.695158Z","title":"Feder- ated learning in heterogeneous networks with unreliable com- munication,","venue":null,"work_id":"cbd7f067-92f6-4cb8-a98e-61712850ea08","year":2023},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:27.061907Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:2466f961ce01be63dd77d335b28f19d285ff84d294513ddb4c652475f7e827c5","observation_id":"7efcfca0-c045-4ff9-9817-6e9d3e72afdd","resolution":{"observed_at":"2026-08-06T18:49:32.778674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:32.527662Z","title":"Communication- efficient device scheduling for federated learning using stochastic optimization,","venue":null,"work_id":"cf5df830-49e5-459b-892d-16736c72cfaf","year":2022},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:27.233412Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:c52990a34b4c10efc73efd918ab547f14fb8bc00474c35802bdf42d304613218","observation_id":"36f3d9fb-a21a-4c79-8c4b-5dec7db5451a","resolution":{"observed_at":"2026-08-06T18:49:32.606256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:32.377140Z","title":"Colrel: Collaborative relaying for federated learning over intermittently connected networks,","venue":null,"work_id":"a767e920-8882-4b9f-b081-80d594d3c3d5","year":2022},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:27.406224Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:8c9933c1645f14a0d8f4fe6eb3f3bf39533019b2e61de0c04feadd6f462778a6","observation_id":"5e548ff1-2209-42c4-969d-b9e05e624c56","resolution":{"observed_at":"2026-08-06T18:49:32.430164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:32.220257Z","title":"Robust semi-decentralized federated learning via collaborative relaying,","venue":null,"work_id":"c17563eb-bc2a-467b-8b87-c560d3ad68ae","year":2023},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:27.558020Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:049e535a37f45337d8edd1cf7fbe9244f78087a63d86e82769fe7addc281bf30","observation_id":"c117efed-5995-404b-8f26-12408954a67f","resolution":{"observed_at":"2026-08-06T18:49:32.281470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:32.095007Z","title":"A unified analysis of federated learning with arbitrary client participation,","venue":null,"work_id":"c6158f8f-eefe-4e4d-8461-bca87de64744","year":2022},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:27.724916Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:367031a437eb4032149cc126e4c5e8e61ffa7327bbc35a2358ca912d9c95249c","observation_id":"ec4cad72-ae0f-428e-80d8-9da5a9ae0fa0","resolution":{"observed_at":"2026-08-06T18:49:32.153620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:31.909720Z","title":"A lightweight method for tackling unknown participation statistics in federated averaging,","venue":null,"work_id":"21e6fc1c-a055-4a3d-aad5-70768ca32707","year":2024},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:27.952256Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:d9f8acd1825ad58be966f94ed9e145aeb29e7308dc4869bcd86dbd4f28457f63","observation_id":"2b8bdf29-d7a8-4144-9532-488f00f3e3ec","resolution":{"observed_at":"2026-08-06T18:49:32.004842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:31.740464Z","title":"Efficient federated learning against heterogeneous and non- stationary client unavailability,","venue":null,"work_id":"a53efaa7-e7fc-4653-aa07-f4f052a92995","year":2024},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.138967Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:f3a2f480d44bbbceb34d8ab4e029d18c8549b33079d4d2fda3078707c1baf381","observation_id":"77ce64c1-db1b-45c4-9fe7-07424ee032d0","resolution":{"observed_at":"2026-08-06T18:49:31.812385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:31.566968Z","title":"Coded coopera- tive networks for semi-decentralized federated learning,","venue":null,"work_id":"be08986a-ba67-4eb8-8666-0a053170ab94","year":2024},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.280673Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:a1bbbaa0174a9e5d03447acdc6f557af9111f1182f0a23c07629ac811d84d4e3","observation_id":"1653ef61-a52c-4ad0-ba8e-2439b0ef3429","resolution":{"observed_at":"2026-08-06T18:49:31.642680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:31.363442Z","title":"Cooperative gradient coding,","venue":null,"work_id":"72894e59-5c2e-4227-9be4-cd34b68c6160","year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.433439Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:1e4490a2f29134fd97681d94efc60ca02e92f990f301a3dbeabe95df19e8c131","observation_id":"efd981d7-d139-4f48-b1ca-730c908cf23d","resolution":{"observed_at":"2026-08-06T18:49:31.473804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:31.171585Z","title":"On secure distributed linearly separable computation,","venue":null,"work_id":"3d72547c-1855-4031-a112-3cbb44ead394","year":2022},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.572885Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:672f48ab6d3adfe0fbb6386656210199e54380a76f4b94e49130a39161f5a759","observation_id":"0eb8b8d6-e3a6-4a15-8d1a-f08ad034520c","resolution":{"observed_at":"2026-08-06T18:49:31.296333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.07565","snapshot_observed_at":"2026-08-06T18:49:28.674872Z","title":"Secure cooperative gradient coding: Optimality, reliability, and global privacy,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.674872Z"},"links":{"cited_paper":"/paper/2507.07565","citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:7f9ab17500c9778ebfedfa6494d0675845ff559f6bc7ee4035ef71c8136ff458","observation_id":"baa2fad4-c2c1-417a-bcdb-7b2df3366d67","resolution":{"observed_at":"2026-08-06T18:49:28.674872Z","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-06T18:49:30.911500Z","title":"Goldreich, Foundations of Cryptography, Volume 2","venue":null,"work_id":"6ce955ad-3b88-463e-a11d-b9819d6dc98d","year":2004},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.795854Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:feb02145e72ca2a8a5c0d20247c6b1de750d963dceff64d4ef736ca546d58ce5","observation_id":"64c3afce-8cc7-4291-b344-ef08757c3db3","resolution":{"observed_at":"2026-08-06T18:49:31.036555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:30.643028Z","title":"Gradient coding: A voiding stragglers in distributed learning,","venue":null,"work_id":"ac11b1ac-b268-4d67-8d9e-4cf082b7e2dc","year":2017},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:28.926080Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:ce945103c1d3cb942e886b8e5c5929f1c973f93be7f1fcf5afdb3c2e33ae0484","observation_id":"f6e6194f-5ac7-4fca-9ad5-51e371af1ac4","resolution":{"observed_at":"2026-08-06T18:49:30.803426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2507.05230","last_updated":"2025-07-07T17:39:58Z","snapshot_observed_at":"2026-08-07T23:00:55.437351Z","submitted_at":"2025-07-07T17:39:58Z","title":"Cooperative Gradient Coding","version":1},"cited_work":{"arxiv_id":"2507.05230","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.05230","snapshot_observed_at":"2026-08-06T18:49:29.373607Z","title":"Cooperative Gradient Coding","venue":"cs.DC","work_id":"9f0abef6-bb34-4d18-8d7d-755e6843bcd4","year":2025},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:29.013417Z"},"links":{"cited_paper":"/paper/2507.05230","citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:c255f6336f3a49a5e436715a3b8814c10f8b62cd1306f89e9b257f901e173032","observation_id":"59fc7671-4420-4558-ae51-c51aaf158bc0","resolution":{"observed_at":"2026-08-06T18:49:29.537371Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:49:30.414761Z","title":"Gradient- based learning applied to document recognition,","venue":null,"work_id":"1bae6f60-8086-4f09-bf3b-5492c0a000f5","year":1998},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:29.132104Z"},"links":{"citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:8d95bac7838410c98e92cc2f42b08ddcf8796e3dd1165cc681cc8b2810900c79","observation_id":"2dbfb98c-0c74-4bd7-b776-01acf391501e","resolution":{"observed_at":"2026-08-06T18:49:30.549208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1810.03505","last_updated":"2018-10-02T21:20:09Z","snapshot_observed_at":"2026-08-07T01:38:08.346703Z","submitted_at":"2018-10-02T21:20:09Z","title":"CINIC-10 is not ImageNet or CIFAR-10","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.03505","snapshot_observed_at":"2026-08-06T18:49:29.218728Z","title":"Cinic-10 is not imagenet or cifar-10,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:29.218728Z"},"links":{"cited_paper":"/paper/1810.03505","citing_paper":"/paper/2507.07565"},"observation_digest":"sha256:d458208263fe50c1f0cb152f87a109c95e963e6b3ce3ffe0af95f3a507b5154f","observation_id":"9d56529e-29b1-4416-a67a-1d6f9e9c4d3c","resolution":{"observed_at":"2026-08-06T18:49:29.218728Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.07565","last_updated":"2026-07-12T10:50:53Z","latest_version":5,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T01:38:37.652932Z","submitted_at":"2025-07-10T09:10:03Z","title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":3,"verified_fuzzy":31},"total_outbound_references":37},"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 9 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 2 inbound Pith citation observations for arXiv:2507.07565."}