{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F4SNCPOAAUSW5RUI4AAI76QTOT","short_pith_number":"pith:F4SNCPOA","schema_version":"1.0","canonical_sha256":"2f24d13dc005256ec688e0008ffa1374dd8aa0efdeeb1b78440a44d92aa631e7","source":{"kind":"arxiv","id":"1405.7300","version":1},"attestation_state":"computed","paper":{"title":"Radio Network Lower Bounds Made Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Calvin Newport","submitted_at":"2014-05-28T16:33:13Z","abstract_excerpt":"Theoreticians have studied distributed algorithms in the radio network model for close to three decades. A significant fraction of this work focuses on lower bounds for basic communication problems such as wake-up (symmetry breaking among an unknown set of nodes) and broadcast (message dissemination through an unknown network topology). In this paper, we introduce a new technique for proving this type of bound, based on reduction from a probabilistic hitting game, that simplifies and strengthens much of this existing work. In more detail, in this single paper we prove new expected time and hig"},"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":"1405.7300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-28T16:33:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d34b1c7acf99bee222f1280cad1202cf68076a1d1507b1de7b5f4efa6e04c8b9","abstract_canon_sha256":"196548d3ce6777d2ba459f424f600289468fa8a2cef87ead6fa260626329edf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:52.367255Z","signature_b64":"T/a4BD+O8DIyl1T8yjIuKzzEizUUQIvN8fPyp/cjFihxnHwdyZukJBV3NSdU3oCt0UXh9M44HVcWa6kPNs/rCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f24d13dc005256ec688e0008ffa1374dd8aa0efdeeb1b78440a44d92aa631e7","last_reissued_at":"2026-05-18T02:50:52.366786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:52.366786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Radio Network Lower Bounds Made Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Calvin Newport","submitted_at":"2014-05-28T16:33:13Z","abstract_excerpt":"Theoreticians have studied distributed algorithms in the radio network model for close to three decades. A significant fraction of this work focuses on lower bounds for basic communication problems such as wake-up (symmetry breaking among an unknown set of nodes) and broadcast (message dissemination through an unknown network topology). In this paper, we introduce a new technique for proving this type of bound, based on reduction from a probabilistic hitting game, that simplifies and strengthens much of this existing work. In more detail, in this single paper we prove new expected time and hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7300","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":"1405.7300","created_at":"2026-05-18T02:50:52.366863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7300v1","created_at":"2026-05-18T02:50:52.366863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7300","created_at":"2026-05-18T02:50:52.366863+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4SNCPOAAUSW","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4SNCPOAAUSW5RUI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4SNCPOA","created_at":"2026-05-18T12:28:28.263976+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/F4SNCPOAAUSW5RUI4AAI76QTOT","json":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT.json","graph_json":"https://pith.science/api/pith-number/F4SNCPOAAUSW5RUI4AAI76QTOT/graph.json","events_json":"https://pith.science/api/pith-number/F4SNCPOAAUSW5RUI4AAI76QTOT/events.json","paper":"https://pith.science/paper/F4SNCPOA"},"agent_actions":{"view_html":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT","download_json":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT.json","view_paper":"https://pith.science/paper/F4SNCPOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7300&json=true","fetch_graph":"https://pith.science/api/pith-number/F4SNCPOAAUSW5RUI4AAI76QTOT/graph.json","fetch_events":"https://pith.science/api/pith-number/F4SNCPOAAUSW5RUI4AAI76QTOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT/action/storage_attestation","attest_author":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT/action/author_attestation","sign_citation":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT/action/citation_signature","submit_replication":"https://pith.science/pith/F4SNCPOAAUSW5RUI4AAI76QTOT/action/replication_record"}},"created_at":"2026-05-18T02:50:52.366863+00:00","updated_at":"2026-05-18T02:50:52.366863+00:00"}