{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IJL3IPPYFWB6FTHUICBNVVAJ3D","short_pith_number":"pith:IJL3IPPY","schema_version":"1.0","canonical_sha256":"4257b43df82d83e2ccf44082dad409d8d86fd734efdef54ad77994c5fbe9c8b1","source":{"kind":"arxiv","id":"1001.3056","version":4},"attestation_state":"computed","paper":{"title":"Strong Robustness of Randomized Rumor Spreading Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anna Huber, Ariel Levavi, Benjamin Doerr","submitted_at":"2010-01-18T13:30:10Z","abstract_excerpt":"Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission failures?\n  In this paper, we present a result precise up to $(1 \\pm o(1))$ factors. We limit ourselves to the network in which every two vertices are connected by a direct link. Run-times accurate to the"},"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":"1001.3056","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-01-18T13:30:10Z","cross_cats_sorted":[],"title_canon_sha256":"06db9478fd1b53c58c233d02bf5331067ee6ac74fcc2dbcd98bf8004e30830ef","abstract_canon_sha256":"cc9bba87bd64c69e34d08d7c4aa625dd186325aa9382f662f9c5d7707ef40589"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.040540Z","signature_b64":"FVg/uA5+3TgSYo5G+jQsXv9/EMlmStgXsnABuVmGwSCdDkOjYBO1EyNr5mrl+oyhvOwNU5K10ZeUizJvGxIgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4257b43df82d83e2ccf44082dad409d8d86fd734efdef54ad77994c5fbe9c8b1","last_reissued_at":"2026-05-18T03:25:26.040112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.040112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Robustness of Randomized Rumor Spreading Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anna Huber, Ariel Levavi, Benjamin Doerr","submitted_at":"2010-01-18T13:30:10Z","abstract_excerpt":"Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission failures?\n  In this paper, we present a result precise up to $(1 \\pm o(1))$ factors. We limit ourselves to the network in which every two vertices are connected by a direct link. Run-times accurate to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3056","kind":"arxiv","version":4},"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":"1001.3056","created_at":"2026-05-18T03:25:26.040166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.3056v4","created_at":"2026-05-18T03:25:26.040166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3056","created_at":"2026-05-18T03:25:26.040166+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJL3IPPYFWB6","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJL3IPPYFWB6FTHU","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJL3IPPY","created_at":"2026-05-18T12:26:09.077623+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/IJL3IPPYFWB6FTHUICBNVVAJ3D","json":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D.json","graph_json":"https://pith.science/api/pith-number/IJL3IPPYFWB6FTHUICBNVVAJ3D/graph.json","events_json":"https://pith.science/api/pith-number/IJL3IPPYFWB6FTHUICBNVVAJ3D/events.json","paper":"https://pith.science/paper/IJL3IPPY"},"agent_actions":{"view_html":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D","download_json":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D.json","view_paper":"https://pith.science/paper/IJL3IPPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.3056&json=true","fetch_graph":"https://pith.science/api/pith-number/IJL3IPPYFWB6FTHUICBNVVAJ3D/graph.json","fetch_events":"https://pith.science/api/pith-number/IJL3IPPYFWB6FTHUICBNVVAJ3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D/action/storage_attestation","attest_author":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D/action/author_attestation","sign_citation":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D/action/citation_signature","submit_replication":"https://pith.science/pith/IJL3IPPYFWB6FTHUICBNVVAJ3D/action/replication_record"}},"created_at":"2026-05-18T03:25:26.040166+00:00","updated_at":"2026-05-18T03:25:26.040166+00:00"}