{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ERMKGO5ZDLU4CKYGHBIYMSWUJB","short_pith_number":"pith:ERMKGO5Z","canonical_record":{"source":{"id":"1011.2235","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-09T23:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"bfb232ec62675d7912569ea6df7d6c2c47f5abd4fee56cceb72aba146b33ba44","abstract_canon_sha256":"dd0860d220553834a6a012699537d2480f6f2acadd644349e261895807828e57"},"schema_version":"1.0"},"canonical_sha256":"2458a33bb91ae9c12b063851864ad4485c313499b906a4b3b4c210678c11f991","source":{"kind":"arxiv","id":"1011.2235","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2235","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2235v3","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2235","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"ERMKGO5ZDLU4","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ERMKGO5ZDLU4CKYG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ERMKGO5Z","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ERMKGO5ZDLU4CKYGHBIYMSWUJB","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2235","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-09T23:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"bfb232ec62675d7912569ea6df7d6c2c47f5abd4fee56cceb72aba146b33ba44","abstract_canon_sha256":"dd0860d220553834a6a012699537d2480f6f2acadd644349e261895807828e57"},"schema_version":"1.0"},"canonical_sha256":"2458a33bb91ae9c12b063851864ad4485c313499b906a4b3b4c210678c11f991","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:23.815778Z","signature_b64":"4W9uHwqymor/BGK0aHzRaJrsr08HfNsJUbpiCtN8IM6HkGP0JnMZqcI6oK5YNuX4e3Ce3vETTUGpIQLNaxoBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2458a33bb91ae9c12b063851864ad4485c313499b906a4b3b4c210678c11f991","last_reissued_at":"2026-05-18T04:01:23.815127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:23.815127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2235","source_version":3,"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-18T04:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShRxo1WiKzoaWWaqjn5VmJ9+9bsjSQmvL/NKqLgXRFQY/10hMp32Mf+nHZwyWzKJ8NP16ir4Y4fqd8PrGRIWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:55:33.184441Z"},"content_sha256":"ab0dc6238dac20d78d0bc856a277719c5d768b6b74dad3c445189fdf0f9ac8f8","schema_version":"1.0","event_id":"sha256:ab0dc6238dac20d78d0bc856a277719c5d768b6b74dad3c445189fdf0f9ac8f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ERMKGO5ZDLU4CKYGHBIYMSWUJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","submitted_at":"2010-11-09T23:50:10Z","abstract_excerpt":"This paper describes and analyzes a hierarchical gossip algorithm for solving the distributed average consensus problem in wireless sensor networks. The network is recursively partitioned into subnetworks. Initially, nodes at the finest scale gossip to compute local averages. Then, using geographic routing to enable gossip between nodes that are not directly connected, these local averages are progressively fused up the hierarchy until the global average is computed. We show that the proposed hierarchical scheme with $k$ levels of hierarchy is competitive with state-of-the-art randomized gossi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2235","kind":"arxiv","version":3},"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-18T04:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGIIbUjNAHF75S8jIWX4kdX5+nLx3RquW9wbQCGTqgYzv8w0qznawa8ZToNhcipOs5tf7MP2h190o53D40k0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:55:33.184925Z"},"content_sha256":"52d4f1c779e9fdc4831c7c9d26c18f0e0ba870fc914482f714a8345ae5a76388","schema_version":"1.0","event_id":"sha256:52d4f1c779e9fdc4831c7c9d26c18f0e0ba870fc914482f714a8345ae5a76388"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERMKGO5ZDLU4CKYGHBIYMSWUJB/bundle.json","state_url":"https://pith.science/pith/ERMKGO5ZDLU4CKYGHBIYMSWUJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERMKGO5ZDLU4CKYGHBIYMSWUJB/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-31T23:55:33Z","links":{"resolver":"https://pith.science/pith/ERMKGO5ZDLU4CKYGHBIYMSWUJB","bundle":"https://pith.science/pith/ERMKGO5ZDLU4CKYGHBIYMSWUJB/bundle.json","state":"https://pith.science/pith/ERMKGO5ZDLU4CKYGHBIYMSWUJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERMKGO5ZDLU4CKYGHBIYMSWUJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ERMKGO5ZDLU4CKYGHBIYMSWUJB","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":"dd0860d220553834a6a012699537d2480f6f2acadd644349e261895807828e57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-09T23:50:10Z","title_canon_sha256":"bfb232ec62675d7912569ea6df7d6c2c47f5abd4fee56cceb72aba146b33ba44"},"schema_version":"1.0","source":{"id":"1011.2235","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2235","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2235v3","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2235","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"ERMKGO5ZDLU4","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ERMKGO5ZDLU4CKYG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ERMKGO5Z","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:52d4f1c779e9fdc4831c7c9d26c18f0e0ba870fc914482f714a8345ae5a76388","target":"graph","created_at":"2026-05-18T04:01:23Z","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 describes and analyzes a hierarchical gossip algorithm for solving the distributed average consensus problem in wireless sensor networks. The network is recursively partitioned into subnetworks. Initially, nodes at the finest scale gossip to compute local averages. Then, using geographic routing to enable gossip between nodes that are not directly connected, these local averages are progressively fused up the hierarchy until the global average is computed. We show that the proposed hierarchical scheme with $k$ levels of hierarchy is competitive with state-of-the-art randomized gossi","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-09T23:50:10Z","title":"Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2235","kind":"arxiv","version":3},"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:ab0dc6238dac20d78d0bc856a277719c5d768b6b74dad3c445189fdf0f9ac8f8","target":"record","created_at":"2026-05-18T04:01:23Z","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":"dd0860d220553834a6a012699537d2480f6f2acadd644349e261895807828e57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-09T23:50:10Z","title_canon_sha256":"bfb232ec62675d7912569ea6df7d6c2c47f5abd4fee56cceb72aba146b33ba44"},"schema_version":"1.0","source":{"id":"1011.2235","kind":"arxiv","version":3}},"canonical_sha256":"2458a33bb91ae9c12b063851864ad4485c313499b906a4b3b4c210678c11f991","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2458a33bb91ae9c12b063851864ad4485c313499b906a4b3b4c210678c11f991","first_computed_at":"2026-05-18T04:01:23.815127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:23.815127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4W9uHwqymor/BGK0aHzRaJrsr08HfNsJUbpiCtN8IM6HkGP0JnMZqcI6oK5YNuX4e3Ce3vETTUGpIQLNaxoBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:23.815778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2235","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab0dc6238dac20d78d0bc856a277719c5d768b6b74dad3c445189fdf0f9ac8f8","sha256:52d4f1c779e9fdc4831c7c9d26c18f0e0ba870fc914482f714a8345ae5a76388"],"state_sha256":"44dda4dd8b27ad244519ebb689e933358b462fa5bf19750180163c6b94596334"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tupEykC6yMHxDJKnJPeSSWxoPKAgGq7qJ57kPirsFAUkIL5Bh+BkL/HlPnS6I82e7J2mYUloG+bTD1HR1JKXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:55:33.188873Z","bundle_sha256":"9f6a55ca0166dc388a6cd85484184cce8a285771c5ed8380b0f196f03ef9ef18"}}