{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TEUAPWYJAL4JZTQ6YCMJPXDU34","short_pith_number":"pith:TEUAPWYJ","schema_version":"1.0","canonical_sha256":"992807db0902f89cce1ec09897dc74df118996da2b45078326653f4a4dbd596e","source":{"kind":"arxiv","id":"1609.06368","version":2},"attestation_state":"computed","paper":{"title":"Privacy-preserving Average Consensus: Privacy Analysis and Optimal Algorithm Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Chengcheng Zhao, Jianping He, Lin Cai, Peng Cheng, Xinping Guan","submitted_at":"2016-09-20T21:56:19Z","abstract_excerpt":"Privacy-preserving average consensus aims to guarantee the privacy of initial states and asymptotic consensus on the exact average of the initial value. In existing work, it is achieved by adding and subtracting variance decaying and zero-sum random noises to the consensus process. However, there is lack of theoretical analysis to quantify the degree of the privacy protection. In this paper, we introduce the maximum disclosure probability that the other nodes can infer one node's initial state within a given small interval to quantify the privacy. We develop a novel privacy definition, named $"},"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":"1609.06368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-09-20T21:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"2da96aacf0e71b3bef14c619228d14e710e44fc19d93db6e40b5ecd36e4abdac","abstract_canon_sha256":"8ed5cfce93d7a3e1f83d6e8677ff1ad45e149d7d08dcdf6c26b41a74409b5c77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.019330Z","signature_b64":"YYd6xM8wbhrwQJlR6lTA2Z5IQ9JNYNaQD6YYEaPSVBgALe31ad5vYlVJKJ8dMKQOoPKlhCVSgtR9HmkwaJ2gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"992807db0902f89cce1ec09897dc74df118996da2b45078326653f4a4dbd596e","last_reissued_at":"2026-05-18T00:51:03.018931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.018931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-preserving Average Consensus: Privacy Analysis and Optimal Algorithm Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Chengcheng Zhao, Jianping He, Lin Cai, Peng Cheng, Xinping Guan","submitted_at":"2016-09-20T21:56:19Z","abstract_excerpt":"Privacy-preserving average consensus aims to guarantee the privacy of initial states and asymptotic consensus on the exact average of the initial value. In existing work, it is achieved by adding and subtracting variance decaying and zero-sum random noises to the consensus process. However, there is lack of theoretical analysis to quantify the degree of the privacy protection. In this paper, we introduce the maximum disclosure probability that the other nodes can infer one node's initial state within a given small interval to quantify the privacy. We develop a novel privacy definition, named $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06368","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":"1609.06368","created_at":"2026-05-18T00:51:03.018988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06368v2","created_at":"2026-05-18T00:51:03.018988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06368","created_at":"2026-05-18T00:51:03.018988+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEUAPWYJAL4J","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEUAPWYJAL4JZTQ6","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEUAPWYJ","created_at":"2026-05-18T12:30:44.179134+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/TEUAPWYJAL4JZTQ6YCMJPXDU34","json":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34.json","graph_json":"https://pith.science/api/pith-number/TEUAPWYJAL4JZTQ6YCMJPXDU34/graph.json","events_json":"https://pith.science/api/pith-number/TEUAPWYJAL4JZTQ6YCMJPXDU34/events.json","paper":"https://pith.science/paper/TEUAPWYJ"},"agent_actions":{"view_html":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34","download_json":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34.json","view_paper":"https://pith.science/paper/TEUAPWYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06368&json=true","fetch_graph":"https://pith.science/api/pith-number/TEUAPWYJAL4JZTQ6YCMJPXDU34/graph.json","fetch_events":"https://pith.science/api/pith-number/TEUAPWYJAL4JZTQ6YCMJPXDU34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34/action/storage_attestation","attest_author":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34/action/author_attestation","sign_citation":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34/action/citation_signature","submit_replication":"https://pith.science/pith/TEUAPWYJAL4JZTQ6YCMJPXDU34/action/replication_record"}},"created_at":"2026-05-18T00:51:03.018988+00:00","updated_at":"2026-05-18T00:51:03.018988+00:00"}