{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BKJD7PSPG254AJUI24DO2LWBHT","short_pith_number":"pith:BKJD7PSP","schema_version":"1.0","canonical_sha256":"0a923fbe4f36bbc02688d706ed2ec13cf443182e30f08b9406412b65e9a367ee","source":{"kind":"arxiv","id":"2507.07565","version":5},"attestation_state":"computed","paper":{"title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Ren, Mikael Skoglund, Ming Xiao, Shudi Weng, Yizhou Zhao","submitted_at":"2025-07-10T09:10:03Z","abstract_excerpt":"This work studies privacy-preserving federated learning (ppFL) under unreliable communication. In ppFL, zero-sum privacy noises enables privacy protection without sacrificing model accuracy, effectively overcoming the privacy-utility trade-off. However, in practice, unreliable communication can randomly disrupt the coordination of zero-sum noises, leading to aggregation errors and unpredictable partial participation, which severely harm the model accuracy and learning performance. To overcome these challenges, we propose a robust coding-enforced structured secure aggregation method, termed sec"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.07565","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-10T09:10:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8315f48a579ecffd20784fdb38013b2dfb251f13f5d62ec7f7ed4e803a3e400c","abstract_canon_sha256":"c5c94023cbaaefa86e1f56157219cb80a11cc0e7a1fa20cff0fa605ee056971e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:44.882295Z","signature_b64":"BTmQAG14QqkDQDzgfJbnvFK0DpYFbxjBFdhn0ffN2kDOvndDbcj5VSQ1m3nLrVtKaJGjC3QEktrmtd2AwbCdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a923fbe4f36bbc02688d706ed2ec13cf443182e30f08b9406412b65e9a367ee","last_reissued_at":"2026-07-14T01:20:44.881384Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:44.881384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Ren, Mikael Skoglund, Ming Xiao, Shudi Weng, Yizhou Zhao","submitted_at":"2025-07-10T09:10:03Z","abstract_excerpt":"This work studies privacy-preserving federated learning (ppFL) under unreliable communication. In ppFL, zero-sum privacy noises enables privacy protection without sacrificing model accuracy, effectively overcoming the privacy-utility trade-off. However, in practice, unreliable communication can randomly disrupt the coordination of zero-sum noises, leading to aggregation errors and unpredictable partial participation, which severely harm the model accuracy and learning performance. To overcome these challenges, we propose a robust coding-enforced structured secure aggregation method, termed sec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07565","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.07565/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.07565","created_at":"2026-07-14T01:20:44.881818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.07565v5","created_at":"2026-07-14T01:20:44.881818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07565","created_at":"2026-07-14T01:20:44.881818+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKJD7PSPG254","created_at":"2026-07-14T01:20:44.881818+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKJD7PSPG254AJUI","created_at":"2026-07-14T01:20:44.881818+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKJD7PSP","created_at":"2026-07-14T01:20:44.881818+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.28080","citing_title":"Perfectly Private Over-the-Air Computation","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT","json":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT.json","graph_json":"https://pith.science/api/pith-number/BKJD7PSPG254AJUI24DO2LWBHT/graph.json","events_json":"https://pith.science/api/pith-number/BKJD7PSPG254AJUI24DO2LWBHT/events.json","paper":"https://pith.science/paper/BKJD7PSP"},"agent_actions":{"view_html":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT","download_json":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT.json","view_paper":"https://pith.science/paper/BKJD7PSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.07565&json=true","fetch_graph":"https://pith.science/api/pith-number/BKJD7PSPG254AJUI24DO2LWBHT/graph.json","fetch_events":"https://pith.science/api/pith-number/BKJD7PSPG254AJUI24DO2LWBHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT/action/storage_attestation","attest_author":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT/action/author_attestation","sign_citation":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT/action/citation_signature","submit_replication":"https://pith.science/pith/BKJD7PSPG254AJUI24DO2LWBHT/action/replication_record"}},"created_at":"2026-07-14T01:20:44.881818+00:00","updated_at":"2026-07-14T01:20:44.881818+00:00"}