{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NCB55SWY3YBJNCUP4AQRU7ARBX","short_pith_number":"pith:NCB55SWY","schema_version":"1.0","canonical_sha256":"6883decad8de02968a8fe0211a7c110dc009206f1f4200c087d9c48725277540","source":{"kind":"arxiv","id":"2104.13215","version":1},"attestation_state":"computed","paper":{"title":"A Graph Federated Architecture with Privacy Preserving Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Ali H. Sayed, Elsa Rizk","submitted_at":"2021-04-26T09:51:24Z","abstract_excerpt":"Federated learning involves a central processor that works with multiple agents to find a global model. The process consists of repeatedly exchanging estimates, which results in the diffusion of information pertaining to the local private data. Such a scheme can be inconvenient when dealing with sensitive data, and therefore, there is a need for the privatization of the algorithms. Furthermore, the current architecture of a server connected to multiple clients is highly sensitive to communication failures and computational overloads at the server. Thus in this work, we develop a private multi-"},"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":"2104.13215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-26T09:51:24Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"03d21ed26e509718faec228df31f8f4647c265c243997e4f72b9819271cfe075","abstract_canon_sha256":"d27dbdaa25a5ece2428055b92bd8c207cd60a7ee8510b2f7215a817893a2476b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:35:46.503227Z","signature_b64":"ouo1GWVtM8yuYs915DjrDZYsml3XMV/kTuQ54u8V3/P0pKBLbYMq0pGnS8QXLOh4+VGlYEexfmYJfA7rnD4kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6883decad8de02968a8fe0211a7c110dc009206f1f4200c087d9c48725277540","last_reissued_at":"2026-07-05T02:35:46.502821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:35:46.502821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graph Federated Architecture with Privacy Preserving Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Ali H. Sayed, Elsa Rizk","submitted_at":"2021-04-26T09:51:24Z","abstract_excerpt":"Federated learning involves a central processor that works with multiple agents to find a global model. The process consists of repeatedly exchanging estimates, which results in the diffusion of information pertaining to the local private data. Such a scheme can be inconvenient when dealing with sensitive data, and therefore, there is a need for the privatization of the algorithms. Furthermore, the current architecture of a server connected to multiple clients is highly sensitive to communication failures and computational overloads at the server. Thus in this work, we develop a private multi-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.13215","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/2104.13215/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":"2104.13215","created_at":"2026-07-05T02:35:46.502883+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.13215v1","created_at":"2026-07-05T02:35:46.502883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.13215","created_at":"2026-07-05T02:35:46.502883+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCB55SWY3YBJ","created_at":"2026-07-05T02:35:46.502883+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCB55SWY3YBJNCUP","created_at":"2026-07-05T02:35:46.502883+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCB55SWY","created_at":"2026-07-05T02:35:46.502883+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05671","citing_title":"GraMFedDHAR: Graph Based Multimodal Differentially Private Federated HAR","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX","json":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX.json","graph_json":"https://pith.science/api/pith-number/NCB55SWY3YBJNCUP4AQRU7ARBX/graph.json","events_json":"https://pith.science/api/pith-number/NCB55SWY3YBJNCUP4AQRU7ARBX/events.json","paper":"https://pith.science/paper/NCB55SWY"},"agent_actions":{"view_html":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX","download_json":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX.json","view_paper":"https://pith.science/paper/NCB55SWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.13215&json=true","fetch_graph":"https://pith.science/api/pith-number/NCB55SWY3YBJNCUP4AQRU7ARBX/graph.json","fetch_events":"https://pith.science/api/pith-number/NCB55SWY3YBJNCUP4AQRU7ARBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX/action/storage_attestation","attest_author":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX/action/author_attestation","sign_citation":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX/action/citation_signature","submit_replication":"https://pith.science/pith/NCB55SWY3YBJNCUP4AQRU7ARBX/action/replication_record"}},"created_at":"2026-07-05T02:35:46.502883+00:00","updated_at":"2026-07-05T02:35:46.502883+00:00"}