{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LNWA6DBDYLRSGCOKMT3DT326U5","short_pith_number":"pith:LNWA6DBD","canonical_record":{"source":{"id":"1507.02721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:44:45Z","cross_cats_sorted":[],"title_canon_sha256":"bf85d7af26815d2f6ea82e3bb9ec74800701729690851b52f7cde8a9a7aad3b4","abstract_canon_sha256":"66f8d01e6ead06aae1707ad77c41ae4a49ecc0fabcebbc6c92b07a5ac0516c57"},"schema_version":"1.0"},"canonical_sha256":"5b6c0f0c23c2e32309ca64f639ef5ea76c5e5993e8f9f1c4e240fad2ccdea2b4","source":{"kind":"arxiv","id":"1507.02721","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02721","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02721v2","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02721","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"LNWA6DBDYLRS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNWA6DBDYLRSGCOK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNWA6DBD","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LNWA6DBDYLRSGCOKMT3DT326U5","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:44:45Z","cross_cats_sorted":[],"title_canon_sha256":"bf85d7af26815d2f6ea82e3bb9ec74800701729690851b52f7cde8a9a7aad3b4","abstract_canon_sha256":"66f8d01e6ead06aae1707ad77c41ae4a49ecc0fabcebbc6c92b07a5ac0516c57"},"schema_version":"1.0"},"canonical_sha256":"5b6c0f0c23c2e32309ca64f639ef5ea76c5e5993e8f9f1c4e240fad2ccdea2b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:25.342940Z","signature_b64":"sYhMyjBvPD57FgWIOMIehu99d6a/rSgbLLuqPSPTwSObbnCSuDwFaitYkv9vzi5qJyscOprTwO8Ki3fFpHQqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6c0f0c23c2e32309ca64f639ef5ea76c5e5993e8f9f1c4e240fad2ccdea2b4","last_reissued_at":"2026-05-18T01:36:25.342487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:25.342487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02721","source_version":2,"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:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aS0cnKmjorjymAMqJ/aOZvznjtFIWxFwFntbGrZawMPRoNWoZ4jfLY+J0G/ZTiPcJye5IVM0GZycPgSL6g5vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:46:00.073324Z"},"content_sha256":"b9b0fbe22e92707913c38450e5dee77c87d485c063f931f3e46dea995462f9c2","schema_version":"1.0","event_id":"sha256:b9b0fbe22e92707913c38450e5dee77c87d485c063f931f3e46dea995462f9c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LNWA6DBDYLRSGCOKMT3DT326U5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Distributed Computing with Beeps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"A. Zemmari, J.M. Robson, Y. M\\'etivier","submitted_at":"2015-07-09T21:44:45Z","abstract_excerpt":"We consider networks of processes which interact with beeps. Various beeping models are used. The basic one, defined by Cornejo and Kuhn [CK10], assumes that a process can choose either to beep or to listen; if it listens it can distinguish between silence or the presence of at least one beep. The aim of this paper is the study of the resolution of paradigms such as collision detection, computation of the degree of a vertex, colouring, or 2-hop-colouring in the framework of beeping models. For each of these problems we present Las Vegas or Monte Carlo algorithms and we analyse their complexiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02721","kind":"arxiv","version":2},"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:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iVMG1HUNadg2govSP37sNhIWutkJbM1yTRaGmdI2+S7lI0lBe2D+6DfJWSETo+ZDrn+8nRkRt0GlFnglnBaPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:46:00.073766Z"},"content_sha256":"06cfa5ad1d7ca6229acbf9f60786a8aa50dc07ffb4e190865bfaaa66fb8f6e84","schema_version":"1.0","event_id":"sha256:06cfa5ad1d7ca6229acbf9f60786a8aa50dc07ffb4e190865bfaaa66fb8f6e84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNWA6DBDYLRSGCOKMT3DT326U5/bundle.json","state_url":"https://pith.science/pith/LNWA6DBDYLRSGCOKMT3DT326U5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNWA6DBDYLRSGCOKMT3DT326U5/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-08-11T10:46:00Z","links":{"resolver":"https://pith.science/pith/LNWA6DBDYLRSGCOKMT3DT326U5","bundle":"https://pith.science/pith/LNWA6DBDYLRSGCOKMT3DT326U5/bundle.json","state":"https://pith.science/pith/LNWA6DBDYLRSGCOKMT3DT326U5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNWA6DBDYLRSGCOKMT3DT326U5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LNWA6DBDYLRSGCOKMT3DT326U5","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":"66f8d01e6ead06aae1707ad77c41ae4a49ecc0fabcebbc6c92b07a5ac0516c57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:44:45Z","title_canon_sha256":"bf85d7af26815d2f6ea82e3bb9ec74800701729690851b52f7cde8a9a7aad3b4"},"schema_version":"1.0","source":{"id":"1507.02721","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02721","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02721v2","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02721","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"LNWA6DBDYLRS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNWA6DBDYLRSGCOK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNWA6DBD","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:06cfa5ad1d7ca6229acbf9f60786a8aa50dc07ffb4e190865bfaaa66fb8f6e84","target":"graph","created_at":"2026-05-18T01:36:25Z","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. Various beeping models are used. The basic one, defined by Cornejo and Kuhn [CK10], assumes that a process can choose either to beep or to listen; if it listens it can distinguish between silence or the presence of at least one beep. The aim of this paper is the study of the resolution of paradigms such as collision detection, computation of the degree of a vertex, colouring, or 2-hop-colouring in the framework of beeping models. For each of these problems we present Las Vegas or Monte Carlo algorithms and we analyse their complexiti","authors_text":"A. Zemmari, J.M. Robson, Y. M\\'etivier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:44:45Z","title":"On Distributed Computing with Beeps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02721","kind":"arxiv","version":2},"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:b9b0fbe22e92707913c38450e5dee77c87d485c063f931f3e46dea995462f9c2","target":"record","created_at":"2026-05-18T01:36:25Z","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":"66f8d01e6ead06aae1707ad77c41ae4a49ecc0fabcebbc6c92b07a5ac0516c57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:44:45Z","title_canon_sha256":"bf85d7af26815d2f6ea82e3bb9ec74800701729690851b52f7cde8a9a7aad3b4"},"schema_version":"1.0","source":{"id":"1507.02721","kind":"arxiv","version":2}},"canonical_sha256":"5b6c0f0c23c2e32309ca64f639ef5ea76c5e5993e8f9f1c4e240fad2ccdea2b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b6c0f0c23c2e32309ca64f639ef5ea76c5e5993e8f9f1c4e240fad2ccdea2b4","first_computed_at":"2026-05-18T01:36:25.342487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:25.342487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYhMyjBvPD57FgWIOMIehu99d6a/rSgbLLuqPSPTwSObbnCSuDwFaitYkv9vzi5qJyscOprTwO8Ki3fFpHQqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:25.342940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02721","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9b0fbe22e92707913c38450e5dee77c87d485c063f931f3e46dea995462f9c2","sha256:06cfa5ad1d7ca6229acbf9f60786a8aa50dc07ffb4e190865bfaaa66fb8f6e84"],"state_sha256":"3b4a8aecab70162fa19c13910a2a644c1c30677102e62499984e8a8d978273c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0G02CGlE4zkECez+0n1lT14w/7gT06vSwZLn4tUCCxAAbQ0y/nFm0Bwk16RSNWrwK91Tok0XLhiUuj7W2nsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:46:00.077993Z","bundle_sha256":"2d43ace4b109f6472d7d42ff52bd708d6fedbdd185db4db1c9ac94efe08b74e1"}}