{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NDSOQ3ZW5XLAAJOJN7GVUKLRU5","short_pith_number":"pith:NDSOQ3ZW","schema_version":"1.0","canonical_sha256":"68e4e86f36edd60025c96fcd5a2971a7418ba97f00c4b6ad547382858f34710c","source":{"kind":"arxiv","id":"1808.00120","version":2},"attestation_state":"computed","paper":{"title":"Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"Guodong Shi, Ian Manchester, Junfeng Wu, Yang Liu","submitted_at":"2018-08-01T00:31:15Z","abstract_excerpt":"In the first part of the paper, we have studied the computational privacy risks in distributed computing protocols against local or global dynamics eavesdroppers, and proposed a Privacy-Preserving-Summation-Consistent (PPSC) mechanism as a generic privacy encryption subroutine for consensus-based distributed computations. In this part of this paper, we show that the conventional deterministic and random gossip algorithms can be used to realize the PPSC mechanism over a given network. At each time step, a node is selected to interact with one of its neighbors via deterministic or random gossipi"},"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":"1808.00120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-08-01T00:31:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1060e83a235cecba04489eaef3827f8c319db21f2681bd73f81ffd6cbb14c84f","abstract_canon_sha256":"2893e32fdc1d391bf81e9e8e21971a7f53029d33699d4215a4f7a90b2b08bedc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:42.246427Z","signature_b64":"k5PFIF4YPG2RwPy7Krc/+uEkuGGmiFZ/6zyGRG13WS++ZUO5pqHkJySn78L20Ip3hWCkxQs8dPlSNvQB12dvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e4e86f36edd60025c96fcd5a2971a7418ba97f00c4b6ad547382858f34710c","last_reissued_at":"2026-05-17T23:53:42.245930Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:42.245930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"Guodong Shi, Ian Manchester, Junfeng Wu, Yang Liu","submitted_at":"2018-08-01T00:31:15Z","abstract_excerpt":"In the first part of the paper, we have studied the computational privacy risks in distributed computing protocols against local or global dynamics eavesdroppers, and proposed a Privacy-Preserving-Summation-Consistent (PPSC) mechanism as a generic privacy encryption subroutine for consensus-based distributed computations. In this part of this paper, we show that the conventional deterministic and random gossip algorithms can be used to realize the PPSC mechanism over a given network. At each time step, a node is selected to interact with one of its neighbors via deterministic or random gossipi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00120","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":""},"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":"1808.00120","created_at":"2026-05-17T23:53:42.246007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00120v2","created_at":"2026-05-17T23:53:42.246007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00120","created_at":"2026-05-17T23:53:42.246007+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDSOQ3ZW5XLA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDSOQ3ZW5XLAAJOJ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDSOQ3ZW","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5","json":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5.json","graph_json":"https://pith.science/api/pith-number/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/graph.json","events_json":"https://pith.science/api/pith-number/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/events.json","paper":"https://pith.science/paper/NDSOQ3ZW"},"agent_actions":{"view_html":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5","download_json":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5.json","view_paper":"https://pith.science/paper/NDSOQ3ZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00120&json=true","fetch_graph":"https://pith.science/api/pith-number/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/graph.json","fetch_events":"https://pith.science/api/pith-number/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/action/storage_attestation","attest_author":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/action/author_attestation","sign_citation":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/action/citation_signature","submit_replication":"https://pith.science/pith/NDSOQ3ZW5XLAAJOJN7GVUKLRU5/action/replication_record"}},"created_at":"2026-05-17T23:53:42.246007+00:00","updated_at":"2026-05-17T23:53:42.246007+00:00"}