{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JB22WONEGDH5YGZSDL7SNTWG6G","short_pith_number":"pith:JB22WONE","schema_version":"1.0","canonical_sha256":"4875ab39a430cfdc1b321aff26cec6f1b8587f2170ebb184dd57ba29b3c017a4","source":{"kind":"arxiv","id":"1508.03859","version":1},"attestation_state":"computed","paper":{"title":"The Computational Power of Beeps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Calvin Newport, Seth Gilbert","submitted_at":"2015-08-16T19:58:37Z","abstract_excerpt":"In this paper, we study the quantity of computational resources (state machine states and/or probabilistic transition precision) needed to solve specific problems in a single hop network where nodes communicate using only beeps. We begin by focusing on randomized leader election. We prove a lower bound on the states required to solve this problem with a given error bound, probability precision, and (when relevant) network size lower bound. We then show the bound tight with a matching upper bound. Noting that our optimal upper bound is slow, we describe two faster algorithms that trade some sta"},"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":"1508.03859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-16T19:58:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"17ae5ab3f4c9787f6279c4c832d31987f5844de353d8559367aa36444fc1e728","abstract_canon_sha256":"efa3bde9d0ceb989791de8081210b9f9f00ea4a822188015e98709016173b6b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.028713Z","signature_b64":"C3HuQxI6C9rQJte1i6gbyFc/oigWjyRKbtJI0Iszk5sD35qopM95ZYmHvwkGN36yetVk/PzqyFv9Sgf2/Gv5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4875ab39a430cfdc1b321aff26cec6f1b8587f2170ebb184dd57ba29b3c017a4","last_reissued_at":"2026-05-18T01:35:15.028171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.028171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Power of Beeps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Calvin Newport, Seth Gilbert","submitted_at":"2015-08-16T19:58:37Z","abstract_excerpt":"In this paper, we study the quantity of computational resources (state machine states and/or probabilistic transition precision) needed to solve specific problems in a single hop network where nodes communicate using only beeps. We begin by focusing on randomized leader election. We prove a lower bound on the states required to solve this problem with a given error bound, probability precision, and (when relevant) network size lower bound. We then show the bound tight with a matching upper bound. Noting that our optimal upper bound is slow, we describe two faster algorithms that trade some sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03859","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":"1508.03859","created_at":"2026-05-18T01:35:15.028245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03859v1","created_at":"2026-05-18T01:35:15.028245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03859","created_at":"2026-05-18T01:35:15.028245+00:00"},{"alias_kind":"pith_short_12","alias_value":"JB22WONEGDH5","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JB22WONEGDH5YGZS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JB22WONE","created_at":"2026-05-18T12:29:27.538025+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/JB22WONEGDH5YGZSDL7SNTWG6G","json":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G.json","graph_json":"https://pith.science/api/pith-number/JB22WONEGDH5YGZSDL7SNTWG6G/graph.json","events_json":"https://pith.science/api/pith-number/JB22WONEGDH5YGZSDL7SNTWG6G/events.json","paper":"https://pith.science/paper/JB22WONE"},"agent_actions":{"view_html":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G","download_json":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G.json","view_paper":"https://pith.science/paper/JB22WONE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03859&json=true","fetch_graph":"https://pith.science/api/pith-number/JB22WONEGDH5YGZSDL7SNTWG6G/graph.json","fetch_events":"https://pith.science/api/pith-number/JB22WONEGDH5YGZSDL7SNTWG6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/action/storage_attestation","attest_author":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/action/author_attestation","sign_citation":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/action/citation_signature","submit_replication":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/action/replication_record"}},"created_at":"2026-05-18T01:35:15.028245+00:00","updated_at":"2026-05-18T01:35:15.028245+00:00"}