{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VACTHCDJXASSP6DROTHMHCS2EB","short_pith_number":"pith:VACTHCDJ","canonical_record":{"source":{"id":"1507.04909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T10:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"4502c195912eaad2ed2a094e272741166378aca6a4ca2686c21450d29903d544","abstract_canon_sha256":"dca7c4c072da07c66a9013fb0d75f987566908d343312982f95b894672c2ab77"},"schema_version":"1.0"},"canonical_sha256":"a805338869b82527f87174cec38a5a206b3d9f32c2a59cff1cf3d7e7c6887492","source":{"kind":"arxiv","id":"1507.04909","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04909","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04909v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04909","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"VACTHCDJXASS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VACTHCDJXASSP6DR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VACTHCDJ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VACTHCDJXASSP6DROTHMHCS2EB","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T10:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"4502c195912eaad2ed2a094e272741166378aca6a4ca2686c21450d29903d544","abstract_canon_sha256":"dca7c4c072da07c66a9013fb0d75f987566908d343312982f95b894672c2ab77"},"schema_version":"1.0"},"canonical_sha256":"a805338869b82527f87174cec38a5a206b3d9f32c2a59cff1cf3d7e7c6887492","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:42.444167Z","signature_b64":"YRHgKGVBrPLGFelLvkka0FQw1tWXzkZt1MURijR5W7RqU5xHMyx1UWykbvUTGPvNLbylAgLLujpdIXwzLIKODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a805338869b82527f87174cec38a5a206b3d9f32c2a59cff1cf3d7e7c6887492","last_reissued_at":"2026-05-18T01:36:42.443515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:42.443515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04909","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:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usvI4hRoKehpUAuU3g/+d1/QiQNnAWDKI9Cp1f+V4LqoNPaKyQzAKlpYmGl7U4Ke6PYJvUq+Jwxens/Zx5gRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:06:55.508784Z"},"content_sha256":"f0cbfbbd282fef931b3d4854e8e3aad097adf4636d2e59aec8536368685b392b","schema_version":"1.0","event_id":"sha256:f0cbfbbd282fef931b3d4854e8e3aad097adf4636d2e59aec8536368685b392b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VACTHCDJXASSP6DROTHMHCS2EB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Election algorithms with random delays in trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Akka Zemmari, Jean-Fran\\c{c}ois Marckert, Nasser Saheb-Djahromi","submitted_at":"2015-07-17T10:35:52Z","abstract_excerpt":"The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied. The election amounts to removing leaves one by one until the tree is reduced to a unique node which is then elected. The algorithm assigns to each leaf a probability distribution (that may depends on the information transmitted by the eliminated nodes) used by the leaf to generate its remaining random lifetime. In the general case, the probability of each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04909","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:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74QxgzAH2buBQMdzM9Y0NV4UrqIcERrtc7mrXKRGBGnIqw5ROLjH2xs98U+FOMZ2RdQ250DsLdHaws8nJ3NoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:06:55.509139Z"},"content_sha256":"0523b00b193edf4e05b60888447ffb4ce6b3ec5fd9f4f9b99e592c2a51d4de2c","schema_version":"1.0","event_id":"sha256:0523b00b193edf4e05b60888447ffb4ce6b3ec5fd9f4f9b99e592c2a51d4de2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VACTHCDJXASSP6DROTHMHCS2EB/bundle.json","state_url":"https://pith.science/pith/VACTHCDJXASSP6DROTHMHCS2EB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VACTHCDJXASSP6DROTHMHCS2EB/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-01T13:06:55Z","links":{"resolver":"https://pith.science/pith/VACTHCDJXASSP6DROTHMHCS2EB","bundle":"https://pith.science/pith/VACTHCDJXASSP6DROTHMHCS2EB/bundle.json","state":"https://pith.science/pith/VACTHCDJXASSP6DROTHMHCS2EB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VACTHCDJXASSP6DROTHMHCS2EB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VACTHCDJXASSP6DROTHMHCS2EB","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":"dca7c4c072da07c66a9013fb0d75f987566908d343312982f95b894672c2ab77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T10:35:52Z","title_canon_sha256":"4502c195912eaad2ed2a094e272741166378aca6a4ca2686c21450d29903d544"},"schema_version":"1.0","source":{"id":"1507.04909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04909","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04909v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04909","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"VACTHCDJXASS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VACTHCDJXASSP6DR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VACTHCDJ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:0523b00b193edf4e05b60888447ffb4ce6b3ec5fd9f4f9b99e592c2a51d4de2c","target":"graph","created_at":"2026-05-18T01:36:42Z","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":"The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied. The election amounts to removing leaves one by one until the tree is reduced to a unique node which is then elected. The algorithm assigns to each leaf a probability distribution (that may depends on the information transmitted by the eliminated nodes) used by the leaf to generate its remaining random lifetime. In the general case, the probability of each","authors_text":"Akka Zemmari, Jean-Fran\\c{c}ois Marckert, Nasser Saheb-Djahromi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T10:35:52Z","title":"Election algorithms with random delays in trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04909","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:f0cbfbbd282fef931b3d4854e8e3aad097adf4636d2e59aec8536368685b392b","target":"record","created_at":"2026-05-18T01:36:42Z","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":"dca7c4c072da07c66a9013fb0d75f987566908d343312982f95b894672c2ab77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T10:35:52Z","title_canon_sha256":"4502c195912eaad2ed2a094e272741166378aca6a4ca2686c21450d29903d544"},"schema_version":"1.0","source":{"id":"1507.04909","kind":"arxiv","version":1}},"canonical_sha256":"a805338869b82527f87174cec38a5a206b3d9f32c2a59cff1cf3d7e7c6887492","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a805338869b82527f87174cec38a5a206b3d9f32c2a59cff1cf3d7e7c6887492","first_computed_at":"2026-05-18T01:36:42.443515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:42.443515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YRHgKGVBrPLGFelLvkka0FQw1tWXzkZt1MURijR5W7RqU5xHMyx1UWykbvUTGPvNLbylAgLLujpdIXwzLIKODw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:42.444167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0cbfbbd282fef931b3d4854e8e3aad097adf4636d2e59aec8536368685b392b","sha256:0523b00b193edf4e05b60888447ffb4ce6b3ec5fd9f4f9b99e592c2a51d4de2c"],"state_sha256":"78d7384ba3f3c7eaeaa995bace79c65ae968c556ff9bbe160a57e1145228e1ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/WYbvyzdy+higQKSkLxJ4qXNam2ocFr0VGgzEirzDTtnDQBASg/Vq6+wK4Imh1b4/Y4NfpET7sgwFYxD6bKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:06:55.511208Z","bundle_sha256":"854beea1a4e5b81e524a2934ae3d317c96b2eaf9fabda24086c167dec3811bd0"}}