{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EYT3BW2UHTVKTGBENOFSPV2J3A","short_pith_number":"pith:EYT3BW2U","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"},"canonical_sha256":"2627b0db543ceaa998246b8b27d749d83fbffe181cbbea9fc1583569c3e54092","source":{"kind":"arxiv","id":"1903.09315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09315","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09315v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09315","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"EYT3BW2UHTVK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EYT3BW2UHTVKTGBE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EYT3BW2U","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EYT3BW2UHTVKTGBENOFSPV2J3A","target":"record","payload":{"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"},"canonical_sha256":"2627b0db543ceaa998246b8b27d749d83fbffe181cbbea9fc1583569c3e54092","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"},"source_kind":"arxiv","source_id":"1903.09315","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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qF4r13aePjz5mhBYZr0C2/BLLmDjuxfP0b+VECHVlODmpudE8kGxy7zRnBuVdTK9VWYAmT9/FURfuzrW4N+CCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:06:08.814735Z"},"content_sha256":"1068e4c1950b47f5e3595074e043cb9631a22c75577aad2aa20bd56ae46bf353","schema_version":"1.0","event_id":"sha256:1068e4c1950b47f5e3595074e043cb9631a22c75577aad2aa20bd56ae46bf353"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EYT3BW2UHTVKTGBENOFSPV2J3A","target":"graph","payload":{"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"},"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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mihqSfHF24SGkZ2nVyxoZIbQkx7vXC+UIECUnGtdE6CwHMAnHeC8r79C1Ht27qOuMn2hcEM0bM4jkXK51gvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:06:08.815100Z"},"content_sha256":"de390d703f755ce348124496be8bed83169cb37a1ad578c8fa0a1c7d41a1d0b8","schema_version":"1.0","event_id":"sha256:de390d703f755ce348124496be8bed83169cb37a1ad578c8fa0a1c7d41a1d0b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/bundle.json","state_url":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/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-02T11:06:08Z","links":{"resolver":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A","bundle":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/bundle.json","state":"https://pith.science/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYT3BW2UHTVKTGBENOFSPV2J3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EYT3BW2UHTVKTGBENOFSPV2J3A","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":"d777904d365a6ff37fd0356725008660ee31a860bcd5f4acf99c61fafe4a57bd","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-03-20T23:46:20Z","title_canon_sha256":"f6be09568bb3bd48d996dbed1d6c87d23470c3447ded771bbf4d055952e536ee"},"schema_version":"1.0","source":{"id":"1903.09315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09315","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09315v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09315","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"EYT3BW2UHTVK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EYT3BW2UHTVKTGBE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EYT3BW2U","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:de390d703f755ce348124496be8bed83169cb37a1ad578c8fa0a1c7d41a1d0b8","target":"graph","created_at":"2026-05-17T23:50:39Z","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":"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","authors_text":"Jonathan Katz, Nikhil Chopra, Nirupam Gupta","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-03-20T23:46:20Z","title":"Statistical Privacy in Distributed Average Consensus on Bounded Real Inputs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09315","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:1068e4c1950b47f5e3595074e043cb9631a22c75577aad2aa20bd56ae46bf353","target":"record","created_at":"2026-05-17T23:50:39Z","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":"d777904d365a6ff37fd0356725008660ee31a860bcd5f4acf99c61fafe4a57bd","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-03-20T23:46:20Z","title_canon_sha256":"f6be09568bb3bd48d996dbed1d6c87d23470c3447ded771bbf4d055952e536ee"},"schema_version":"1.0","source":{"id":"1903.09315","kind":"arxiv","version":1}},"canonical_sha256":"2627b0db543ceaa998246b8b27d749d83fbffe181cbbea9fc1583569c3e54092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2627b0db543ceaa998246b8b27d749d83fbffe181cbbea9fc1583569c3e54092","first_computed_at":"2026-05-17T23:50:39.982177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:39.982177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VIKh2VWexHnA20SZ0Kml7iSv+GKUdiXhLsCp/Wb1bx7wzjeJHlhuQ46EA9hi5xN3rTR+AFozv1jMLkdd24g0AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:39.982738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1068e4c1950b47f5e3595074e043cb9631a22c75577aad2aa20bd56ae46bf353","sha256:de390d703f755ce348124496be8bed83169cb37a1ad578c8fa0a1c7d41a1d0b8"],"state_sha256":"6b6f79ef78c9537903c590ed5339dddf33bf60df4012832ca051398b380e1da5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWjMjtdrHvK73mtIpPkP4f1PkOih5qXhM4eCRT7NvJHCR1UN2GCUAb/OUPjcZIEtXc8Bm/Y2DzJtwgQqexytCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:06:08.817040Z","bundle_sha256":"0a241dfeef5c8c7ef4c8af704fe398762969c2fb6e2d7312634286a6e27ef6b8"}}