{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZCN52VOPL2ZCC3CS4CE4KLSGHD","short_pith_number":"pith:ZCN52VOP","schema_version":"1.0","canonical_sha256":"c89bdd55cf5eb2216c52e089c52e4638c29926754a8478aa37d50144205119ed","source":{"kind":"arxiv","id":"1709.00198","version":1},"attestation_state":"computed","paper":{"title":"Optimal epidemic dissemination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hugues Mercier, Laurent Hayez, Miguel Matos","submitted_at":"2017-09-01T08:44:41Z","abstract_excerpt":"We consider the problem of reliable epidemic dissemination of a rumor in a fully connected network of~$n$ processes using push and pull operations. We revisit the random phone call model and show that it is possible to disseminate a rumor to all processes with high probability using $\\Theta(\\ln n)$ rounds of communication and only $n+o(n)$ messages of size $b$, all of which are asymptotically optimal and achievable with pull and push-then-pull algorithms. This contradicts two highly-cited lower bounds of Karp et al. stating that any algorithm in the random phone call model running in $\\mathcal"},"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":"1709.00198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-01T08:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"8496f8a423d9bac574fcf6bf9fd8bf30e9c7c66f87cf2d7601b84c1c43761bee","abstract_canon_sha256":"7ee6b26de38d37a51a5187e02797b07a5267c7e555d0a2e1203e526448b24024"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:13.106299Z","signature_b64":"pjYpt+qNkO/2lHVBUp3I+c6JwRA/lsbKdmN2NYw07nYP6ie8DDu0iEn6vXQKMfP5uNFz5mBN7k6zuJ5ceU1/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c89bdd55cf5eb2216c52e089c52e4638c29926754a8478aa37d50144205119ed","last_reissued_at":"2026-05-18T00:36:13.105769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:13.105769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal epidemic dissemination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hugues Mercier, Laurent Hayez, Miguel Matos","submitted_at":"2017-09-01T08:44:41Z","abstract_excerpt":"We consider the problem of reliable epidemic dissemination of a rumor in a fully connected network of~$n$ processes using push and pull operations. We revisit the random phone call model and show that it is possible to disseminate a rumor to all processes with high probability using $\\Theta(\\ln n)$ rounds of communication and only $n+o(n)$ messages of size $b$, all of which are asymptotically optimal and achievable with pull and push-then-pull algorithms. This contradicts two highly-cited lower bounds of Karp et al. stating that any algorithm in the random phone call model running in $\\mathcal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00198","kind":"arxiv","version":1},"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":"1709.00198","created_at":"2026-05-18T00:36:13.105854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00198v1","created_at":"2026-05-18T00:36:13.105854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00198","created_at":"2026-05-18T00:36:13.105854+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCN52VOPL2ZC","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCN52VOPL2ZCC3CS","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCN52VOP","created_at":"2026-05-18T12:31:59.375834+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/ZCN52VOPL2ZCC3CS4CE4KLSGHD","json":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD.json","graph_json":"https://pith.science/api/pith-number/ZCN52VOPL2ZCC3CS4CE4KLSGHD/graph.json","events_json":"https://pith.science/api/pith-number/ZCN52VOPL2ZCC3CS4CE4KLSGHD/events.json","paper":"https://pith.science/paper/ZCN52VOP"},"agent_actions":{"view_html":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD","download_json":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD.json","view_paper":"https://pith.science/paper/ZCN52VOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00198&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCN52VOPL2ZCC3CS4CE4KLSGHD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCN52VOPL2ZCC3CS4CE4KLSGHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD/action/storage_attestation","attest_author":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD/action/author_attestation","sign_citation":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD/action/citation_signature","submit_replication":"https://pith.science/pith/ZCN52VOPL2ZCC3CS4CE4KLSGHD/action/replication_record"}},"created_at":"2026-05-18T00:36:13.105854+00:00","updated_at":"2026-05-18T00:36:13.105854+00:00"}