{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CIJTZ6AQFK25HRMNAJDCU4ODK7","short_pith_number":"pith:CIJTZ6AQ","canonical_record":{"source":{"id":"2203.07105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T13:48:23Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"93f2a782550d7703fe33a46e53ee79af7be1b2302b2a8aa66b0d2cc252a0521a","abstract_canon_sha256":"8998911c922093eaf2934d399d74901b94d84599e177b4a9fb15b2624be29de3"},"schema_version":"1.0"},"canonical_sha256":"12133cf8102ab5d3c58d02462a71c357e9ffacd2e23945781870d57700d52307","source":{"kind":"arxiv","id":"2203.07105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.07105","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"arxiv_version","alias_value":"2203.07105v2","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07105","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"pith_short_12","alias_value":"CIJTZ6AQFK25","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIJTZ6AQFK25HRMN","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIJTZ6AQ","created_at":"2026-07-05T05:33:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CIJTZ6AQFK25HRMNAJDCU4ODK7","target":"record","payload":{"canonical_record":{"source":{"id":"2203.07105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T13:48:23Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"93f2a782550d7703fe33a46e53ee79af7be1b2302b2a8aa66b0d2cc252a0521a","abstract_canon_sha256":"8998911c922093eaf2934d399d74901b94d84599e177b4a9fb15b2624be29de3"},"schema_version":"1.0"},"canonical_sha256":"12133cf8102ab5d3c58d02462a71c357e9ffacd2e23945781870d57700d52307","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:09.111411Z","signature_b64":"mSytFdApZP2YqSoq3O6Iu/9UBuMeu31SaQcsXBUzTXuJfI2cpjTLfx8ThfNiefn8iT0S6rP0jXrb7irXgNLyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12133cf8102ab5d3c58d02462a71c357e9ffacd2e23945781870d57700d52307","last_reissued_at":"2026-07-05T05:33:09.110977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:09.110977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.07105","source_version":2,"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-05T05:33:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMjF4IknTBnPLAOvoD2trULULu5a1+/bGiGAuE+A+U+C5yWfdJzS8+36o7h8NlgKZoaxTv33Qr7DPx0ch6UuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:32:59.613797Z"},"content_sha256":"4f5773beb8759782dc11cf285cc33daa82adf90e9a872461c928e98cbc1dd2ae","schema_version":"1.0","event_id":"sha256:4f5773beb8759782dc11cf285cc33daa82adf90e9a872461c928e98cbc1dd2ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CIJTZ6AQFK25HRMNAJDCU4ODK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Privatized Graph Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Ali H. Sayed, Elsa Rizk, Stefan Vlaski","submitted_at":"2022-03-14T13:48:23Z","abstract_excerpt":"Federated learning is a semi-distributed algorithm, where a server communicates with multiple dispersed clients to learn a global model. The federated architecture is not robust and is sensitive to communication and computational overloads due to its one-master multi-client structure. It can also be subject to privacy attacks targeting personal information on the communication links. In this work, we introduce graph federated learning (GFL), which consists of multiple federated units connected by a graph. We then show how graph homomorphic perturbations can be used to ensure the algorithm is d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.07105","kind":"arxiv","version":2},"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/2203.07105/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-05T05:33:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4d0nlLTTEFPUg1LelTq+gNkWC3VcnRgAfu+wQ3Mi3cWc2PrT4n7CqeCnQIIQgFobvIMMmWsJjNjRnPK3+lrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:32:59.614302Z"},"content_sha256":"8e320fd976c24193c5bd63372628276ca7cbaceab191d8cf87d81113222b1f56","schema_version":"1.0","event_id":"sha256:8e320fd976c24193c5bd63372628276ca7cbaceab191d8cf87d81113222b1f56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIJTZ6AQFK25HRMNAJDCU4ODK7/bundle.json","state_url":"https://pith.science/pith/CIJTZ6AQFK25HRMNAJDCU4ODK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIJTZ6AQFK25HRMNAJDCU4ODK7/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-10T13:32:59Z","links":{"resolver":"https://pith.science/pith/CIJTZ6AQFK25HRMNAJDCU4ODK7","bundle":"https://pith.science/pith/CIJTZ6AQFK25HRMNAJDCU4ODK7/bundle.json","state":"https://pith.science/pith/CIJTZ6AQFK25HRMNAJDCU4ODK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIJTZ6AQFK25HRMNAJDCU4ODK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CIJTZ6AQFK25HRMNAJDCU4ODK7","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":"8998911c922093eaf2934d399d74901b94d84599e177b4a9fb15b2624be29de3","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T13:48:23Z","title_canon_sha256":"93f2a782550d7703fe33a46e53ee79af7be1b2302b2a8aa66b0d2cc252a0521a"},"schema_version":"1.0","source":{"id":"2203.07105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.07105","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"arxiv_version","alias_value":"2203.07105v2","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07105","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"pith_short_12","alias_value":"CIJTZ6AQFK25","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIJTZ6AQFK25HRMN","created_at":"2026-07-05T05:33:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIJTZ6AQ","created_at":"2026-07-05T05:33:09Z"}],"graph_snapshots":[{"event_id":"sha256:8e320fd976c24193c5bd63372628276ca7cbaceab191d8cf87d81113222b1f56","target":"graph","created_at":"2026-07-05T05:33:09Z","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/2203.07105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Federated learning is a semi-distributed algorithm, where a server communicates with multiple dispersed clients to learn a global model. The federated architecture is not robust and is sensitive to communication and computational overloads due to its one-master multi-client structure. It can also be subject to privacy attacks targeting personal information on the communication links. In this work, we introduce graph federated learning (GFL), which consists of multiple federated units connected by a graph. We then show how graph homomorphic perturbations can be used to ensure the algorithm is d","authors_text":"Ali H. Sayed, Elsa Rizk, Stefan Vlaski","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T13:48:23Z","title":"Privatized Graph Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.07105","kind":"arxiv","version":2},"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:4f5773beb8759782dc11cf285cc33daa82adf90e9a872461c928e98cbc1dd2ae","target":"record","created_at":"2026-07-05T05:33:09Z","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":"8998911c922093eaf2934d399d74901b94d84599e177b4a9fb15b2624be29de3","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T13:48:23Z","title_canon_sha256":"93f2a782550d7703fe33a46e53ee79af7be1b2302b2a8aa66b0d2cc252a0521a"},"schema_version":"1.0","source":{"id":"2203.07105","kind":"arxiv","version":2}},"canonical_sha256":"12133cf8102ab5d3c58d02462a71c357e9ffacd2e23945781870d57700d52307","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12133cf8102ab5d3c58d02462a71c357e9ffacd2e23945781870d57700d52307","first_computed_at":"2026-07-05T05:33:09.110977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:33:09.110977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mSytFdApZP2YqSoq3O6Iu/9UBuMeu31SaQcsXBUzTXuJfI2cpjTLfx8ThfNiefn8iT0S6rP0jXrb7irXgNLyDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:33:09.111411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.07105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f5773beb8759782dc11cf285cc33daa82adf90e9a872461c928e98cbc1dd2ae","sha256:8e320fd976c24193c5bd63372628276ca7cbaceab191d8cf87d81113222b1f56"],"state_sha256":"4129c80958042f570a1f7a04a0031dd52e0ee2eaac965a3f0588ffcdf36af115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brFqTwzokrL8Km/hhmYdh3p6sWBZp79HqJrwXQxShR/JNJJ4Y+l7EpHJodsSoefsTpdTkI3L0Lyr3OPU7V1tCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T13:32:59.619258Z","bundle_sha256":"8a3f0a77c29cec314b2e473eac474a97d0451c07ba863977e483df79e0ac7d1e"}}