{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EYT3BW2UHTVKTGBENOFSPV2J3A","short_pith_number":"pith:EYT3BW2U","schema_version":"1.0","canonical_sha256":"2627b0db543ceaa998246b8b27d749d83fbffe181cbbea9fc1583569c3e54092","source":{"kind":"arxiv","id":"1903.09315","version":1},"attestation_state":"computed","paper":{"title":"Statistical Privacy in Distributed Average Consensus on Bounded Real Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"cs.CR","authors_text":"Jonathan Katz, Nikhil Chopra, Nirupam Gupta","submitted_at":"2019-03-20T23:46:20Z","abstract_excerpt":"This paper proposes a privacy protocol for distributed average consensus algorithms on bounded real-valued inputs that guarantees statistical privacy of honest agents' inputs against colluding (passive adversarial) agents, if the set of colluding agents is not a vertex cut in the underlying communication network. This implies that privacy of agents' inputs is preserved against $t$ number of arbitrary colluding agents if the connectivity of the communication network is at least $(t+1)$. A similar privacy protocol has been proposed for the case of bounded integral inputs in our previous paper~\\c"},"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":"1903.09315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-03-20T23:46:20Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"f6be09568bb3bd48d996dbed1d6c87d23470c3447ded771bbf4d055952e536ee","abstract_canon_sha256":"d777904d365a6ff37fd0356725008660ee31a860bcd5f4acf99c61fafe4a57bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.982738Z","signature_b64":"VIKh2VWexHnA20SZ0Kml7iSv+GKUdiXhLsCp/Wb1bx7wzjeJHlhuQ46EA9hi5xN3rTR+AFozv1jMLkdd24g0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2627b0db543ceaa998246b8b27d749d83fbffe181cbbea9fc1583569c3e54092","last_reissued_at":"2026-05-17T23:50:39.982177Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.982177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Privacy in Distributed Average Consensus on Bounded Real Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"cs.CR","authors_text":"Jonathan Katz, Nikhil Chopra, Nirupam Gupta","submitted_at":"2019-03-20T23:46:20Z","abstract_excerpt":"This paper proposes a privacy protocol for distributed average consensus algorithms on bounded real-valued inputs that guarantees statistical privacy of honest agents' inputs against colluding (passive adversarial) agents, if the set of colluding agents is not a vertex cut in the underlying communication network. This implies that privacy of agents' inputs is preserved against $t$ number of arbitrary colluding agents if the connectivity of the communication network is at least $(t+1)$. A similar privacy protocol has been proposed for the case of bounded integral inputs in our previous paper~\\c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09315","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.09315","created_at":"2026-05-17T23:50:39.982262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09315v1","created_at":"2026-05-17T23:50:39.982262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09315","created_at":"2026-05-17T23:50:39.982262+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYT3BW2UHTVK","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYT3BW2UHTVKTGBE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYT3BW2U","created_at":"2026-05-18T12:33:15.570797+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/EYT3BW2UHTVKTGBENOFSPV2J3A","json":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A.json","graph_json":"https://pith.science/api/pith-number/EYT3BW2UHTVKTGBENOFSPV2J3A/graph.json","events_json":"https://pith.science/api/pith-number/EYT3BW2UHTVKTGBENOFSPV2J3A/events.json","paper":"https://pith.science/paper/EYT3BW2U"},"agent_actions":{"view_html":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A","download_json":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A.json","view_paper":"https://pith.science/paper/EYT3BW2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09315&json=true","fetch_graph":"https://pith.science/api/pith-number/EYT3BW2UHTVKTGBENOFSPV2J3A/graph.json","fetch_events":"https://pith.science/api/pith-number/EYT3BW2UHTVKTGBENOFSPV2J3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/action/storage_attestation","attest_author":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/action/author_attestation","sign_citation":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/action/citation_signature","submit_replication":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/action/replication_record"}},"created_at":"2026-05-17T23:50:39.982262+00:00","updated_at":"2026-05-17T23:50:39.982262+00:00"}