{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M4GG35CWU6UW5FLBMRLMSUAOS3","short_pith_number":"pith:M4GG35CW","schema_version":"1.0","canonical_sha256":"670c6df456a7a96e95616456c9500e96f4b52f2811aec9ae5ac19e66e58f3e5b","source":{"kind":"arxiv","id":"1404.0780","version":1},"attestation_state":"computed","paper":{"title":"Randomized Broadcast in Radio Networks with Collision Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Majid Khabbazian, Mohsen Ghaffari","submitted_at":"2014-04-03T07:07:56Z","abstract_excerpt":"We present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in $O(D + \\log^6 n)$ rounds, with high probability. This time complexity is most interesting because of its optimal additive dependence on the network diameter $D$. It improves over the currently best known $O(D\\log\\frac{n}{D}\\,+\\,\\log^2 n)$ algorithms, due to Czumaj and Rytter [FOCS 2003], and Kowalski and Pelc [PODC 2003]. These algorithms where designed for the model without collision detection and are optimal in that model. However, as explicitly stated by Peleg in his "},"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":"1404.0780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T07:07:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ef575acc23b92ed35dca52a3a62ed2f45a0869d30b9407f8f22ca9c41bf958d","abstract_canon_sha256":"db699b049566abcd92eccf685d7f3610980af1ae14c02d1efe7730e4bcb6ad93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:55.554448Z","signature_b64":"ZyrQk8SRAS2KpsuDoLm5og6GcE+MA/vgtYSri5R9KfHYYwtuwOTTLs1T06FmAZToC6cBB5mOXakrLi2DTDLfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670c6df456a7a96e95616456c9500e96f4b52f2811aec9ae5ac19e66e58f3e5b","last_reissued_at":"2026-05-18T02:54:55.553960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:55.553960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Broadcast in Radio Networks with Collision Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Majid Khabbazian, Mohsen Ghaffari","submitted_at":"2014-04-03T07:07:56Z","abstract_excerpt":"We present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in $O(D + \\log^6 n)$ rounds, with high probability. This time complexity is most interesting because of its optimal additive dependence on the network diameter $D$. It improves over the currently best known $O(D\\log\\frac{n}{D}\\,+\\,\\log^2 n)$ algorithms, due to Czumaj and Rytter [FOCS 2003], and Kowalski and Pelc [PODC 2003]. These algorithms where designed for the model without collision detection and are optimal in that model. However, as explicitly stated by Peleg in his "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0780","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":"1404.0780","created_at":"2026-05-18T02:54:55.554043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0780v1","created_at":"2026-05-18T02:54:55.554043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0780","created_at":"2026-05-18T02:54:55.554043+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4GG35CWU6UW","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4GG35CWU6UW5FLB","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4GG35CW","created_at":"2026-05-18T12:28:38.356838+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/M4GG35CWU6UW5FLBMRLMSUAOS3","json":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3.json","graph_json":"https://pith.science/api/pith-number/M4GG35CWU6UW5FLBMRLMSUAOS3/graph.json","events_json":"https://pith.science/api/pith-number/M4GG35CWU6UW5FLBMRLMSUAOS3/events.json","paper":"https://pith.science/paper/M4GG35CW"},"agent_actions":{"view_html":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3","download_json":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3.json","view_paper":"https://pith.science/paper/M4GG35CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0780&json=true","fetch_graph":"https://pith.science/api/pith-number/M4GG35CWU6UW5FLBMRLMSUAOS3/graph.json","fetch_events":"https://pith.science/api/pith-number/M4GG35CWU6UW5FLBMRLMSUAOS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/action/storage_attestation","attest_author":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/action/author_attestation","sign_citation":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/action/citation_signature","submit_replication":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/action/replication_record"}},"created_at":"2026-05-18T02:54:55.554043+00:00","updated_at":"2026-05-18T02:54:55.554043+00:00"}