{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QWRGQPNATI5K3Q5KQGZYYLTPUG","short_pith_number":"pith:QWRGQPNA","canonical_record":{"source":{"id":"1206.0992","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-05T17:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"262e4168e71a1dadf211f7081ce422244ae1d715284103af1924d7c651f488d7","abstract_canon_sha256":"96835117bff4efb6379ec6055d00b7570e087a1ed0bc6c5de69b3d5a4c7e115b"},"schema_version":"1.0"},"canonical_sha256":"85a2683da09a3aadc3aa81b38c2e6fa18b61bfcf7f88bbbc3308e20404dbbce5","source":{"kind":"arxiv","id":"1206.0992","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0992","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0992v6","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0992","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"QWRGQPNATI5K","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QWRGQPNATI5K3Q5K","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QWRGQPNA","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QWRGQPNATI5K3Q5KQGZYYLTPUG","target":"record","payload":{"canonical_record":{"source":{"id":"1206.0992","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-05T17:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"262e4168e71a1dadf211f7081ce422244ae1d715284103af1924d7c651f488d7","abstract_canon_sha256":"96835117bff4efb6379ec6055d00b7570e087a1ed0bc6c5de69b3d5a4c7e115b"},"schema_version":"1.0"},"canonical_sha256":"85a2683da09a3aadc3aa81b38c2e6fa18b61bfcf7f88bbbc3308e20404dbbce5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.923044Z","signature_b64":"lqXRoN8nDTrxklhnrm1gqALde+SW3dLXx1qJ3WUcEPaM3dWgRTXsXZbhSaDGevEaZU/Xpn5hMn0HdR4iF1ezBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85a2683da09a3aadc3aa81b38c2e6fa18b61bfcf7f88bbbc3308e20404dbbce5","last_reissued_at":"2026-05-18T00:57:56.922496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.922496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.0992","source_version":6,"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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4wu+x/o5SZ5fD9KBb7tAhbjO3j/BTA13mNyKj9+7sr7jJHLuYrVodjV0CjlCMLj/LhJfp+RBxd1udnwLZx6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:49:55.507043Z"},"content_sha256":"cbcab3f88de2bab0aac15766c6aef36505fdf759b8de478e0a9ce21b53473d8a","schema_version":"1.0","event_id":"sha256:cbcab3f88de2bab0aac15766c6aef36505fdf759b8de478e0a9ce21b53473d8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QWRGQPNATI5K3Q5KQGZYYLTPUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-time Convergent Gossiping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bo Li, Guodong Shi, Karl Henrik Johansson, Mikael Johansson","submitted_at":"2012-06-05T17:07:34Z","abstract_excerpt":"Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social networks. A tremendous research effort has been devoted to analyzing and improving the asymptotic rate of convergence for gossip algorithms. In this work we study finite-time convergence of deterministic gossiping. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists an asymmetric gossip algorithm with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0992","kind":"arxiv","version":6},"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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ExtB1IgiTTowysiE5HC9ld3MtOugxRiSB13lWBfWgd/+uxSERqKv//2lHXk9eqKrrQ4bVKjQGE6y8yyUbBKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:49:55.507464Z"},"content_sha256":"b376c75ffcf9a89748e9b2a7bc8f29d8dddbbe8a05c8c955cd0850f871d0fc4d","schema_version":"1.0","event_id":"sha256:b376c75ffcf9a89748e9b2a7bc8f29d8dddbbe8a05c8c955cd0850f871d0fc4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/bundle.json","state_url":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/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-27T19:49:55Z","links":{"resolver":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG","bundle":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/bundle.json","state":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QWRGQPNATI5K3Q5KQGZYYLTPUG","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":"96835117bff4efb6379ec6055d00b7570e087a1ed0bc6c5de69b3d5a4c7e115b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-05T17:07:34Z","title_canon_sha256":"262e4168e71a1dadf211f7081ce422244ae1d715284103af1924d7c651f488d7"},"schema_version":"1.0","source":{"id":"1206.0992","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0992","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0992v6","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0992","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"QWRGQPNATI5K","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QWRGQPNATI5K3Q5K","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QWRGQPNA","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:b376c75ffcf9a89748e9b2a7bc8f29d8dddbbe8a05c8c955cd0850f871d0fc4d","target":"graph","created_at":"2026-05-18T00:57:56Z","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 widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social networks. A tremendous research effort has been devoted to analyzing and improving the asymptotic rate of convergence for gossip algorithms. In this work we study finite-time convergence of deterministic gossiping. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists an asymmetric gossip algorithm with ","authors_text":"Bo Li, Guodong Shi, Karl Henrik Johansson, Mikael Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-05T17:07:34Z","title":"Finite-time Convergent Gossiping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0992","kind":"arxiv","version":6},"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:cbcab3f88de2bab0aac15766c6aef36505fdf759b8de478e0a9ce21b53473d8a","target":"record","created_at":"2026-05-18T00:57:56Z","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":"96835117bff4efb6379ec6055d00b7570e087a1ed0bc6c5de69b3d5a4c7e115b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-05T17:07:34Z","title_canon_sha256":"262e4168e71a1dadf211f7081ce422244ae1d715284103af1924d7c651f488d7"},"schema_version":"1.0","source":{"id":"1206.0992","kind":"arxiv","version":6}},"canonical_sha256":"85a2683da09a3aadc3aa81b38c2e6fa18b61bfcf7f88bbbc3308e20404dbbce5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85a2683da09a3aadc3aa81b38c2e6fa18b61bfcf7f88bbbc3308e20404dbbce5","first_computed_at":"2026-05-18T00:57:56.922496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.922496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lqXRoN8nDTrxklhnrm1gqALde+SW3dLXx1qJ3WUcEPaM3dWgRTXsXZbhSaDGevEaZU/Xpn5hMn0HdR4iF1ezBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.923044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0992","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbcab3f88de2bab0aac15766c6aef36505fdf759b8de478e0a9ce21b53473d8a","sha256:b376c75ffcf9a89748e9b2a7bc8f29d8dddbbe8a05c8c955cd0850f871d0fc4d"],"state_sha256":"8a1f20f55af3d7a47d2232f1fd9d30056200062c526bd2e69149b84b05a9d3f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdyNwqeCIrwv36FQhfD6xB/qCCDARsQBNl01KWlIrPd06+MzB9kQZpUrhxUExujgEZY/qAryLj9zYI8ty63fCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:49:55.510397Z","bundle_sha256":"1d815587a9a44e45d5974ec31b81cc3bc2f058d15f6c81f906056ec364256573"}}