{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QWRGQPNATI5K3Q5KQGZYYLTPUG","short_pith_number":"pith:QWRGQPNA","schema_version":"1.0","canonical_sha256":"85a2683da09a3aadc3aa81b38c2e6fa18b61bfcf7f88bbbc3308e20404dbbce5","source":{"kind":"arxiv","id":"1206.0992","version":6},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.0992","created_at":"2026-05-18T00:57:56.922567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0992v6","created_at":"2026-05-18T00:57:56.922567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0992","created_at":"2026-05-18T00:57:56.922567+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWRGQPNATI5K","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWRGQPNATI5K3Q5K","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWRGQPNA","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG","json":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG.json","graph_json":"https://pith.science/api/pith-number/QWRGQPNATI5K3Q5KQGZYYLTPUG/graph.json","events_json":"https://pith.science/api/pith-number/QWRGQPNATI5K3Q5KQGZYYLTPUG/events.json","paper":"https://pith.science/paper/QWRGQPNA"},"agent_actions":{"view_html":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG","download_json":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG.json","view_paper":"https://pith.science/paper/QWRGQPNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0992&json=true","fetch_graph":"https://pith.science/api/pith-number/QWRGQPNATI5K3Q5KQGZYYLTPUG/graph.json","fetch_events":"https://pith.science/api/pith-number/QWRGQPNATI5K3Q5KQGZYYLTPUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/action/storage_attestation","attest_author":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/action/author_attestation","sign_citation":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/action/citation_signature","submit_replication":"https://pith.science/pith/QWRGQPNATI5K3Q5KQGZYYLTPUG/action/replication_record"}},"created_at":"2026-05-18T00:57:56.922567+00:00","updated_at":"2026-05-18T00:57:56.922567+00:00"}