{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JSEH7MSAS4TSMQXKZDICHLBMGP","short_pith_number":"pith:JSEH7MSA","schema_version":"1.0","canonical_sha256":"4c887fb24097272642eac8d023ac2c33c72707ba6cf4d0259637321522032aae","source":{"kind":"arxiv","id":"1012.5357","version":1},"attestation_state":"computed","paper":{"title":"Quasirandom Rumor Spreading: An Experimental Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Marvin K\\\"unnemann, Thomas Sauerwald, Tobias Friedrich","submitted_at":"2010-12-24T07:54:02Z","abstract_excerpt":"We empirically analyze two versions of the well-known \"randomized rumor spreading\" protocol to disseminate a piece of information in networks. In the classical model, in each round each informed node informs a random neighbor. In the recently proposed quasirandom variant, each node has a (cyclic) list of its neighbors. Once informed, it starts at a random position of the list, but from then on informs its neighbors in the order of the list. While for sparse random graphs a better performance of the quasirandom model could be proven, all other results show that, independent of the structure of "},"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":"1012.5357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-24T07:54:02Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c7ff07e13cbdda8b239c5219382ea15e685cfa0afd05c3316877d90b00464207","abstract_canon_sha256":"e8dbe82aef2286c8761979fb972291c72b8cf79fc9961d1d0aace6ee5eda44c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:06.421480Z","signature_b64":"2d4OWCNUwmJKqh8H/iXX68i2HCPKfqVzQe+/GA/tK1p+MKsGjwxXRra8rkmGPOXkKtlEq8RED5aItDdDtom/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c887fb24097272642eac8d023ac2c33c72707ba6cf4d0259637321522032aae","last_reissued_at":"2026-05-18T02:23:06.420849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:06.420849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasirandom Rumor Spreading: An Experimental Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Marvin K\\\"unnemann, Thomas Sauerwald, Tobias Friedrich","submitted_at":"2010-12-24T07:54:02Z","abstract_excerpt":"We empirically analyze two versions of the well-known \"randomized rumor spreading\" protocol to disseminate a piece of information in networks. In the classical model, in each round each informed node informs a random neighbor. In the recently proposed quasirandom variant, each node has a (cyclic) list of its neighbors. Once informed, it starts at a random position of the list, but from then on informs its neighbors in the order of the list. While for sparse random graphs a better performance of the quasirandom model could be proven, all other results show that, independent of the structure of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5357","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":"1012.5357","created_at":"2026-05-18T02:23:06.420959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5357v1","created_at":"2026-05-18T02:23:06.420959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5357","created_at":"2026-05-18T02:23:06.420959+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSEH7MSAS4TS","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSEH7MSAS4TSMQXK","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSEH7MSA","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/JSEH7MSAS4TSMQXKZDICHLBMGP","json":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP.json","graph_json":"https://pith.science/api/pith-number/JSEH7MSAS4TSMQXKZDICHLBMGP/graph.json","events_json":"https://pith.science/api/pith-number/JSEH7MSAS4TSMQXKZDICHLBMGP/events.json","paper":"https://pith.science/paper/JSEH7MSA"},"agent_actions":{"view_html":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP","download_json":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP.json","view_paper":"https://pith.science/paper/JSEH7MSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5357&json=true","fetch_graph":"https://pith.science/api/pith-number/JSEH7MSAS4TSMQXKZDICHLBMGP/graph.json","fetch_events":"https://pith.science/api/pith-number/JSEH7MSAS4TSMQXKZDICHLBMGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP/action/storage_attestation","attest_author":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP/action/author_attestation","sign_citation":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP/action/citation_signature","submit_replication":"https://pith.science/pith/JSEH7MSAS4TSMQXKZDICHLBMGP/action/replication_record"}},"created_at":"2026-05-18T02:23:06.420959+00:00","updated_at":"2026-05-18T02:23:06.420959+00:00"}