{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PKBDBIEVMRDTPFYXK2KXX62GGR","short_pith_number":"pith:PKBDBIEV","schema_version":"1.0","canonical_sha256":"7a8230a095644737971756957bfb463444a542376772e0c293a4fd98afab0b13","source":{"kind":"arxiv","id":"1607.02951","version":4},"attestation_state":"computed","paper":{"title":"Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Akka Zemmari, Arnaud Casteigts, John Michael Robson, Yves M\\'etivier","submitted_at":"2016-07-11T13:56:45Z","abstract_excerpt":"We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn (2010), processes can choose in each round either to beep or to listen. Those who beep are unable to detect simultaneous beeps. Those who listen can only distinguish between silence and the presence of at least one beep. We refer to this model as $BL$ (beep or listen). Stronger models exist where the nodes can detect collision while they are beeping ($B_{cd}L$), listening ($BL_{cd}$), or both ($B_{cd}L_{cd}$). Beeping models are weak in essence and even simple tasks are difficult or unfe"},"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":"1607.02951","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-11T13:56:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d1f5ea1a4c4daa8acca29fbba0a38854e5e63ece09950242782e0c775731bab7","abstract_canon_sha256":"7319891d2cbeb51c361a662bb499723d40c7d8b872aabc3e6754d4881f5b3d16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:51.565025Z","signature_b64":"RuvVDiZHwP4n1Js1H6LYCjeQY10Afth+XEL6iEcikpcTao3uYYxGDBCWsFN0y1bYTV+wZgR8DlJKKAQXoHGlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a8230a095644737971756957bfb463444a542376772e0c293a4fd98afab0b13","last_reissued_at":"2026-05-18T00:06:51.564188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:51.564188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Akka Zemmari, Arnaud Casteigts, John Michael Robson, Yves M\\'etivier","submitted_at":"2016-07-11T13:56:45Z","abstract_excerpt":"We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn (2010), processes can choose in each round either to beep or to listen. Those who beep are unable to detect simultaneous beeps. Those who listen can only distinguish between silence and the presence of at least one beep. We refer to this model as $BL$ (beep or listen). Stronger models exist where the nodes can detect collision while they are beeping ($B_{cd}L$), listening ($BL_{cd}$), or both ($B_{cd}L_{cd}$). Beeping models are weak in essence and even simple tasks are difficult or unfe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02951","kind":"arxiv","version":4},"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":"1607.02951","created_at":"2026-05-18T00:06:51.564309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02951v4","created_at":"2026-05-18T00:06:51.564309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02951","created_at":"2026-05-18T00:06:51.564309+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKBDBIEVMRDT","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKBDBIEVMRDTPFYX","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKBDBIEV","created_at":"2026-05-18T12:30:39.010887+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/PKBDBIEVMRDTPFYXK2KXX62GGR","json":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR.json","graph_json":"https://pith.science/api/pith-number/PKBDBIEVMRDTPFYXK2KXX62GGR/graph.json","events_json":"https://pith.science/api/pith-number/PKBDBIEVMRDTPFYXK2KXX62GGR/events.json","paper":"https://pith.science/paper/PKBDBIEV"},"agent_actions":{"view_html":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR","download_json":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR.json","view_paper":"https://pith.science/paper/PKBDBIEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02951&json=true","fetch_graph":"https://pith.science/api/pith-number/PKBDBIEVMRDTPFYXK2KXX62GGR/graph.json","fetch_events":"https://pith.science/api/pith-number/PKBDBIEVMRDTPFYXK2KXX62GGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/action/storage_attestation","attest_author":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/action/author_attestation","sign_citation":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/action/citation_signature","submit_replication":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/action/replication_record"}},"created_at":"2026-05-18T00:06:51.564309+00:00","updated_at":"2026-05-18T00:06:51.564309+00:00"}