{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PKBDBIEVMRDTPFYXK2KXX62GGR","short_pith_number":"pith:PKBDBIEV","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"},"canonical_sha256":"7a8230a095644737971756957bfb463444a542376772e0c293a4fd98afab0b13","source":{"kind":"arxiv","id":"1607.02951","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02951","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02951v4","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02951","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"PKBDBIEVMRDT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PKBDBIEVMRDTPFYX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PKBDBIEV","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PKBDBIEVMRDTPFYXK2KXX62GGR","target":"record","payload":{"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"},"canonical_sha256":"7a8230a095644737971756957bfb463444a542376772e0c293a4fd98afab0b13","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"},"source_kind":"arxiv","source_id":"1607.02951","source_version":4,"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-18T00:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"byosap2qNLc1EjixOWszrss20HfjGZvZWj5KEwG4jG3Ej6ic7o/uQwXS4QNWBgUqb53APeXBSUDX65HbnrEwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:29:26.259219Z"},"content_sha256":"f4e96e25e42d68e8097a2de0a0a20bb63c5fdb231c52372ec9a486607a51cb54","schema_version":"1.0","event_id":"sha256:f4e96e25e42d68e8097a2de0a0a20bb63c5fdb231c52372ec9a486607a51cb54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PKBDBIEVMRDTPFYXK2KXX62GGR","target":"graph","payload":{"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"},"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-18T00:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIRukJ9AcHMzk1UWVvE0OWRzuSq6CEDY5QtqCO5Kh+YWbQFDrW1j0AGN2N2oWR2wlxX7zy/uRpC4MBOC/cliBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:29:26.259947Z"},"content_sha256":"25dcb19b2adc5872f2b11880135d031c5e2c72869ceb875ad751f31e6ebd67d5","schema_version":"1.0","event_id":"sha256:25dcb19b2adc5872f2b11880135d031c5e2c72869ceb875ad751f31e6ebd67d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/bundle.json","state_url":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/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-11T01:29:26Z","links":{"resolver":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR","bundle":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/bundle.json","state":"https://pith.science/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKBDBIEVMRDTPFYXK2KXX62GGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PKBDBIEVMRDTPFYXK2KXX62GGR","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":"7319891d2cbeb51c361a662bb499723d40c7d8b872aabc3e6754d4881f5b3d16","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-11T13:56:45Z","title_canon_sha256":"d1f5ea1a4c4daa8acca29fbba0a38854e5e63ece09950242782e0c775731bab7"},"schema_version":"1.0","source":{"id":"1607.02951","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02951","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02951v4","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02951","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"PKBDBIEVMRDT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PKBDBIEVMRDTPFYX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PKBDBIEV","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:25dcb19b2adc5872f2b11880135d031c5e2c72869ceb875ad751f31e6ebd67d5","target":"graph","created_at":"2026-05-18T00:06:51Z","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":"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","authors_text":"Akka Zemmari, Arnaud Casteigts, John Michael Robson, Yves M\\'etivier","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-11T13:56:45Z","title":"Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02951","kind":"arxiv","version":4},"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:f4e96e25e42d68e8097a2de0a0a20bb63c5fdb231c52372ec9a486607a51cb54","target":"record","created_at":"2026-05-18T00:06:51Z","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":"7319891d2cbeb51c361a662bb499723d40c7d8b872aabc3e6754d4881f5b3d16","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-11T13:56:45Z","title_canon_sha256":"d1f5ea1a4c4daa8acca29fbba0a38854e5e63ece09950242782e0c775731bab7"},"schema_version":"1.0","source":{"id":"1607.02951","kind":"arxiv","version":4}},"canonical_sha256":"7a8230a095644737971756957bfb463444a542376772e0c293a4fd98afab0b13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a8230a095644737971756957bfb463444a542376772e0c293a4fd98afab0b13","first_computed_at":"2026-05-18T00:06:51.564188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:51.564188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RuvVDiZHwP4n1Js1H6LYCjeQY10Afth+XEL6iEcikpcTao3uYYxGDBCWsFN0y1bYTV+wZgR8DlJKKAQXoHGlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:51.565025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02951","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4e96e25e42d68e8097a2de0a0a20bb63c5fdb231c52372ec9a486607a51cb54","sha256:25dcb19b2adc5872f2b11880135d031c5e2c72869ceb875ad751f31e6ebd67d5"],"state_sha256":"3f8a28d1eb8e19cea63ae8f857ca082a8b72faa763c22c11b194feea41dc9427"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ux5KM5mVgOnfgz3x5XqySvF7xLU4s80DWvj6I8WU1T3HMiNZxr4m5Gw6F13Cg6CmQslVUz5FnkTGeNzcEHkjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:29:26.264358Z","bundle_sha256":"8c10458a2dc5b7349c188fc9facd21f55ba5940ff1a299b6825823fd5ee56002"}}