{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JZHTPEDSMUKCTCZ4KOBNBBK5FT","short_pith_number":"pith:JZHTPEDS","schema_version":"1.0","canonical_sha256":"4e4f3790726514298b3c5382d0855d2cd33d98d96907ec6e08fa02943200532f","source":{"kind":"arxiv","id":"1311.2839","version":1},"attestation_state":"computed","paper":{"title":"Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.PR"],"primary_cat":"cs.DC","authors_text":"He Sun, Zeyu Guo","submitted_at":"2013-11-12T17:09:25Z","abstract_excerpt":"We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph $G$ with $n$ nodes such that, the protocol informs every node in $O(\\log n)$ rounds with high probability, and uses $\\tilde{O}(\\log n)$ random bits in total. The runtime of our protocol is tight, and the randomness requirement of $\\tilde{O}(\\log n)$ random bits almost matches the lower bound of $\\Omega(\\log n)$ random bits for dense graphs. We further show that, for many graph families, polylogarithmic number "},"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":"1311.2839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-12T17:09:25Z","cross_cats_sorted":["cs.CC","cs.DS","math.PR"],"title_canon_sha256":"f046da3965723130d16e71f417b6ba96297a791f335ed472cc911397aa2830fc","abstract_canon_sha256":"0d45eff649f58aee8d0fdbfd907724b8f80f79c122bba25371512b83881e21a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:13.653579Z","signature_b64":"NbVGgd6FnLvyUinXqZbqNDGz2h/zQWSVOUWxkfwPQ+TX+14HBwi2ow8MW9Csy/A97VX/BWbAy6M1UN/Tn9iBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e4f3790726514298b3c5382d0855d2cd33d98d96907ec6e08fa02943200532f","last_reissued_at":"2026-05-18T03:07:13.653026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:13.653026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.PR"],"primary_cat":"cs.DC","authors_text":"He Sun, Zeyu Guo","submitted_at":"2013-11-12T17:09:25Z","abstract_excerpt":"We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph $G$ with $n$ nodes such that, the protocol informs every node in $O(\\log n)$ rounds with high probability, and uses $\\tilde{O}(\\log n)$ random bits in total. The runtime of our protocol is tight, and the randomness requirement of $\\tilde{O}(\\log n)$ random bits almost matches the lower bound of $\\Omega(\\log n)$ random bits for dense graphs. We further show that, for many graph families, polylogarithmic number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2839","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":"1311.2839","created_at":"2026-05-18T03:07:13.653105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2839v1","created_at":"2026-05-18T03:07:13.653105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2839","created_at":"2026-05-18T03:07:13.653105+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZHTPEDSMUKC","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZHTPEDSMUKCTCZ4","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZHTPEDS","created_at":"2026-05-18T12:27:49.015174+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/JZHTPEDSMUKCTCZ4KOBNBBK5FT","json":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT.json","graph_json":"https://pith.science/api/pith-number/JZHTPEDSMUKCTCZ4KOBNBBK5FT/graph.json","events_json":"https://pith.science/api/pith-number/JZHTPEDSMUKCTCZ4KOBNBBK5FT/events.json","paper":"https://pith.science/paper/JZHTPEDS"},"agent_actions":{"view_html":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT","download_json":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT.json","view_paper":"https://pith.science/paper/JZHTPEDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2839&json=true","fetch_graph":"https://pith.science/api/pith-number/JZHTPEDSMUKCTCZ4KOBNBBK5FT/graph.json","fetch_events":"https://pith.science/api/pith-number/JZHTPEDSMUKCTCZ4KOBNBBK5FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT/action/storage_attestation","attest_author":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT/action/author_attestation","sign_citation":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT/action/citation_signature","submit_replication":"https://pith.science/pith/JZHTPEDSMUKCTCZ4KOBNBBK5FT/action/replication_record"}},"created_at":"2026-05-18T03:07:13.653105+00:00","updated_at":"2026-05-18T03:07:13.653105+00:00"}