{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KQQPR4QAV6WCHSCOCGDRQTDGNO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dcc720e0775cdc22de7387d86223291a5bde7b9cd7cbaace70e066bc0f69f8f9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T13:22:47Z","title_canon_sha256":"682c67f3b786b32ac990a75198789e78a516bddd4515eb7bbc7ff5c9f7b94b40"},"schema_version":"1.0","source":{"id":"1304.1359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1359","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1359v2","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1359","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"pith_short_12","alias_value":"KQQPR4QAV6WC","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KQQPR4QAV6WCHSCO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KQQPR4QA","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:2050ff0016eae6811cb7f26a0378d37fa8e4db035623c41506f739e8fc1161c4","target":"graph","created_at":"2026-05-18T03:07:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"He Sun, Zeyu Guo","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T13:22:47Z","title":"Randomness-Efficient Rumor Spreading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1359","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0cc532a3db7bc818de770cd49c9fba8d7fe30bcb3b79942ff02b987779095c1b","target":"record","created_at":"2026-05-18T03:07:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dcc720e0775cdc22de7387d86223291a5bde7b9cd7cbaace70e066bc0f69f8f9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T13:22:47Z","title_canon_sha256":"682c67f3b786b32ac990a75198789e78a516bddd4515eb7bbc7ff5c9f7b94b40"},"schema_version":"1.0","source":{"id":"1304.1359","kind":"arxiv","version":2}},"canonical_sha256":"5420f8f200afac23c84e1187184c666b9312215a8571e8b9ab7c481c9264e445","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5420f8f200afac23c84e1187184c666b9312215a8571e8b9ab7c481c9264e445","first_computed_at":"2026-05-18T03:07:23.539371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:23.539371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IWNSoSvZ2HD/Z0jYBvg0GK+bJX6hlnHrB+geXZtdHOQcVEOvhrbpZpkq24e8gCHvKHSku/9Ble87Rg9y15vCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:23.539793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cc532a3db7bc818de770cd49c9fba8d7fe30bcb3b79942ff02b987779095c1b","sha256:2050ff0016eae6811cb7f26a0378d37fa8e4db035623c41506f739e8fc1161c4"],"state_sha256":"1045ca03c53f621588dc3b34681dd06bc0f86bb95b9f0a2f369ce84c05db7910"}