{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:U5IBE3G7FCEFR2W5SRLOYU4QZB","short_pith_number":"pith:U5IBE3G7","canonical_record":{"source":{"id":"1901.09367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-27T12:40:31Z","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"0cb5ac18860f8f76124261a8caddec6bae5160a0d30e9e467503e6971bd83633","abstract_canon_sha256":"8928308155d8554e904a87563585ac71a5510f38680d7602210d2f80036bd1c9"},"schema_version":"1.0"},"canonical_sha256":"a750126cdf288858eadd9456ec5390c84366e41b067b1ad7fe7b0cad5a092e0e","source":{"kind":"arxiv","id":"1901.09367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09367","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09367v1","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09367","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"U5IBE3G7FCEF","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"pith_short_16","alias_value":"U5IBE3G7FCEFR2W5","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"pith_short_8","alias_value":"U5IBE3G7","created_at":"2026-07-05T09:51:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:U5IBE3G7FCEFR2W5SRLOYU4QZB","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-27T12:40:31Z","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"0cb5ac18860f8f76124261a8caddec6bae5160a0d30e9e467503e6971bd83633","abstract_canon_sha256":"8928308155d8554e904a87563585ac71a5510f38680d7602210d2f80036bd1c9"},"schema_version":"1.0"},"canonical_sha256":"a750126cdf288858eadd9456ec5390c84366e41b067b1ad7fe7b0cad5a092e0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:24.250784Z","signature_b64":"JDZ+QqDIxj9obGd/urbOpLUZs756r4evHGyLspig79X0p9J3iGzGwqhkTfudkDc8RaolcTOHwk57f96MTUQGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a750126cdf288858eadd9456ec5390c84366e41b067b1ad7fe7b0cad5a092e0e","last_reissued_at":"2026-07-05T09:51:24.250378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:24.250378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09367","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-07-05T09:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQ9JmJhXaGzmrimu7bDy3xoHUcCcI5KP6a07U86VSGDWYxWNfr8wWDWEPsmXQ1IKtelySKU2q9mAEjhcOhGBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:29:45.960643Z"},"content_sha256":"85e43ba6e634f3ace0c9b03b0d758f5668f3583c582b9a12c6dc3ea27fd1d3e4","schema_version":"1.0","event_id":"sha256:85e43ba6e634f3ace0c9b03b0d758f5668f3583c582b9a12c6dc3ea27fd1d3e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:U5IBE3G7FCEFR2W5SRLOYU4QZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.MA","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Dmitry Grishchenko, Filip Hanzely, Jakub Kone\\v{c}n\\'y, Nicolas Loizou, Peter Richt\\'arik","submitted_at":"2019-01-27T12:40:31Z","abstract_excerpt":"In this work we present a randomized gossip algorithm for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for the method and perform extensive numerical experiments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09367","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.09367/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gCHmk7yd3vrb1GuOQI+s1ymiZELoCBuRKpjWyo9dyqyTnj6jY4oTCD7kC5dUO0QCFxgS5TYMUaBX/rlkLoUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:29:45.961643Z"},"content_sha256":"5bcc710b4ec0915aeb905d562450a5f3d44a58f53d159a5374610d4e3256bb23","schema_version":"1.0","event_id":"sha256:5bcc710b4ec0915aeb905d562450a5f3d44a58f53d159a5374610d4e3256bb23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5IBE3G7FCEFR2W5SRLOYU4QZB/bundle.json","state_url":"https://pith.science/pith/U5IBE3G7FCEFR2W5SRLOYU4QZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5IBE3G7FCEFR2W5SRLOYU4QZB/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-08-05T00:29:45Z","links":{"resolver":"https://pith.science/pith/U5IBE3G7FCEFR2W5SRLOYU4QZB","bundle":"https://pith.science/pith/U5IBE3G7FCEFR2W5SRLOYU4QZB/bundle.json","state":"https://pith.science/pith/U5IBE3G7FCEFR2W5SRLOYU4QZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5IBE3G7FCEFR2W5SRLOYU4QZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U5IBE3G7FCEFR2W5SRLOYU4QZB","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":"8928308155d8554e904a87563585ac71a5510f38680d7602210d2f80036bd1c9","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-27T12:40:31Z","title_canon_sha256":"0cb5ac18860f8f76124261a8caddec6bae5160a0d30e9e467503e6971bd83633"},"schema_version":"1.0","source":{"id":"1901.09367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09367","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09367v1","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09367","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"U5IBE3G7FCEF","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"pith_short_16","alias_value":"U5IBE3G7FCEFR2W5","created_at":"2026-07-05T09:51:24Z"},{"alias_kind":"pith_short_8","alias_value":"U5IBE3G7","created_at":"2026-07-05T09:51:24Z"}],"graph_snapshots":[{"event_id":"sha256:5bcc710b4ec0915aeb905d562450a5f3d44a58f53d159a5374610d4e3256bb23","target":"graph","created_at":"2026-07-05T09:51:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.09367/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work we present a randomized gossip algorithm for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for the method and perform extensive numerical experiments.","authors_text":"Dmitry Grishchenko, Filip Hanzely, Jakub Kone\\v{c}n\\'y, Nicolas Loizou, Peter Richt\\'arik","cross_cats":["cs.DC","cs.LG","cs.MA","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-27T12:40:31Z","title":"A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09367","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:85e43ba6e634f3ace0c9b03b0d758f5668f3583c582b9a12c6dc3ea27fd1d3e4","target":"record","created_at":"2026-07-05T09:51:24Z","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":"8928308155d8554e904a87563585ac71a5510f38680d7602210d2f80036bd1c9","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-27T12:40:31Z","title_canon_sha256":"0cb5ac18860f8f76124261a8caddec6bae5160a0d30e9e467503e6971bd83633"},"schema_version":"1.0","source":{"id":"1901.09367","kind":"arxiv","version":1}},"canonical_sha256":"a750126cdf288858eadd9456ec5390c84366e41b067b1ad7fe7b0cad5a092e0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a750126cdf288858eadd9456ec5390c84366e41b067b1ad7fe7b0cad5a092e0e","first_computed_at":"2026-07-05T09:51:24.250378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:51:24.250378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JDZ+QqDIxj9obGd/urbOpLUZs756r4evHGyLspig79X0p9J3iGzGwqhkTfudkDc8RaolcTOHwk57f96MTUQGBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:51:24.250784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85e43ba6e634f3ace0c9b03b0d758f5668f3583c582b9a12c6dc3ea27fd1d3e4","sha256:5bcc710b4ec0915aeb905d562450a5f3d44a58f53d159a5374610d4e3256bb23"],"state_sha256":"a4cb4f574308d5d532d68c40e8665996eebb9d393459bb3bce5f73c71c931760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngLahVA0p4l7XicdR/GGyL38uwOp1NzjeUPaYZlGobXRU6TzZO+w+cnNmWgDtaevL+Gf3F3x18OglCgY8+fcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:29:45.980114Z","bundle_sha256":"d5a8c5650f90ca1bab7c072c4d8294a3119def104d95735cd0ba042c5f458a64"}}