{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G4GGWS7KADEU7HFZQJYJ4RB5CB","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":"917c9c71bd32ebd9dc678f3a5c1bda894529ad7993201ac545914f14d21fc380","cross_cats_sorted":["cs.CR","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T12:33:53Z","title_canon_sha256":"c03722736ab93fcd0389887d099565567c386cbf05a21287d736b3fdf2d5ae6e"},"schema_version":"1.0","source":{"id":"2606.10780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10780","created_at":"2026-06-10T01:10:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10780v1","created_at":"2026-06-10T01:10:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10780","created_at":"2026-06-10T01:10:40Z"},{"alias_kind":"pith_short_12","alias_value":"G4GGWS7KADEU","created_at":"2026-06-10T01:10:40Z"},{"alias_kind":"pith_short_16","alias_value":"G4GGWS7KADEU7HFZ","created_at":"2026-06-10T01:10:40Z"},{"alias_kind":"pith_short_8","alias_value":"G4GGWS7K","created_at":"2026-06-10T01:10:40Z"}],"graph_snapshots":[{"event_id":"sha256:37aa7e04304f7d8afaeb04a080bf24d77e5dba1cd9cf361b57fe5045b429ecff","target":"graph","created_at":"2026-06-10T01:10:40Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.10780/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Secure aggregation is a vital component for mitigating gradient leakage in federated learning, but its communication cost conventionally scales with the gradient dimension. This becomes prohibitive for large models and even more pronounced in decentralized federated learning with limited bandwidth and unreliable nodes. Top-K gradient sparsification is an effective approach to reduce communication by transmitting only a few entries of the full gradient, while maintaining competitive model accuracy. Nevertheless, the top-K entries selected by each user are unpredictable and vary across users, wh","authors_text":"Hengxuan Tang, Jinbao Zhu, Xiaohu Tang","cross_cats":["cs.CR","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T12:33:53Z","title":"Secure Aggregation with Top-K Sparsification in Decentralized Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10780","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bd1350a1a3c1f04cb5aef5da5a4a7cd0fc77af2a0127dd58bbf9c246acdaf9ec","target":"record","created_at":"2026-06-10T01:10:40Z","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":"917c9c71bd32ebd9dc678f3a5c1bda894529ad7993201ac545914f14d21fc380","cross_cats_sorted":["cs.CR","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-09T12:33:53Z","title_canon_sha256":"c03722736ab93fcd0389887d099565567c386cbf05a21287d736b3fdf2d5ae6e"},"schema_version":"1.0","source":{"id":"2606.10780","kind":"arxiv","version":1}},"canonical_sha256":"370c6b4bea00c94f9cb982709e443d106773abc61f2d835ea7be265ee0d4d3aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"370c6b4bea00c94f9cb982709e443d106773abc61f2d835ea7be265ee0d4d3aa","first_computed_at":"2026-06-10T01:10:40.272641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:10:40.272641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4SfO9rtGp3n29+abBBLuD82MgryOb1tbheV35/OOBBIaMYAz8rbV55/RyS3wvfoUsWYNGa2TVlX3Z4VdnAjqAg==","signature_status":"signed_v1","signed_at":"2026-06-10T01:10:40.273454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.10780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd1350a1a3c1f04cb5aef5da5a4a7cd0fc77af2a0127dd58bbf9c246acdaf9ec","sha256:37aa7e04304f7d8afaeb04a080bf24d77e5dba1cd9cf361b57fe5045b429ecff"],"state_sha256":"742d32c41625230985c8278c57168438d4f12d07a8269a768bde17ffb06d4116"}