{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EAJOBJG4L65APNATIKV5U6CJJW","short_pith_number":"pith:EAJOBJG4","canonical_record":{"source":{"id":"1003.5309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-27T16:20:14Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"9f3022eb4946af3dd8aff467d32714914a2e911c451a6c3d9ad800e0daa1d4ac","abstract_canon_sha256":"72d94de1b6bb79ac725cdc29fc93515409fdbd7c58fe8efcf9c99f1ebd3b5584"},"schema_version":"1.0"},"canonical_sha256":"2012e0a4dc5fba07b41342abda78494dbabcbd3fdf7d6d3e283fd0e2ed39b455","source":{"kind":"arxiv","id":"1003.5309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.5309","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1003.5309v1","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5309","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"EAJOBJG4L65A","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EAJOBJG4L65APNAT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EAJOBJG4","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EAJOBJG4L65APNATIKV5U6CJJW","target":"record","payload":{"canonical_record":{"source":{"id":"1003.5309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-27T16:20:14Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"9f3022eb4946af3dd8aff467d32714914a2e911c451a6c3d9ad800e0daa1d4ac","abstract_canon_sha256":"72d94de1b6bb79ac725cdc29fc93515409fdbd7c58fe8efcf9c99f1ebd3b5584"},"schema_version":"1.0"},"canonical_sha256":"2012e0a4dc5fba07b41342abda78494dbabcbd3fdf7d6d3e283fd0e2ed39b455","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:47.618682Z","signature_b64":"ypoMem7aecBWIINgzoVxzhlDt145OxB9BQc8E/kUqE0xMLUYNutMghaa5lmjh5xID+bXsUPWvbTRCJAtpAGoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2012e0a4dc5fba07b41342abda78494dbabcbd3fdf7d6d3e283fd0e2ed39b455","last_reissued_at":"2026-05-18T00:58:47.618125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:47.618125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.5309","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-18T00:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LSoysbz9yQzu+z5Sw/4u4j7eZpgvSiBj0s3Dj1Lwo56w3IhrolB5TBz3lxcuUFFFfUqlQSjYsxiF0q3YG0nAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:38:31.809856Z"},"content_sha256":"522a8c1261b3f8c341d60b27245e126deaad11494e482272d1cbef09c36836ae","schema_version":"1.0","event_id":"sha256:522a8c1261b3f8c341d60b27245e126deaad11494e482272d1cbef09c36836ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EAJOBJG4L65APNATIKV5U6CJJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gossip Algorithms for Distributed Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Alexandros G. Dimakis, Anna Scaglione, Jose M.F. Moura, Michael G. Rabbat, Soummya Kar","submitted_at":"2010-03-27T16:20:14Z","abstract_excerpt":"Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions.  Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees.  This article presents an overview of recent work in the area.  We describe convergence rate results, which are related"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5309","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-18T00:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIsdkPzV10hvnRIXlFXhHSyt6QQgqMjspjZNdnDpUtnZVjeooFXHpv23rXqHNeZtZPLbWSwp9sZwg7wVlTDTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:38:31.810618Z"},"content_sha256":"25abd5d56cdbb0473d5ab1015ae232a840db9330cf236e5eb580e006070ad1f7","schema_version":"1.0","event_id":"sha256:25abd5d56cdbb0473d5ab1015ae232a840db9330cf236e5eb580e006070ad1f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAJOBJG4L65APNATIKV5U6CJJW/bundle.json","state_url":"https://pith.science/pith/EAJOBJG4L65APNATIKV5U6CJJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAJOBJG4L65APNATIKV5U6CJJW/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-05-31T06:38:31Z","links":{"resolver":"https://pith.science/pith/EAJOBJG4L65APNATIKV5U6CJJW","bundle":"https://pith.science/pith/EAJOBJG4L65APNATIKV5U6CJJW/bundle.json","state":"https://pith.science/pith/EAJOBJG4L65APNATIKV5U6CJJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAJOBJG4L65APNATIKV5U6CJJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EAJOBJG4L65APNATIKV5U6CJJW","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":"72d94de1b6bb79ac725cdc29fc93515409fdbd7c58fe8efcf9c99f1ebd3b5584","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-27T16:20:14Z","title_canon_sha256":"9f3022eb4946af3dd8aff467d32714914a2e911c451a6c3d9ad800e0daa1d4ac"},"schema_version":"1.0","source":{"id":"1003.5309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.5309","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1003.5309v1","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5309","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"EAJOBJG4L65A","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EAJOBJG4L65APNAT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EAJOBJG4","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:25abd5d56cdbb0473d5ab1015ae232a840db9330cf236e5eb580e006070ad1f7","target":"graph","created_at":"2026-05-18T00:58:47Z","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":"Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions.  Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees.  This article presents an overview of recent work in the area.  We describe convergence rate results, which are related","authors_text":"Alexandros G. Dimakis, Anna Scaglione, Jose M.F. Moura, Michael G. Rabbat, Soummya Kar","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-27T16:20:14Z","title":"Gossip Algorithms for Distributed Signal Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5309","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:522a8c1261b3f8c341d60b27245e126deaad11494e482272d1cbef09c36836ae","target":"record","created_at":"2026-05-18T00:58:47Z","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":"72d94de1b6bb79ac725cdc29fc93515409fdbd7c58fe8efcf9c99f1ebd3b5584","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-27T16:20:14Z","title_canon_sha256":"9f3022eb4946af3dd8aff467d32714914a2e911c451a6c3d9ad800e0daa1d4ac"},"schema_version":"1.0","source":{"id":"1003.5309","kind":"arxiv","version":1}},"canonical_sha256":"2012e0a4dc5fba07b41342abda78494dbabcbd3fdf7d6d3e283fd0e2ed39b455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2012e0a4dc5fba07b41342abda78494dbabcbd3fdf7d6d3e283fd0e2ed39b455","first_computed_at":"2026-05-18T00:58:47.618125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:47.618125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ypoMem7aecBWIINgzoVxzhlDt145OxB9BQc8E/kUqE0xMLUYNutMghaa5lmjh5xID+bXsUPWvbTRCJAtpAGoBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:47.618682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.5309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:522a8c1261b3f8c341d60b27245e126deaad11494e482272d1cbef09c36836ae","sha256:25abd5d56cdbb0473d5ab1015ae232a840db9330cf236e5eb580e006070ad1f7"],"state_sha256":"854ddb25699070bd9710c5b246db4f82dd674bf286a3b6e8fd4377e24a633748"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHyxicoIjRLICeZx4QnZE5qRn/dOx8+Y8D4t30FOt2V81t5y7TiBUs3DYsYl9W4JyGkfDoLo9gz+qUksum6FAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:38:31.814708Z","bundle_sha256":"0afbfc8697972099497b39731df1bd98f6454d38ba197d5367c837bed90cc3d0"}}