{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:AMOEFZXEDUNTINCD22HIECQF2Z","short_pith_number":"pith:AMOEFZXE","canonical_record":{"source":{"id":"2112.12872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-23T22:44:21Z","cross_cats_sorted":["cs.CR","cs.DC","cs.IT","math.IT"],"title_canon_sha256":"349359909ca15029710c063e567bd03e6db1a058c3791b47f8f9b4a881a24433","abstract_canon_sha256":"23bd396f8f365827ce80797859ef9786633fa6cef5497af9edaf2716c355272b"},"schema_version":"1.0"},"canonical_sha256":"031c42e6e41d1b343443d68e820a05d6672770995147c283ab28f8c9c0361fef","source":{"kind":"arxiv","id":"2112.12872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.12872","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"2112.12872v1","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.12872","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"AMOEFZXEDUNT","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"pith_short_16","alias_value":"AMOEFZXEDUNTINCD","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"pith_short_8","alias_value":"AMOEFZXE","created_at":"2026-07-05T03:43:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:AMOEFZXEDUNTINCD22HIECQF2Z","target":"record","payload":{"canonical_record":{"source":{"id":"2112.12872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-23T22:44:21Z","cross_cats_sorted":["cs.CR","cs.DC","cs.IT","math.IT"],"title_canon_sha256":"349359909ca15029710c063e567bd03e6db1a058c3791b47f8f9b4a881a24433","abstract_canon_sha256":"23bd396f8f365827ce80797859ef9786633fa6cef5497af9edaf2716c355272b"},"schema_version":"1.0"},"canonical_sha256":"031c42e6e41d1b343443d68e820a05d6672770995147c283ab28f8c9c0361fef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:47.712089Z","signature_b64":"XJUAOKQcblLcLWFjqmymAJuK0LvJghWvBwXQR8D59Nc48aoh4HOmcmAmwy6BTyC0izZ5F3wVRCMarjgmx2YyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"031c42e6e41d1b343443d68e820a05d6672770995147c283ab28f8c9c0361fef","last_reissued_at":"2026-07-05T03:43:47.711625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:47.711625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.12872","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-07-05T03:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulI1KNqhBUR9l2js+6oj6TmyGSh3ECSfmJFKVtkgkV/PdSoRG1S+fwu8F6dmn8FqD72cXDO9ETpDFSZrBIE5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:54:39.660317Z"},"content_sha256":"4605fdbaf2fbe297e6e6a937137c1192b7ce8cd16f3a3a032941a7cedcdf668f","schema_version":"1.0","event_id":"sha256:4605fdbaf2fbe297e6e6a937137c1192b7ce8cd16f3a3a032941a7cedcdf668f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:AMOEFZXEDUNTINCD22HIECQF2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsified Secure Aggregation for Privacy-Preserving Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Basak Guler, Hasin Us Sami, Irem Ergun","submitted_at":"2021-12-23T22:44:21Z","abstract_excerpt":"Secure aggregation is a popular protocol in privacy-preserving federated learning, which allows model aggregation without revealing the individual models in the clear. On the other hand, conventional secure aggregation protocols incur a significant communication overhead, which can become a major bottleneck in real-world bandwidth-limited applications. Towards addressing this challenge, in this work we propose a lightweight gradient sparsification framework for secure aggregation, in which the server learns the aggregate of the sparsified local model updates from a large number of users, but w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.12872","kind":"arxiv","version":1},"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/2112.12872/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaPRzPXDzLtx65moVryqu3CO3CkFQL4qEvoH9BkSY7yYDcUwcEDFR0Msk6tYk4kqaBq3NdU/WlZUFZIgeJJ3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:54:39.660854Z"},"content_sha256":"c58599e3c492ef3a4d3b3725beebc9b7bafe1300cf72f2e61e09ac35d557c2ce","schema_version":"1.0","event_id":"sha256:c58599e3c492ef3a4d3b3725beebc9b7bafe1300cf72f2e61e09ac35d557c2ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMOEFZXEDUNTINCD22HIECQF2Z/bundle.json","state_url":"https://pith.science/pith/AMOEFZXEDUNTINCD22HIECQF2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMOEFZXEDUNTINCD22HIECQF2Z/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-08-19T08:54:39Z","links":{"resolver":"https://pith.science/pith/AMOEFZXEDUNTINCD22HIECQF2Z","bundle":"https://pith.science/pith/AMOEFZXEDUNTINCD22HIECQF2Z/bundle.json","state":"https://pith.science/pith/AMOEFZXEDUNTINCD22HIECQF2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMOEFZXEDUNTINCD22HIECQF2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:AMOEFZXEDUNTINCD22HIECQF2Z","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":"23bd396f8f365827ce80797859ef9786633fa6cef5497af9edaf2716c355272b","cross_cats_sorted":["cs.CR","cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-23T22:44:21Z","title_canon_sha256":"349359909ca15029710c063e567bd03e6db1a058c3791b47f8f9b4a881a24433"},"schema_version":"1.0","source":{"id":"2112.12872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.12872","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"2112.12872v1","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.12872","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"AMOEFZXEDUNT","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"pith_short_16","alias_value":"AMOEFZXEDUNTINCD","created_at":"2026-07-05T03:43:47Z"},{"alias_kind":"pith_short_8","alias_value":"AMOEFZXE","created_at":"2026-07-05T03:43:47Z"}],"graph_snapshots":[{"event_id":"sha256:c58599e3c492ef3a4d3b3725beebc9b7bafe1300cf72f2e61e09ac35d557c2ce","target":"graph","created_at":"2026-07-05T03:43:47Z","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/2112.12872/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Secure aggregation is a popular protocol in privacy-preserving federated learning, which allows model aggregation without revealing the individual models in the clear. On the other hand, conventional secure aggregation protocols incur a significant communication overhead, which can become a major bottleneck in real-world bandwidth-limited applications. Towards addressing this challenge, in this work we propose a lightweight gradient sparsification framework for secure aggregation, in which the server learns the aggregate of the sparsified local model updates from a large number of users, but w","authors_text":"Basak Guler, Hasin Us Sami, Irem Ergun","cross_cats":["cs.CR","cs.DC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-23T22:44:21Z","title":"Sparsified Secure Aggregation for Privacy-Preserving Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.12872","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:4605fdbaf2fbe297e6e6a937137c1192b7ce8cd16f3a3a032941a7cedcdf668f","target":"record","created_at":"2026-07-05T03:43:47Z","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":"23bd396f8f365827ce80797859ef9786633fa6cef5497af9edaf2716c355272b","cross_cats_sorted":["cs.CR","cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-23T22:44:21Z","title_canon_sha256":"349359909ca15029710c063e567bd03e6db1a058c3791b47f8f9b4a881a24433"},"schema_version":"1.0","source":{"id":"2112.12872","kind":"arxiv","version":1}},"canonical_sha256":"031c42e6e41d1b343443d68e820a05d6672770995147c283ab28f8c9c0361fef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"031c42e6e41d1b343443d68e820a05d6672770995147c283ab28f8c9c0361fef","first_computed_at":"2026-07-05T03:43:47.711625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:43:47.711625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJUAOKQcblLcLWFjqmymAJuK0LvJghWvBwXQR8D59Nc48aoh4HOmcmAmwy6BTyC0izZ5F3wVRCMarjgmx2YyBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:43:47.712089Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.12872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4605fdbaf2fbe297e6e6a937137c1192b7ce8cd16f3a3a032941a7cedcdf668f","sha256:c58599e3c492ef3a4d3b3725beebc9b7bafe1300cf72f2e61e09ac35d557c2ce"],"state_sha256":"53a9497f406f4e49a49046f8098de93cc3b3212da6dab9c92d7bd85a34b5a31b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGTjXqPGeioOLl5wpnEE6lLAflMPVfEBKA/zSMFXXb7sQeW4n4Cxqj45O+eksLGOMAOWb5qXUMoCNlFq4j3bBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T08:54:39.666093Z","bundle_sha256":"98f50b6b092b7833f3b2a531fb36e18cfede3d8b8925f5c1f8e7342626b6e177"}}