{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5AOECL6O2M6HG5UY5GGR2M7S55","short_pith_number":"pith:5AOECL6O","schema_version":"1.0","canonical_sha256":"e81c412fced33c737698e98d1d33f2ef7830d6cee4bdbf606934aa47d2b1e429","source":{"kind":"arxiv","id":"1310.6119","version":3},"attestation_state":"computed","paper":{"title":"Asynchronous Rumour Spreading in Social and Signed Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christos Patsonakis, Mema Roussopoulos","submitted_at":"2013-10-23T06:12:54Z","abstract_excerpt":"In this paper, we present an experimental analysis of the asynchronous push & pull rumour spreading protocol. This protocol is, to date, the best-performing rumour spreading protocol for simple, scalable, and robust information dissemination in distributed systems. We analyse the effect that multiple parameters have on the protocol's performance, such as using memory to avoid contacting the same neighbor twice in a row, varying the stopping criteria used by nodes to decide when to stop spreading the rumour, employing more sophisticated neighbor selection policies instead of the standard unifor"},"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":"1310.6119","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-10-23T06:12:54Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"d874be591649746a65699d13517a2c0c98ccf92d7f78e3cb7f4a8b7392738ffb","abstract_canon_sha256":"0d41a67f8247ecc317579eb510a2f6042b4325592d335c7382ce426ca6955c89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:23.572039Z","signature_b64":"Eiy1amRn5He6POvA7kDSaJaIW59fZ6B8l93IHOQUxQdbnzoxXAVJbact2TMTlF4JkUXut1gY5N7QRtYkKZumCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e81c412fced33c737698e98d1d33f2ef7830d6cee4bdbf606934aa47d2b1e429","last_reissued_at":"2026-05-18T02:29:23.571414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:23.571414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Rumour Spreading in Social and Signed Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christos Patsonakis, Mema Roussopoulos","submitted_at":"2013-10-23T06:12:54Z","abstract_excerpt":"In this paper, we present an experimental analysis of the asynchronous push & pull rumour spreading protocol. This protocol is, to date, the best-performing rumour spreading protocol for simple, scalable, and robust information dissemination in distributed systems. We analyse the effect that multiple parameters have on the protocol's performance, such as using memory to avoid contacting the same neighbor twice in a row, varying the stopping criteria used by nodes to decide when to stop spreading the rumour, employing more sophisticated neighbor selection policies instead of the standard unifor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6119","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.6119","created_at":"2026-05-18T02:29:23.571512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6119v3","created_at":"2026-05-18T02:29:23.571512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6119","created_at":"2026-05-18T02:29:23.571512+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AOECL6O2M6H","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AOECL6O2M6HG5UY","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AOECL6O","created_at":"2026-05-18T12:27:34.582898+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/5AOECL6O2M6HG5UY5GGR2M7S55","json":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55.json","graph_json":"https://pith.science/api/pith-number/5AOECL6O2M6HG5UY5GGR2M7S55/graph.json","events_json":"https://pith.science/api/pith-number/5AOECL6O2M6HG5UY5GGR2M7S55/events.json","paper":"https://pith.science/paper/5AOECL6O"},"agent_actions":{"view_html":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55","download_json":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55.json","view_paper":"https://pith.science/paper/5AOECL6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6119&json=true","fetch_graph":"https://pith.science/api/pith-number/5AOECL6O2M6HG5UY5GGR2M7S55/graph.json","fetch_events":"https://pith.science/api/pith-number/5AOECL6O2M6HG5UY5GGR2M7S55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55/action/storage_attestation","attest_author":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55/action/author_attestation","sign_citation":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55/action/citation_signature","submit_replication":"https://pith.science/pith/5AOECL6O2M6HG5UY5GGR2M7S55/action/replication_record"}},"created_at":"2026-05-18T02:29:23.571512+00:00","updated_at":"2026-05-18T02:29:23.571512+00:00"}