{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JPEGGRCGVGCS6CWF6DOWPPSBKK","short_pith_number":"pith:JPEGGRCG","canonical_record":{"source":{"id":"2605.13708","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-13T15:56:12Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"03e4a5cad730bf039cb9e552c0856ae5864e0ffc3450771d6d86e203fc7d95e7","abstract_canon_sha256":"2ff4a8cff89db678e1c2c3639c0c96cc0adfd08a4e76cd4066ca869e3cca6b81"},"schema_version":"1.0"},"canonical_sha256":"4bc8634446a9852f0ac5f0dd67be4152832687a787bd36c99fcd69056ab531cf","source":{"kind":"arxiv","id":"2605.13708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13708","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13708v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13708","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"JPEGGRCGVGCS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JPEGGRCGVGCS6CWF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JPEGGRCG","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JPEGGRCGVGCS6CWF6DOWPPSBKK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13708","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-13T15:56:12Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"03e4a5cad730bf039cb9e552c0856ae5864e0ffc3450771d6d86e203fc7d95e7","abstract_canon_sha256":"2ff4a8cff89db678e1c2c3639c0c96cc0adfd08a4e76cd4066ca869e3cca6b81"},"schema_version":"1.0"},"canonical_sha256":"4bc8634446a9852f0ac5f0dd67be4152832687a787bd36c99fcd69056ab531cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:16.788249Z","signature_b64":"XEYId/giB48a4mtLsMN5PjpggG5ZcYxzo8GE37C/RxICluy++71jz83CAVQYmzz/VojfaBv/T5FjdkqQJTWBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bc8634446a9852f0ac5f0dd67be4152832687a787bd36c99fcd69056ab531cf","last_reissued_at":"2026-05-18T02:44:16.787788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:16.787788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13708","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mT4P5NHIcxj8DYtrBoD3BqpDRLea7S34wCY7Enzido4J2QxeQlxi3OYNTauNhUx6YSO657lFvGwBYd9w5RxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:21:57.606866Z"},"content_sha256":"3215ff4c812cba359c1f4a4ca181051db8ef83551a917d5040a8558999875505","schema_version":"1.0","event_id":"sha256:3215ff4c812cba359c1f4a4ca181051db8ef83551a917d5040a8558999875505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JPEGGRCGVGCS6CWF6DOWPPSBKK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DisAgg: Distributed Aggregators for Efficient Secure Aggregation in Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"DisAgg distributes aggregation to a small client committee via secret sharing to cut secure FL computation while preserving privacy.","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.CR","authors_text":"Anastasios Drosou, Dimitrios Alexopoulos, Giorgos Tatsis, Haaris Mehmood, Jie Xu, Karthikeyan Saravanan, Mete Ozay","submitted_at":"2026-05-13T15:56:12Z","abstract_excerpt":"Federated learning enables collaborative model training across distributed clients, yet vanilla FL exposes client updates to the central server. Secure-aggregation schemes protect privacy against an honest-but-curious server, but existing approaches often suffer from many communication rounds, heavy public-key operations, or difficulty handling client dropouts. Recent methods like One-Shot Private Aggregation (OPA) cut rounds to a single server interaction per FL iteration, yet they impose substantial cryptographic and computational overhead on both server and clients. We propose a new protoco"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"DisAgg processes 100k-dimensional update vectors from 100k 5G clients with a 4.6x speedup compared to OPA, the previous best protocol, while preserving privacy against a curious server and a limited fraction of colluding clients.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The protocol assumes that secret sharing to the aggregator committee provides privacy guarantees without additional overheads and that the limited fraction of colluding clients does not exceed the threshold that would break reconstruction or privacy.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DisAgg distributes secure aggregation to a client committee via secret sharing, eliminating local masking and homomorphic encryption while preserving privacy and delivering 4.6x speedup over OPA for 100k clients and 100k-dimensional updates.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"DisAgg distributes aggregation to a small client committee via secret sharing to cut secure FL computation while preserving privacy.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"177c28ddb78d9b4c6aba1b3921ef09007f23f0742efb6a2c5c1e80d84db7ee32"},"source":{"id":"2605.13708","kind":"arxiv","version":1},"verdict":{"id":"32570d56-d57a-4e9b-bb77-44e0ffed94b0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:46:57.049467Z","strongest_claim":"DisAgg processes 100k-dimensional update vectors from 100k 5G clients with a 4.6x speedup compared to OPA, the previous best protocol, while preserving privacy against a curious server and a limited fraction of colluding clients.","one_line_summary":"DisAgg distributes secure aggregation to a client committee via secret sharing, eliminating local masking and homomorphic encryption while preserving privacy and delivering 4.6x speedup over OPA for 100k clients and 100k-dimensional updates.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The protocol assumes that secret sharing to the aggregator committee provides privacy guarantees without additional overheads and that the limited fraction of colluding clients does not exceed the threshold that would break reconstruction or privacy.","pith_extraction_headline":"DisAgg distributes aggregation to a small client committee via secret sharing to cut secure FL computation while preserving privacy."},"references":{"count":49,"sample":[{"doi":"","year":2017,"title":"ACM CCS 2017 , booktitle =","work_id":"75db8e17-e1f8-4fd6-852d-d233b0616530","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS) , booktitle =","work_id":"c8adc5fb-e387-4d91-b71c-70fbf4219c08","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of Machine learning and systems , volume=","work_id":"f0c203ad-bdf3-4e7b-99a0-ffbe41970659","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"International Conference on Learning Representations , year=","work_id":"f33d1ed9-5a26-4cf6-8ce2-8fff90049ebd","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"arXiv preprint arXiv:2107.06917 , year=","work_id":"bf79fb64-4fe7-4676-a750-efe8be1b104c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":49,"snapshot_sha256":"288d66cea5f45e317b201ea5756373f9cdc566c2dc320f683a2c24b97de217d0","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"},"verdict_id":"32570d56-d57a-4e9b-bb77-44e0ffed94b0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERZNnEA4khTMTVLvhJ2MVGFoo1LdIVRuzftaoU8HtZ7U6zxlMymOBPvLKhSfmnDA+4gwsAXzM/1agZQ9bI8iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:21:57.607830Z"},"content_sha256":"070ba22e076b07170a82ad91b923822d99b17122e855af2868000b8d0c177160","schema_version":"1.0","event_id":"sha256:070ba22e076b07170a82ad91b923822d99b17122e855af2868000b8d0c177160"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPEGGRCGVGCS6CWF6DOWPPSBKK/bundle.json","state_url":"https://pith.science/pith/JPEGGRCGVGCS6CWF6DOWPPSBKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPEGGRCGVGCS6CWF6DOWPPSBKK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T21:21:57Z","links":{"resolver":"https://pith.science/pith/JPEGGRCGVGCS6CWF6DOWPPSBKK","bundle":"https://pith.science/pith/JPEGGRCGVGCS6CWF6DOWPPSBKK/bundle.json","state":"https://pith.science/pith/JPEGGRCGVGCS6CWF6DOWPPSBKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPEGGRCGVGCS6CWF6DOWPPSBKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JPEGGRCGVGCS6CWF6DOWPPSBKK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2ff4a8cff89db678e1c2c3639c0c96cc0adfd08a4e76cd4066ca869e3cca6b81","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-13T15:56:12Z","title_canon_sha256":"03e4a5cad730bf039cb9e552c0856ae5864e0ffc3450771d6d86e203fc7d95e7"},"schema_version":"1.0","source":{"id":"2605.13708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13708","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13708v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13708","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"JPEGGRCGVGCS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JPEGGRCGVGCS6CWF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JPEGGRCG","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:070ba22e076b07170a82ad91b923822d99b17122e855af2868000b8d0c177160","target":"graph","created_at":"2026-05-18T02:44:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"DisAgg processes 100k-dimensional update vectors from 100k 5G clients with a 4.6x speedup compared to OPA, the previous best protocol, while preserving privacy against a curious server and a limited fraction of colluding clients."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The protocol assumes that secret sharing to the aggregator committee provides privacy guarantees without additional overheads and that the limited fraction of colluding clients does not exceed the threshold that would break reconstruction or privacy."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"DisAgg distributes secure aggregation to a client committee via secret sharing, eliminating local masking and homomorphic encryption while preserving privacy and delivering 4.6x speedup over OPA for 100k clients and 100k-dimensional updates."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"DisAgg distributes aggregation to a small client committee via secret sharing to cut secure FL computation while preserving privacy."}],"snapshot_sha256":"177c28ddb78d9b4c6aba1b3921ef09007f23f0742efb6a2c5c1e80d84db7ee32"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Federated learning enables collaborative model training across distributed clients, yet vanilla FL exposes client updates to the central server. Secure-aggregation schemes protect privacy against an honest-but-curious server, but existing approaches often suffer from many communication rounds, heavy public-key operations, or difficulty handling client dropouts. Recent methods like One-Shot Private Aggregation (OPA) cut rounds to a single server interaction per FL iteration, yet they impose substantial cryptographic and computational overhead on both server and clients. We propose a new protoco","authors_text":"Anastasios Drosou, Dimitrios Alexopoulos, Giorgos Tatsis, Haaris Mehmood, Jie Xu, Karthikeyan Saravanan, Mete Ozay","cross_cats":["cs.DC","cs.LG"],"headline":"DisAgg distributes aggregation to a small client committee via secret sharing to cut secure FL computation while preserving privacy.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-13T15:56:12Z","title":"DisAgg: Distributed Aggregators for Efficient Secure Aggregation in Federated Learning"},"references":{"count":49,"internal_anchors":0,"resolved_work":49,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"ACM CCS 2017 , booktitle =","work_id":"75db8e17-e1f8-4fd6-852d-d233b0616530","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS) , booktitle =","work_id":"c8adc5fb-e387-4d91-b71c-70fbf4219c08","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Proceedings of Machine learning and systems , volume=","work_id":"f0c203ad-bdf3-4e7b-99a0-ffbe41970659","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"International Conference on Learning Representations , year=","work_id":"f33d1ed9-5a26-4cf6-8ce2-8fff90049ebd","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv preprint arXiv:2107.06917 , year=","work_id":"bf79fb64-4fe7-4676-a750-efe8be1b104c","year":2021}],"snapshot_sha256":"288d66cea5f45e317b201ea5756373f9cdc566c2dc320f683a2c24b97de217d0"},"source":{"id":"2605.13708","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:46:57.049467Z","id":"32570d56-d57a-4e9b-bb77-44e0ffed94b0","model_set":{"reader":"grok-4.3"},"one_line_summary":"DisAgg distributes secure aggregation to a client committee via secret sharing, eliminating local masking and homomorphic encryption while preserving privacy and delivering 4.6x speedup over OPA for 100k clients and 100k-dimensional updates.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"DisAgg distributes aggregation to a small client committee via secret sharing to cut secure FL computation while preserving privacy.","strongest_claim":"DisAgg processes 100k-dimensional update vectors from 100k 5G clients with a 4.6x speedup compared to OPA, the previous best protocol, while preserving privacy against a curious server and a limited fraction of colluding clients.","weakest_assumption":"The protocol assumes that secret sharing to the aggregator committee provides privacy guarantees without additional overheads and that the limited fraction of colluding clients does not exceed the threshold that would break reconstruction or privacy."}},"verdict_id":"32570d56-d57a-4e9b-bb77-44e0ffed94b0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3215ff4c812cba359c1f4a4ca181051db8ef83551a917d5040a8558999875505","target":"record","created_at":"2026-05-18T02:44:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2ff4a8cff89db678e1c2c3639c0c96cc0adfd08a4e76cd4066ca869e3cca6b81","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-13T15:56:12Z","title_canon_sha256":"03e4a5cad730bf039cb9e552c0856ae5864e0ffc3450771d6d86e203fc7d95e7"},"schema_version":"1.0","source":{"id":"2605.13708","kind":"arxiv","version":1}},"canonical_sha256":"4bc8634446a9852f0ac5f0dd67be4152832687a787bd36c99fcd69056ab531cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bc8634446a9852f0ac5f0dd67be4152832687a787bd36c99fcd69056ab531cf","first_computed_at":"2026-05-18T02:44:16.787788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:16.787788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XEYId/giB48a4mtLsMN5PjpggG5ZcYxzo8GE37C/RxICluy++71jz83CAVQYmzz/VojfaBv/T5FjdkqQJTWBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:16.788249Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3215ff4c812cba359c1f4a4ca181051db8ef83551a917d5040a8558999875505","sha256:070ba22e076b07170a82ad91b923822d99b17122e855af2868000b8d0c177160"],"state_sha256":"2436638d52c11cf240c3b7bc5e6c011e12657d2a7b0da54d7d3e3ff6705c882c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bml3FnEMmO/DfttmDn786qlRbhVOKQqauVyEbfm8wpRZAvMcM20qIRRFIsuneDS4vrLINSunAp+FNPL6w4+5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:21:57.613662Z","bundle_sha256":"473bd5cdc1c4bca1b1b2a12ffc4fae94fde29319762f52ce46ef8d60a4745dcc"}}