{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FUQ5J4Z6UQI7X7FPH4AMMCE56V","short_pith_number":"pith:FUQ5J4Z6","schema_version":"1.0","canonical_sha256":"2d21d4f33ea411fbfcaf3f00c6089df57753d2f0fa7176c48d0833cc6e35b794","source":{"kind":"arxiv","id":"1008.0501","version":1},"attestation_state":"computed","paper":{"title":"Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Mahmoud Fouz","submitted_at":"2010-08-03T09:59:29Z","abstract_excerpt":"We give a time-randomness tradeoff for the quasi-random rumor spreading protocol proposed by Doerr, Friedrich and Sauerwald [SODA 2008] on complete graphs. In this protocol, the goal is to spread a piece of information originating from one vertex throughout the network. Each vertex is assumed to have a (cyclic) list of its neighbors. Once a vertex is informed by one of its neighbors, it chooses a position in its list uniformly at random and then informs its neighbors starting from that position and proceeding in order of the list. Angelopoulos, Doerr, Huber and Panagiotou [Electron.~J.~Combin."},"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":"1008.0501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-03T09:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"19e39cd0a914d24a7a2c34d30e5ca948239088277db782954c3e10c4a4939b41","abstract_canon_sha256":"2f07e68cf349af333a6085eb8c8da0a3af141852399c2892815fa1c3806d362c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:42.879875Z","signature_b64":"2Xs+jwdxjawZIQzcAllamq40E0M9j1wDiLXxpIYAIGE33PtmaOllGIZ3gw9X7bMvnvTWlwSeaHJ/HjlbYmRtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d21d4f33ea411fbfcaf3f00c6089df57753d2f0fa7176c48d0833cc6e35b794","last_reissued_at":"2026-05-18T04:42:42.879397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:42.879397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Mahmoud Fouz","submitted_at":"2010-08-03T09:59:29Z","abstract_excerpt":"We give a time-randomness tradeoff for the quasi-random rumor spreading protocol proposed by Doerr, Friedrich and Sauerwald [SODA 2008] on complete graphs. In this protocol, the goal is to spread a piece of information originating from one vertex throughout the network. Each vertex is assumed to have a (cyclic) list of its neighbors. Once a vertex is informed by one of its neighbors, it chooses a position in its list uniformly at random and then informs its neighbors starting from that position and proceeding in order of the list. Angelopoulos, Doerr, Huber and Panagiotou [Electron.~J.~Combin."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0501","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":"1008.0501","created_at":"2026-05-18T04:42:42.879470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.0501v1","created_at":"2026-05-18T04:42:42.879470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0501","created_at":"2026-05-18T04:42:42.879470+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUQ5J4Z6UQI7","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUQ5J4Z6UQI7X7FP","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUQ5J4Z6","created_at":"2026-05-18T12:26:07.630475+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/FUQ5J4Z6UQI7X7FPH4AMMCE56V","json":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V.json","graph_json":"https://pith.science/api/pith-number/FUQ5J4Z6UQI7X7FPH4AMMCE56V/graph.json","events_json":"https://pith.science/api/pith-number/FUQ5J4Z6UQI7X7FPH4AMMCE56V/events.json","paper":"https://pith.science/paper/FUQ5J4Z6"},"agent_actions":{"view_html":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V","download_json":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V.json","view_paper":"https://pith.science/paper/FUQ5J4Z6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.0501&json=true","fetch_graph":"https://pith.science/api/pith-number/FUQ5J4Z6UQI7X7FPH4AMMCE56V/graph.json","fetch_events":"https://pith.science/api/pith-number/FUQ5J4Z6UQI7X7FPH4AMMCE56V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V/action/storage_attestation","attest_author":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V/action/author_attestation","sign_citation":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V/action/citation_signature","submit_replication":"https://pith.science/pith/FUQ5J4Z6UQI7X7FPH4AMMCE56V/action/replication_record"}},"created_at":"2026-05-18T04:42:42.879470+00:00","updated_at":"2026-05-18T04:42:42.879470+00:00"}