{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","short_pith_number":"pith:SV4W7IXL","schema_version":"1.0","canonical_sha256":"95796fa2eb5e60ae4f4905fb9cf2b28a5dd55fd39078796660278eb20a99a500","source":{"kind":"arxiv","id":"1411.0948","version":2},"attestation_state":"computed","paper":{"title":"On the push&pull protocol for rumour spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DC","authors_text":"Abbas Mehrabian, Andrea Collevecchio, Huseyin Acan, Nick Wormald","submitted_at":"2014-11-04T15:53:11Z","abstract_excerpt":"The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$ knows the rumour. Whenever the clock of a vertex $x$ rings, it calls a random neighbour $y$: if $x$ knows the rumour and $y$ does not, then $x$ tells $y$ the rumour (a push operation), and if $x$ does not know the rumour and $y$ knows it, $y$ tells $x$ the rumour (a pull operation). The average spread time of $G$ is the expected time it takes for all vertices to"},"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":"1411.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T15:53:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2b715eacff44c83453ac3e65bb6dccfd326e5356454aa4e26035a54eecab6a2b","abstract_canon_sha256":"8ed284dce33a8ad1ed23605d283ed9c5ec01b2c32e86502c7edf263a74258507"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:57.756990Z","signature_b64":"mLxZt9ZD9RdV1pDN/dLfLcYnX0FNgD71w+lSGboSP1arRo/v/NXIiqxisPF7XVNEkG77FMTXyBcLndfhLQ7XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95796fa2eb5e60ae4f4905fb9cf2b28a5dd55fd39078796660278eb20a99a500","last_reissued_at":"2026-05-18T01:32:57.756275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:57.756275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the push&pull protocol for rumour spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DC","authors_text":"Abbas Mehrabian, Andrea Collevecchio, Huseyin Acan, Nick Wormald","submitted_at":"2014-11-04T15:53:11Z","abstract_excerpt":"The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$ knows the rumour. Whenever the clock of a vertex $x$ rings, it calls a random neighbour $y$: if $x$ knows the rumour and $y$ does not, then $x$ tells $y$ the rumour (a push operation), and if $x$ does not know the rumour and $y$ knows it, $y$ tells $x$ the rumour (a pull operation). The average spread time of $G$ is the expected time it takes for all vertices to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0948","kind":"arxiv","version":2},"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":"1411.0948","created_at":"2026-05-18T01:32:57.756405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0948v2","created_at":"2026-05-18T01:32:57.756405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0948","created_at":"2026-05-18T01:32:57.756405+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV4W7IXLLZQK","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV4W7IXLLZQK4T2J","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV4W7IXL","created_at":"2026-05-18T12:28:49.207871+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/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","json":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ.json","graph_json":"https://pith.science/api/pith-number/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/graph.json","events_json":"https://pith.science/api/pith-number/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/events.json","paper":"https://pith.science/paper/SV4W7IXL"},"agent_actions":{"view_html":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","download_json":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ.json","view_paper":"https://pith.science/paper/SV4W7IXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0948&json=true","fetch_graph":"https://pith.science/api/pith-number/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/action/storage_attestation","attest_author":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/action/author_attestation","sign_citation":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/action/citation_signature","submit_replication":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/action/replication_record"}},"created_at":"2026-05-18T01:32:57.756405+00:00","updated_at":"2026-05-18T01:32:57.756405+00:00"}