{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:GUEM6JCHSVEJR7ZZP5CDCWEHCB","short_pith_number":"pith:GUEM6JCH","canonical_record":{"source":{"id":"0810.2513","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-10-14T18:24:52Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"227363e3a31e1a938d5d5f33f7f5b5a771390a6c9355bf1935b7ed62a76ff66c","abstract_canon_sha256":"b4438e322333440eb899734fb8d860f3b899528d79515f3de5fac6bb4d0e3952"},"schema_version":"1.0"},"canonical_sha256":"3508cf2447954898ff397f443158871045fd0ff4c79b7e97544e5f623d9a7559","source":{"kind":"arxiv","id":"0810.2513","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.2513","created_at":"2026-05-18T04:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"0810.2513v3","created_at":"2026-05-18T04:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2513","created_at":"2026-05-18T04:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"GUEM6JCHSVEJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GUEM6JCHSVEJR7ZZ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GUEM6JCH","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:GUEM6JCHSVEJR7ZZP5CDCWEHCB","target":"record","payload":{"canonical_record":{"source":{"id":"0810.2513","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-10-14T18:24:52Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"227363e3a31e1a938d5d5f33f7f5b5a771390a6c9355bf1935b7ed62a76ff66c","abstract_canon_sha256":"b4438e322333440eb899734fb8d860f3b899528d79515f3de5fac6bb4d0e3952"},"schema_version":"1.0"},"canonical_sha256":"3508cf2447954898ff397f443158871045fd0ff4c79b7e97544e5f623d9a7559","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:41.400143Z","signature_b64":"iHRofqUObRFyCRkgUB8AnnK7Xbv2juRRRhBEu5oSEbNNqht12yGDsnvoySjdwguj73g81a5M88y2bZiJe+RSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3508cf2447954898ff397f443158871045fd0ff4c79b7e97544e5f623d9a7559","last_reissued_at":"2026-05-18T04:19:41.399493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:41.399493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.2513","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:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfoSpsclW8cL6kC/f6Vo/6/0gOwNpmEBtdBs1wZpgm/uNJ6NN58iaHv/q7pTQd9KelE1Cl8ghT3UM7kOlyubBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:36:42.028459Z"},"content_sha256":"a72a50a4c1e99ff9be1ae1726222f104811a35aee080ab2688b81f565fd9c6db","schema_version":"1.0","event_id":"sha256:a72a50a4c1e99ff9be1ae1726222f104811a35aee080ab2688b81f565fd9c6db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:GUEM6JCHSVEJR7ZZP5CDCWEHCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Impact of Mobility on Gossip Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Alexandros G. Dimakis, Anand D. Sarwate","submitted_at":"2008-10-14T18:24:52Z","abstract_excerpt":"The influence of node mobility on the convergence time of averaging gossip algorithms in networks is studied. It is shown that a small number of fully mobile nodes can yield a significant decrease in convergence time. A method is developed for deriving lower bounds on the convergence time by merging nodes according to their mobility pattern. This method is used to show that if the agents have one-dimensional mobility in the same direction the convergence time is improved by at most a constant. Upper bounds are obtained on the convergence time using techniques from the theory of Markov chains a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.2513","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:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhsy3kXbaZ2YbmrXdF5A5UCw0pHdMehzoGFDEhYSa40ASdFzpfzhjgI0ZFbcLaDANCaRfOMpl+uonNAh0w65AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:36:42.028924Z"},"content_sha256":"d6a03e5bac096123744962a87aa717c5981d6cdc08f1a51788af312f7ba9bf97","schema_version":"1.0","event_id":"sha256:d6a03e5bac096123744962a87aa717c5981d6cdc08f1a51788af312f7ba9bf97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUEM6JCHSVEJR7ZZP5CDCWEHCB/bundle.json","state_url":"https://pith.science/pith/GUEM6JCHSVEJR7ZZP5CDCWEHCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUEM6JCHSVEJR7ZZP5CDCWEHCB/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-05T05:36:42Z","links":{"resolver":"https://pith.science/pith/GUEM6JCHSVEJR7ZZP5CDCWEHCB","bundle":"https://pith.science/pith/GUEM6JCHSVEJR7ZZP5CDCWEHCB/bundle.json","state":"https://pith.science/pith/GUEM6JCHSVEJR7ZZP5CDCWEHCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUEM6JCHSVEJR7ZZP5CDCWEHCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:GUEM6JCHSVEJR7ZZP5CDCWEHCB","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":"b4438e322333440eb899734fb8d860f3b899528d79515f3de5fac6bb4d0e3952","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-10-14T18:24:52Z","title_canon_sha256":"227363e3a31e1a938d5d5f33f7f5b5a771390a6c9355bf1935b7ed62a76ff66c"},"schema_version":"1.0","source":{"id":"0810.2513","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.2513","created_at":"2026-05-18T04:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"0810.2513v3","created_at":"2026-05-18T04:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2513","created_at":"2026-05-18T04:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"GUEM6JCHSVEJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GUEM6JCHSVEJR7ZZ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GUEM6JCH","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:d6a03e5bac096123744962a87aa717c5981d6cdc08f1a51788af312f7ba9bf97","target":"graph","created_at":"2026-05-18T04:19:41Z","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":"The influence of node mobility on the convergence time of averaging gossip algorithms in networks is studied. It is shown that a small number of fully mobile nodes can yield a significant decrease in convergence time. A method is developed for deriving lower bounds on the convergence time by merging nodes according to their mobility pattern. This method is used to show that if the agents have one-dimensional mobility in the same direction the convergence time is improved by at most a constant. Upper bounds are obtained on the convergence time using techniques from the theory of Markov chains a","authors_text":"Alexandros G. Dimakis, Anand D. Sarwate","cross_cats":["cs.DC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-10-14T18:24:52Z","title":"The Impact of Mobility on Gossip Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.2513","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:a72a50a4c1e99ff9be1ae1726222f104811a35aee080ab2688b81f565fd9c6db","target":"record","created_at":"2026-05-18T04:19:41Z","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":"b4438e322333440eb899734fb8d860f3b899528d79515f3de5fac6bb4d0e3952","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-10-14T18:24:52Z","title_canon_sha256":"227363e3a31e1a938d5d5f33f7f5b5a771390a6c9355bf1935b7ed62a76ff66c"},"schema_version":"1.0","source":{"id":"0810.2513","kind":"arxiv","version":3}},"canonical_sha256":"3508cf2447954898ff397f443158871045fd0ff4c79b7e97544e5f623d9a7559","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3508cf2447954898ff397f443158871045fd0ff4c79b7e97544e5f623d9a7559","first_computed_at":"2026-05-18T04:19:41.399493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:41.399493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iHRofqUObRFyCRkgUB8AnnK7Xbv2juRRRhBEu5oSEbNNqht12yGDsnvoySjdwguj73g81a5M88y2bZiJe+RSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:41.400143Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.2513","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a72a50a4c1e99ff9be1ae1726222f104811a35aee080ab2688b81f565fd9c6db","sha256:d6a03e5bac096123744962a87aa717c5981d6cdc08f1a51788af312f7ba9bf97"],"state_sha256":"6bef8dfe519e54a71c0a39b61c566e4face5a70c23ab983fc2cfd8793dc40de4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eayqE6PGTzU+kHF/xz6PBKoHJfBxB/1kyBDtn4HlZULeGD8Z0V8J3cSZpmiDlhjjl/UmNiQzkTqd9YNWpj9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:36:42.032649Z","bundle_sha256":"996bc2404f68c2a02ab3e13e303a16bf4abaa3a44ddd3ccf5b9c02bc37afd5f9"}}