{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4Y7IDHVBMBHG6UWWDVTNARJADJ","short_pith_number":"pith:4Y7IDHVB","schema_version":"1.0","canonical_sha256":"e63e819ea1604e6f52d61d66d045201a47bc4022f168a6e2900a18facb45b04a","source":{"kind":"arxiv","id":"1906.08320","version":3},"attestation_state":"computed","paper":{"title":"Scalable and Differentially Private Distributed Aggregation in the Shuffled Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameya Velingker, Badih Ghazi, Rasmus Pagh","submitted_at":"2019-06-19T19:30:05Z","abstract_excerpt":"Federated learning promises to make machine learning feasible on distributed, private datasets by implementing gradient descent using secure aggregation methods. The idea is to compute a global weight update without revealing the contributions of individual users. Current practical protocols for secure aggregation work in an \"honest but curious\" setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol. A more scalable and robust primitive for privacy-preserving protocols is s"},"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":"1906.08320","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T19:30:05Z","cross_cats_sorted":["cs.CR","cs.DC","cs.DS","stat.ML"],"title_canon_sha256":"ac1b2b449bd11d5c5d1a1610db77d91edd4ecbe38e1fc49167e53588f952a437","abstract_canon_sha256":"d157a5ba38344fefd98ff6f9da8efc18639da4b18b6fe7bdd1bad26a444a89e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:05.665695Z","signature_b64":"5no40Rn83764W4cJmZBTz/p9C0KAMOc1rVHFJecKrNdBGtBC5Fg9n4plfKZIIoSosEtnzJWepo+jx21MZ5OrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e63e819ea1604e6f52d61d66d045201a47bc4022f168a6e2900a18facb45b04a","last_reissued_at":"2026-07-05T00:23:05.665256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:05.665256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable and Differentially Private Distributed Aggregation in the Shuffled Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameya Velingker, Badih Ghazi, Rasmus Pagh","submitted_at":"2019-06-19T19:30:05Z","abstract_excerpt":"Federated learning promises to make machine learning feasible on distributed, private datasets by implementing gradient descent using secure aggregation methods. The idea is to compute a global weight update without revealing the contributions of individual users. Current practical protocols for secure aggregation work in an \"honest but curious\" setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol. A more scalable and robust primitive for privacy-preserving protocols is s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08320","kind":"arxiv","version":3},"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/1906.08320/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":"1906.08320","created_at":"2026-07-05T00:23:05.665310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08320v3","created_at":"2026-07-05T00:23:05.665310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08320","created_at":"2026-07-05T00:23:05.665310+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Y7IDHVBMBHG","created_at":"2026-07-05T00:23:05.665310+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Y7IDHVBMBHG6UWW","created_at":"2026-07-05T00:23:05.665310+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Y7IDHVB","created_at":"2026-07-05T00:23:05.665310+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11515","citing_title":"Improving Utility and Security of the Shuffler-based Differential Privacy","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ","json":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ.json","graph_json":"https://pith.science/api/pith-number/4Y7IDHVBMBHG6UWWDVTNARJADJ/graph.json","events_json":"https://pith.science/api/pith-number/4Y7IDHVBMBHG6UWWDVTNARJADJ/events.json","paper":"https://pith.science/paper/4Y7IDHVB"},"agent_actions":{"view_html":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ","download_json":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ.json","view_paper":"https://pith.science/paper/4Y7IDHVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08320&json=true","fetch_graph":"https://pith.science/api/pith-number/4Y7IDHVBMBHG6UWWDVTNARJADJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4Y7IDHVBMBHG6UWWDVTNARJADJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ/action/storage_attestation","attest_author":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ/action/author_attestation","sign_citation":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ/action/citation_signature","submit_replication":"https://pith.science/pith/4Y7IDHVBMBHG6UWWDVTNARJADJ/action/replication_record"}},"created_at":"2026-07-05T00:23:05.665310+00:00","updated_at":"2026-07-05T00:23:05.665310+00:00"}