{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M4GG35CWU6UW5FLBMRLMSUAOS3","short_pith_number":"pith:M4GG35CW","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"},"canonical_sha256":"670c6df456a7a96e95616456c9500e96f4b52f2811aec9ae5ac19e66e58f3e5b","source":{"kind":"arxiv","id":"1404.0780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0780","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0780v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0780","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"M4GG35CWU6UW","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4GG35CWU6UW5FLB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4GG35CW","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M4GG35CWU6UW5FLBMRLMSUAOS3","target":"record","payload":{"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"},"canonical_sha256":"670c6df456a7a96e95616456c9500e96f4b52f2811aec9ae5ac19e66e58f3e5b","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"},"source_kind":"arxiv","source_id":"1404.0780","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsSXWA/lojAQ08QgidNvzypG+3kd585phdTx68SOmJX12ZgUekaBXrYDUy3zH7ZfZoOp/jCrW9Xjg27vasjABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:08.337472Z"},"content_sha256":"49966923cc4dba250165ff3a94b0817c1b77b3b5e724650f6221d8a7c4ca5ea8","schema_version":"1.0","event_id":"sha256:49966923cc4dba250165ff3a94b0817c1b77b3b5e724650f6221d8a7c4ca5ea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M4GG35CWU6UW5FLBMRLMSUAOS3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCMpASG6Kq0ulGp0CvIpWGy0IltfdyAkxfnd+wphWiUydvs/fVYylVeiSWuyhinFzRI9Yl0yMjsbEwTMXA7WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:08.337848Z"},"content_sha256":"346a84f5889a3f136b2c4eb08b8640c243beb01541bef28005bf4771fec3f7e7","schema_version":"1.0","event_id":"sha256:346a84f5889a3f136b2c4eb08b8640c243beb01541bef28005bf4771fec3f7e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/bundle.json","state_url":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T02:49:08Z","links":{"resolver":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3","bundle":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/bundle.json","state":"https://pith.science/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4GG35CWU6UW5FLBMRLMSUAOS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M4GG35CWU6UW5FLBMRLMSUAOS3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"db699b049566abcd92eccf685d7f3610980af1ae14c02d1efe7730e4bcb6ad93","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T07:07:56Z","title_canon_sha256":"0ef575acc23b92ed35dca52a3a62ed2f45a0869d30b9407f8f22ca9c41bf958d"},"schema_version":"1.0","source":{"id":"1404.0780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0780","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0780v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0780","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"M4GG35CWU6UW","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4GG35CWU6UW5FLB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4GG35CW","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:346a84f5889a3f136b2c4eb08b8640c243beb01541bef28005bf4771fec3f7e7","target":"graph","created_at":"2026-05-18T02:54:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Bernhard Haeupler, Majid Khabbazian, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T07:07:56Z","title":"Randomized Broadcast in Radio Networks with Collision Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0780","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:49966923cc4dba250165ff3a94b0817c1b77b3b5e724650f6221d8a7c4ca5ea8","target":"record","created_at":"2026-05-18T02:54:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"db699b049566abcd92eccf685d7f3610980af1ae14c02d1efe7730e4bcb6ad93","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T07:07:56Z","title_canon_sha256":"0ef575acc23b92ed35dca52a3a62ed2f45a0869d30b9407f8f22ca9c41bf958d"},"schema_version":"1.0","source":{"id":"1404.0780","kind":"arxiv","version":1}},"canonical_sha256":"670c6df456a7a96e95616456c9500e96f4b52f2811aec9ae5ac19e66e58f3e5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"670c6df456a7a96e95616456c9500e96f4b52f2811aec9ae5ac19e66e58f3e5b","first_computed_at":"2026-05-18T02:54:55.553960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:55.553960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZyrQk8SRAS2KpsuDoLm5og6GcE+MA/vgtYSri5R9KfHYYwtuwOTTLs1T06FmAZToC6cBB5mOXakrLi2DTDLfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:55.554448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49966923cc4dba250165ff3a94b0817c1b77b3b5e724650f6221d8a7c4ca5ea8","sha256:346a84f5889a3f136b2c4eb08b8640c243beb01541bef28005bf4771fec3f7e7"],"state_sha256":"e0e3f759e64860ed10c72ddc2ba6d4d1741afb0ec6b6d3a18b55887a49d66577"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0esFRXEIiMjMT4EAQrBo0z+1Fq08bLuUBhGcTMnlxHPk/auwFZltjIc7yTL81z48VTDzGB/MXc42Act6DqEYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:49:08.340291Z","bundle_sha256":"94740909e51e14d40fd671a1e0bb0b3ca5b9fde91e43a4e784df6a47dd4fda01"}}