{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KQQPR4QAV6WCHSCOCGDRQTDGNO","short_pith_number":"pith:KQQPR4QA","schema_version":"1.0","canonical_sha256":"5420f8f200afac23c84e1187184c666b9312215a8571e8b9ab7c481c9264e445","source":{"kind":"arxiv","id":"1304.1359","version":2},"attestation_state":"computed","paper":{"title":"Randomness-Efficient Rumor Spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"He Sun, Zeyu Guo","submitted_at":"2013-04-04T13:22:47Z","abstract_excerpt":"We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\\Theta(n)$ such that, the protocol informs every node in $O(\\log n)$ rounds with high probability, and uses $O(\\log n\\log\\log n)$ random bits in total. The runtime of our protocol is tight, and the randomness requirement of $O(\\log n\\log\\log n)$ random bits almost matches the lower bound of $\\Omega(\\log n)$ random bits. We further study rumor spreading protocols for more general grap"},"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":"1304.1359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T13:22:47Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"682c67f3b786b32ac990a75198789e78a516bddd4515eb7bbc7ff5c9f7b94b40","abstract_canon_sha256":"dcc720e0775cdc22de7387d86223291a5bde7b9cd7cbaace70e066bc0f69f8f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:23.539793Z","signature_b64":"IWNSoSvZ2HD/Z0jYBvg0GK+bJX6hlnHrB+geXZtdHOQcVEOvhrbpZpkq24e8gCHvKHSku/9Ble87Rg9y15vCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5420f8f200afac23c84e1187184c666b9312215a8571e8b9ab7c481c9264e445","last_reissued_at":"2026-05-18T03:07:23.539371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:23.539371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomness-Efficient Rumor Spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"He Sun, Zeyu Guo","submitted_at":"2013-04-04T13:22:47Z","abstract_excerpt":"We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\\Theta(n)$ such that, the protocol informs every node in $O(\\log n)$ rounds with high probability, and uses $O(\\log n\\log\\log n)$ random bits in total. The runtime of our protocol is tight, and the randomness requirement of $O(\\log n\\log\\log n)$ random bits almost matches the lower bound of $\\Omega(\\log n)$ random bits. We further study rumor spreading protocols for more general grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1359","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":"1304.1359","created_at":"2026-05-18T03:07:23.539430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1359v2","created_at":"2026-05-18T03:07:23.539430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1359","created_at":"2026-05-18T03:07:23.539430+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQQPR4QAV6WC","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQQPR4QAV6WCHSCO","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQQPR4QA","created_at":"2026-05-18T12:27:51.066281+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/KQQPR4QAV6WCHSCOCGDRQTDGNO","json":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO.json","graph_json":"https://pith.science/api/pith-number/KQQPR4QAV6WCHSCOCGDRQTDGNO/graph.json","events_json":"https://pith.science/api/pith-number/KQQPR4QAV6WCHSCOCGDRQTDGNO/events.json","paper":"https://pith.science/paper/KQQPR4QA"},"agent_actions":{"view_html":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO","download_json":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO.json","view_paper":"https://pith.science/paper/KQQPR4QA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1359&json=true","fetch_graph":"https://pith.science/api/pith-number/KQQPR4QAV6WCHSCOCGDRQTDGNO/graph.json","fetch_events":"https://pith.science/api/pith-number/KQQPR4QAV6WCHSCOCGDRQTDGNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO/action/storage_attestation","attest_author":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO/action/author_attestation","sign_citation":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO/action/citation_signature","submit_replication":"https://pith.science/pith/KQQPR4QAV6WCHSCOCGDRQTDGNO/action/replication_record"}},"created_at":"2026-05-18T03:07:23.539430+00:00","updated_at":"2026-05-18T03:07:23.539430+00:00"}