{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JB22WONEGDH5YGZSDL7SNTWG6G","short_pith_number":"pith:JB22WONE","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"},"canonical_sha256":"4875ab39a430cfdc1b321aff26cec6f1b8587f2170ebb184dd57ba29b3c017a4","source":{"kind":"arxiv","id":"1508.03859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03859","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03859v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03859","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"JB22WONEGDH5","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JB22WONEGDH5YGZS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JB22WONE","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JB22WONEGDH5YGZSDL7SNTWG6G","target":"record","payload":{"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"},"canonical_sha256":"4875ab39a430cfdc1b321aff26cec6f1b8587f2170ebb184dd57ba29b3c017a4","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"},"source_kind":"arxiv","source_id":"1508.03859","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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIQUSeQuRa+FpebvuuRBOTM+pMJhejhRAXcoVrl3yDrTLZ2aUsYYAtxrW6FGDbA57Xc5A7Cb2PRcG9m6XSyxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:32.934335Z"},"content_sha256":"52239405863840389e4beac5f69be52c840123625216e6e8928e442faa5ab72d","schema_version":"1.0","event_id":"sha256:52239405863840389e4beac5f69be52c840123625216e6e8928e442faa5ab72d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JB22WONEGDH5YGZSDL7SNTWG6G","target":"graph","payload":{"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"},"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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mC+a7RF2YOFuTEka252zPYG82zw7uZ9phJw3idnSshb8h9VdbKVSVXaf+BF6RHeqn4e0+zsZL3jUxc4bYICHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:32.934694Z"},"content_sha256":"7b990544bb368d9672795f6179d9b2bf792db067ab8bd2a2d80f6013e00427f1","schema_version":"1.0","event_id":"sha256:7b990544bb368d9672795f6179d9b2bf792db067ab8bd2a2d80f6013e00427f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/bundle.json","state_url":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JB22WONEGDH5YGZSDL7SNTWG6G/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-06-02T10:26:32Z","links":{"resolver":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G","bundle":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/bundle.json","state":"https://pith.science/pith/JB22WONEGDH5YGZSDL7SNTWG6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JB22WONEGDH5YGZSDL7SNTWG6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JB22WONEGDH5YGZSDL7SNTWG6G","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":"efa3bde9d0ceb989791de8081210b9f9f00ea4a822188015e98709016173b6b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-16T19:58:37Z","title_canon_sha256":"17ae5ab3f4c9787f6279c4c832d31987f5844de353d8559367aa36444fc1e728"},"schema_version":"1.0","source":{"id":"1508.03859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03859","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03859v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03859","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"JB22WONEGDH5","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JB22WONEGDH5YGZS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JB22WONE","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:7b990544bb368d9672795f6179d9b2bf792db067ab8bd2a2d80f6013e00427f1","target":"graph","created_at":"2026-05-18T01:35:15Z","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":"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","authors_text":"Calvin Newport, Seth Gilbert","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-16T19:58:37Z","title":"The Computational Power of Beeps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03859","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:52239405863840389e4beac5f69be52c840123625216e6e8928e442faa5ab72d","target":"record","created_at":"2026-05-18T01:35:15Z","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":"efa3bde9d0ceb989791de8081210b9f9f00ea4a822188015e98709016173b6b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-16T19:58:37Z","title_canon_sha256":"17ae5ab3f4c9787f6279c4c832d31987f5844de353d8559367aa36444fc1e728"},"schema_version":"1.0","source":{"id":"1508.03859","kind":"arxiv","version":1}},"canonical_sha256":"4875ab39a430cfdc1b321aff26cec6f1b8587f2170ebb184dd57ba29b3c017a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4875ab39a430cfdc1b321aff26cec6f1b8587f2170ebb184dd57ba29b3c017a4","first_computed_at":"2026-05-18T01:35:15.028171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:15.028171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C3HuQxI6C9rQJte1i6gbyFc/oigWjyRKbtJI0Iszk5sD35qopM95ZYmHvwkGN36yetVk/PzqyFv9Sgf2/Gv5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:15.028713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52239405863840389e4beac5f69be52c840123625216e6e8928e442faa5ab72d","sha256:7b990544bb368d9672795f6179d9b2bf792db067ab8bd2a2d80f6013e00427f1"],"state_sha256":"a797741329edef804fedd6e5867a8f5e4bbc0f12c71f26d076aee77f9751e1de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhA0ueHNw1C27bD+muquEjtE2ssEqGP52yTOqLHJXhuxK7yxwCAROAvzRoTrK1hnnbWKuYYo37IlzT+zAUAdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:26:32.937565Z","bundle_sha256":"bba35d524dec95eccf7419347b403be5ba09ec0313e776bbd4680d628ea6b65e"}}