{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4EQLQ63JCWAKMJV4MHOBQJTYOZ","short_pith_number":"pith:4EQLQ63J","schema_version":"1.0","canonical_sha256":"e120b87b691580a626bc61dc182678765e9323a0dec9dff8c90c7689b188cd8a","source":{"kind":"arxiv","id":"1611.08938","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous Broadcasting with Bivalent Beeps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Kokouvi Hounkanli","submitted_at":"2016-11-27T23:55:18Z","abstract_excerpt":"In broadcasting, one node of a network has a message that must be learned by all other nodes. We study deterministic algorithms for this fundamental communication task in a very weak model of wireless communication. The only signals sent by nodes are beeps. Moreover, they are delivered to neighbors of the beeping node in an asynchronous way: the time between sending and reception is finite but unpredictable. We first observe that under this scenario, no communication is possible, if beeps are all of the same strength. Hence we study broadcasting in the bivalent beeping model, where every beep "},"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":"1611.08938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-27T23:55:18Z","cross_cats_sorted":[],"title_canon_sha256":"11d47242d2c28500240b1e72769bc6bc7c4160bd1c11f88bd3be06110db06646","abstract_canon_sha256":"bb6a6642137a36f04bebf7b7b8bffef8488a3e7ce6f69013cf8c535588fa76a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:29.802625Z","signature_b64":"v0KVe54en9XjUuhN71KVohFusi6vwBv0wt01Vr9WR8fYR7zCrMja4Ei3NI5b9jxFkBqj3ovnOfwK4YHpTMyaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e120b87b691580a626bc61dc182678765e9323a0dec9dff8c90c7689b188cd8a","last_reissued_at":"2026-05-18T00:56:29.801829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:29.801829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Broadcasting with Bivalent Beeps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Kokouvi Hounkanli","submitted_at":"2016-11-27T23:55:18Z","abstract_excerpt":"In broadcasting, one node of a network has a message that must be learned by all other nodes. We study deterministic algorithms for this fundamental communication task in a very weak model of wireless communication. The only signals sent by nodes are beeps. Moreover, they are delivered to neighbors of the beeping node in an asynchronous way: the time between sending and reception is finite but unpredictable. We first observe that under this scenario, no communication is possible, if beeps are all of the same strength. Hence we study broadcasting in the bivalent beeping model, where every beep "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08938","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":"1611.08938","created_at":"2026-05-18T00:56:29.801965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08938v1","created_at":"2026-05-18T00:56:29.801965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08938","created_at":"2026-05-18T00:56:29.801965+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EQLQ63JCWAK","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EQLQ63JCWAKMJV4","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EQLQ63J","created_at":"2026-05-18T12:29:58.707656+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/4EQLQ63JCWAKMJV4MHOBQJTYOZ","json":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ.json","graph_json":"https://pith.science/api/pith-number/4EQLQ63JCWAKMJV4MHOBQJTYOZ/graph.json","events_json":"https://pith.science/api/pith-number/4EQLQ63JCWAKMJV4MHOBQJTYOZ/events.json","paper":"https://pith.science/paper/4EQLQ63J"},"agent_actions":{"view_html":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ","download_json":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ.json","view_paper":"https://pith.science/paper/4EQLQ63J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08938&json=true","fetch_graph":"https://pith.science/api/pith-number/4EQLQ63JCWAKMJV4MHOBQJTYOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4EQLQ63JCWAKMJV4MHOBQJTYOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ/action/storage_attestation","attest_author":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ/action/author_attestation","sign_citation":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ/action/citation_signature","submit_replication":"https://pith.science/pith/4EQLQ63JCWAKMJV4MHOBQJTYOZ/action/replication_record"}},"created_at":"2026-05-18T00:56:29.801965+00:00","updated_at":"2026-05-18T00:56:29.801965+00:00"}