{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5QK6VJO43AU54NVXJFDPDTOALW","short_pith_number":"pith:5QK6VJO4","canonical_record":{"source":{"id":"1805.10559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-27T00:37:59Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"2675f8e7f8dea495eb753acc1a477d800aa10409ec43b1d482df7cadff73c586","abstract_canon_sha256":"a337c70046a72441f103b5dbd27bd322e8d0ee0478a723da810091604e88bdf2"},"schema_version":"1.0"},"canonical_sha256":"ec15eaa5dcd829de36b74946f1cdc05d866b6412ca20da62826454909a8af268","source":{"kind":"arxiv","id":"1805.10559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10559","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10559v1","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10559","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"5QK6VJO43AU5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5QK6VJO43AU54NVX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5QK6VJO4","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5QK6VJO43AU54NVXJFDPDTOALW","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-27T00:37:59Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"2675f8e7f8dea495eb753acc1a477d800aa10409ec43b1d482df7cadff73c586","abstract_canon_sha256":"a337c70046a72441f103b5dbd27bd322e8d0ee0478a723da810091604e88bdf2"},"schema_version":"1.0"},"canonical_sha256":"ec15eaa5dcd829de36b74946f1cdc05d866b6412ca20da62826454909a8af268","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:52.103168Z","signature_b64":"E6OoFpXUEIKiHTldTXVVsR43QGn5QSQ4QQHBUtYqTDGW/Z3RP83hgiIjS3utIpqEMZh8Su6c74baXN4y9S6uAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec15eaa5dcd829de36b74946f1cdc05d866b6412ca20da62826454909a8af268","last_reissued_at":"2026-05-18T00:14:52.102516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:52.102516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10559","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-05-18T00:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHmAo+Mr0QheAfmZVZwm4xqu9t0gsVE+5RJw2Lu30j1aCKOjFm2LY4expaFbOUby0jsnAImNjk8ppUzPhpL7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:58:01.965824Z"},"content_sha256":"c704a43ad8b42e09c63f059e6745ade8e26551e505e4e6604388cbc66f21220e","schema_version":"1.0","event_id":"sha256:c704a43ad8b42e09c63f059e6745ade8e26551e505e4e6604388cbc66f21220e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5QK6VJO43AU54NVXJFDPDTOALW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"cpSGD: Communication-efficient and differentially-private distributed SGD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ananda Theertha Suresh, Felix Yu, H. Brendan McMahan, Naman Agarwal, Sanjiv Kumar","submitted_at":"2018-05-27T00:37:59Z","abstract_excerpt":"Distributed stochastic gradient descent is an important subroutine in distributed learning. A setting of particular interest is when the clients are mobile devices, where two important concerns are communication efficiency and the privacy of the clients. Several recent works have focused on reducing the communication cost or introducing privacy guarantees, but none of the proposed communication efficient methods are known to be privacy preserving and none of the known privacy mechanisms are known to be communication efficient. To this end, we study algorithms that achieve both communication ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10559","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":""},"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-05-18T00:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDxrCQAh346tsyaizRt2/vdJrA9KAhqoPSECKr9wCKWIYMmEGUNla7CmgtEHRWZ3SUJY76d2nCYgkShBa+DqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:58:01.966174Z"},"content_sha256":"0f20f22d48fb5d9026b5634386bb2647c227fade91c52863723be35303fed420","schema_version":"1.0","event_id":"sha256:0f20f22d48fb5d9026b5634386bb2647c227fade91c52863723be35303fed420"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QK6VJO43AU54NVXJFDPDTOALW/bundle.json","state_url":"https://pith.science/pith/5QK6VJO43AU54NVXJFDPDTOALW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QK6VJO43AU54NVXJFDPDTOALW/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-06-02T22:58:01Z","links":{"resolver":"https://pith.science/pith/5QK6VJO43AU54NVXJFDPDTOALW","bundle":"https://pith.science/pith/5QK6VJO43AU54NVXJFDPDTOALW/bundle.json","state":"https://pith.science/pith/5QK6VJO43AU54NVXJFDPDTOALW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QK6VJO43AU54NVXJFDPDTOALW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5QK6VJO43AU54NVXJFDPDTOALW","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":"a337c70046a72441f103b5dbd27bd322e8d0ee0478a723da810091604e88bdf2","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-27T00:37:59Z","title_canon_sha256":"2675f8e7f8dea495eb753acc1a477d800aa10409ec43b1d482df7cadff73c586"},"schema_version":"1.0","source":{"id":"1805.10559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10559","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10559v1","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10559","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"5QK6VJO43AU5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5QK6VJO43AU54NVX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5QK6VJO4","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:0f20f22d48fb5d9026b5634386bb2647c227fade91c52863723be35303fed420","target":"graph","created_at":"2026-05-18T00:14:52Z","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"},"paper":{"abstract_excerpt":"Distributed stochastic gradient descent is an important subroutine in distributed learning. A setting of particular interest is when the clients are mobile devices, where two important concerns are communication efficiency and the privacy of the clients. Several recent works have focused on reducing the communication cost or introducing privacy guarantees, but none of the proposed communication efficient methods are known to be privacy preserving and none of the known privacy mechanisms are known to be communication efficient. To this end, we study algorithms that achieve both communication ef","authors_text":"Ananda Theertha Suresh, Felix Yu, H. Brendan McMahan, Naman Agarwal, Sanjiv Kumar","cross_cats":["cs.CR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-27T00:37:59Z","title":"cpSGD: Communication-efficient and differentially-private distributed SGD"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10559","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:c704a43ad8b42e09c63f059e6745ade8e26551e505e4e6604388cbc66f21220e","target":"record","created_at":"2026-05-18T00:14:52Z","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":"a337c70046a72441f103b5dbd27bd322e8d0ee0478a723da810091604e88bdf2","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-27T00:37:59Z","title_canon_sha256":"2675f8e7f8dea495eb753acc1a477d800aa10409ec43b1d482df7cadff73c586"},"schema_version":"1.0","source":{"id":"1805.10559","kind":"arxiv","version":1}},"canonical_sha256":"ec15eaa5dcd829de36b74946f1cdc05d866b6412ca20da62826454909a8af268","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec15eaa5dcd829de36b74946f1cdc05d866b6412ca20da62826454909a8af268","first_computed_at":"2026-05-18T00:14:52.102516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:52.102516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E6OoFpXUEIKiHTldTXVVsR43QGn5QSQ4QQHBUtYqTDGW/Z3RP83hgiIjS3utIpqEMZh8Su6c74baXN4y9S6uAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:52.103168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c704a43ad8b42e09c63f059e6745ade8e26551e505e4e6604388cbc66f21220e","sha256:0f20f22d48fb5d9026b5634386bb2647c227fade91c52863723be35303fed420"],"state_sha256":"3eeb7ae84851716e64bc352860187c440767d412de0c19dde7e0c5e27e9f6784"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ra8UKj/arhRSQdWRsxe8kL0CeCH1d8k6ZJgkOLrDkiK3tJexh1+fIcLWLCBnBgNYCjcSQDGCmJvwYI/DnNiXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:58:01.968202Z","bundle_sha256":"80c8601e00c3f0c53284ace73ec4d3a520b97129e76cfaaa7a05241972590e02"}}