{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NHWNRYBJLKYMPUH7VKQ7WRXTSX","short_pith_number":"pith:NHWNRYBJ","schema_version":"1.0","canonical_sha256":"69ecd8e0295ab0c7d0ffaaa1fb46f395ccab367efd64b1d97462b340c9598740","source":{"kind":"arxiv","id":"1512.03022","version":1},"attestation_state":"computed","paper":{"title":"Breaking the log n barrier on rumor spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chen Avin, Robert Els\\\"asser","submitted_at":"2015-12-08T16:56:19Z","abstract_excerpt":"$O(\\log n)$ rounds has been a well known upper bound for rumor spreading using push&pull in the random phone call model (i.e., uniform gossip in the complete graph). A matching lower bound of $\\Omega(\\log n)$ is also known for this special case. Under the assumption of this model and with a natural addition that nodes can call a partner once they learn its address (e.g., its IP address) we present a new distributed, address-oblivious and robust algorithm that uses push&pull with pointer jumping to spread a rumor to all nodes in only $O(\\sqrt{\\log n})$ rounds, w.h.p. This algorithm can also cop"},"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":"1512.03022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-08T16:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"3b253dc239724096262e420b8e757a0b6ff6f22edee002b2081f8f2e29642d92","abstract_canon_sha256":"6bebdaa38684cded05373cfe1ff8b83acdc50acc605818d62af6d008d08b06de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:39.030479Z","signature_b64":"sIMc5i3qWG0KMbE2t0TqMZs3Fkj1qqTW8KHjxTMFknWhgc+ZnYwh086g09ON2CpYsb/ltE5MBBWmnL1KrvX6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69ecd8e0295ab0c7d0ffaaa1fb46f395ccab367efd64b1d97462b340c9598740","last_reissued_at":"2026-05-18T01:24:39.030104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:39.030104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the log n barrier on rumor spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chen Avin, Robert Els\\\"asser","submitted_at":"2015-12-08T16:56:19Z","abstract_excerpt":"$O(\\log n)$ rounds has been a well known upper bound for rumor spreading using push&pull in the random phone call model (i.e., uniform gossip in the complete graph). A matching lower bound of $\\Omega(\\log n)$ is also known for this special case. Under the assumption of this model and with a natural addition that nodes can call a partner once they learn its address (e.g., its IP address) we present a new distributed, address-oblivious and robust algorithm that uses push&pull with pointer jumping to spread a rumor to all nodes in only $O(\\sqrt{\\log n})$ rounds, w.h.p. This algorithm can also cop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03022","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":"1512.03022","created_at":"2026-05-18T01:24:39.030161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03022v1","created_at":"2026-05-18T01:24:39.030161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03022","created_at":"2026-05-18T01:24:39.030161+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHWNRYBJLKYM","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHWNRYBJLKYMPUH7","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHWNRYBJ","created_at":"2026-05-18T12:29:32.376354+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/NHWNRYBJLKYMPUH7VKQ7WRXTSX","json":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX.json","graph_json":"https://pith.science/api/pith-number/NHWNRYBJLKYMPUH7VKQ7WRXTSX/graph.json","events_json":"https://pith.science/api/pith-number/NHWNRYBJLKYMPUH7VKQ7WRXTSX/events.json","paper":"https://pith.science/paper/NHWNRYBJ"},"agent_actions":{"view_html":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX","download_json":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX.json","view_paper":"https://pith.science/paper/NHWNRYBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03022&json=true","fetch_graph":"https://pith.science/api/pith-number/NHWNRYBJLKYMPUH7VKQ7WRXTSX/graph.json","fetch_events":"https://pith.science/api/pith-number/NHWNRYBJLKYMPUH7VKQ7WRXTSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX/action/storage_attestation","attest_author":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX/action/author_attestation","sign_citation":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX/action/citation_signature","submit_replication":"https://pith.science/pith/NHWNRYBJLKYMPUH7VKQ7WRXTSX/action/replication_record"}},"created_at":"2026-05-18T01:24:39.030161+00:00","updated_at":"2026-05-18T01:24:39.030161+00:00"}