{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GJIWVUFTLIK2NSQ5BNRXIRSDVT","short_pith_number":"pith:GJIWVUFT","canonical_record":{"source":{"id":"1509.03815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-13T06:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"2439a8d7cb08e6aa0e77de66c0b3b757c5a60a61c68ca6b4be811e952a53cc25","abstract_canon_sha256":"b32399d2f2e5ef5fb1d59c6463fce0b677002effb85d27ca6358a952a00a196f"},"schema_version":"1.0"},"canonical_sha256":"32516ad0b35a15a6ca1d0b63744643acd8b006f9ddce35af0796f54859e2ebc4","source":{"kind":"arxiv","id":"1509.03815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03815","created_at":"2026-05-18T01:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03815v1","created_at":"2026-05-18T01:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03815","created_at":"2026-05-18T01:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"GJIWVUFTLIK2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GJIWVUFTLIK2NSQ5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GJIWVUFT","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GJIWVUFTLIK2NSQ5BNRXIRSDVT","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-13T06:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"2439a8d7cb08e6aa0e77de66c0b3b757c5a60a61c68ca6b4be811e952a53cc25","abstract_canon_sha256":"b32399d2f2e5ef5fb1d59c6463fce0b677002effb85d27ca6358a952a00a196f"},"schema_version":"1.0"},"canonical_sha256":"32516ad0b35a15a6ca1d0b63744643acd8b006f9ddce35af0796f54859e2ebc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:14.445744Z","signature_b64":"ohvua571t6pdUdKUQ7tJKwwQbWuT2bf2G4IpIpytPhmvBXpf6WqbTmwtJ1fxXe81TInVGOOWd4IVyv455tUEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32516ad0b35a15a6ca1d0b63744643acd8b006f9ddce35af0796f54859e2ebc4","last_reissued_at":"2026-05-18T01:33:14.445171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:14.445171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03815","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:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60b/VQEgfRlL3IMRrx/nNopZnrG/u1OWaWNLSTtm3tlOdT2l0qmbjKLesGqSUMZvgALGjvQyxVxyxX981BfyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:53:34.097269Z"},"content_sha256":"ab10851bf340f4d11b841521b89f32a3521869d2c2a2656a26964143ceefc7e1","schema_version":"1.0","event_id":"sha256:ab10851bf340f4d11b841521b89f32a3521869d2c2a2656a26964143ceefc7e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GJIWVUFTLIK2NSQ5BNRXIRSDVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Silent Self-stabilizing BFS Tree Algorithms Revised","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Colette Johnen, St\\'ephane Devismes","submitted_at":"2015-09-13T06:26:21Z","abstract_excerpt":"In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev et al algorithm and the Huang and Chen's algorithm. More precisely, we propose in the composite atomicity model three straightforward adaptations inspired from those algorithms. We then present a deep study of these three algorithms. Our results are related to both correctness (convergence and closure, assuming a distributed unfair daemon) and complexity (analysis of the stabilization time in terms of rounds and steps)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03815","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:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyTxgq75e6MibLuaJeED4TlMnWl5y5hFDcZUCmyQkxikOh00qItSsR9oVRceeH42gZHsgZ8J2RuG+pzle/ebDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:53:34.097650Z"},"content_sha256":"9b01e6acc79e68fd8da38a075d859f3577dea7e18f5a1fb343468a30040d514d","schema_version":"1.0","event_id":"sha256:9b01e6acc79e68fd8da38a075d859f3577dea7e18f5a1fb343468a30040d514d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJIWVUFTLIK2NSQ5BNRXIRSDVT/bundle.json","state_url":"https://pith.science/pith/GJIWVUFTLIK2NSQ5BNRXIRSDVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJIWVUFTLIK2NSQ5BNRXIRSDVT/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-05-30T07:53:34Z","links":{"resolver":"https://pith.science/pith/GJIWVUFTLIK2NSQ5BNRXIRSDVT","bundle":"https://pith.science/pith/GJIWVUFTLIK2NSQ5BNRXIRSDVT/bundle.json","state":"https://pith.science/pith/GJIWVUFTLIK2NSQ5BNRXIRSDVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJIWVUFTLIK2NSQ5BNRXIRSDVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GJIWVUFTLIK2NSQ5BNRXIRSDVT","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":"b32399d2f2e5ef5fb1d59c6463fce0b677002effb85d27ca6358a952a00a196f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-13T06:26:21Z","title_canon_sha256":"2439a8d7cb08e6aa0e77de66c0b3b757c5a60a61c68ca6b4be811e952a53cc25"},"schema_version":"1.0","source":{"id":"1509.03815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03815","created_at":"2026-05-18T01:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03815v1","created_at":"2026-05-18T01:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03815","created_at":"2026-05-18T01:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"GJIWVUFTLIK2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GJIWVUFTLIK2NSQ5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GJIWVUFT","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:9b01e6acc79e68fd8da38a075d859f3577dea7e18f5a1fb343468a30040d514d","target":"graph","created_at":"2026-05-18T01:33:14Z","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":"In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev et al algorithm and the Huang and Chen's algorithm. More precisely, we propose in the composite atomicity model three straightforward adaptations inspired from those algorithms. We then present a deep study of these three algorithms. Our results are related to both correctness (convergence and closure, assuming a distributed unfair daemon) and complexity (analysis of the stabilization time in terms of rounds and steps).","authors_text":"Colette Johnen, St\\'ephane Devismes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-13T06:26:21Z","title":"Silent Self-stabilizing BFS Tree Algorithms Revised"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03815","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:ab10851bf340f4d11b841521b89f32a3521869d2c2a2656a26964143ceefc7e1","target":"record","created_at":"2026-05-18T01:33:14Z","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":"b32399d2f2e5ef5fb1d59c6463fce0b677002effb85d27ca6358a952a00a196f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-13T06:26:21Z","title_canon_sha256":"2439a8d7cb08e6aa0e77de66c0b3b757c5a60a61c68ca6b4be811e952a53cc25"},"schema_version":"1.0","source":{"id":"1509.03815","kind":"arxiv","version":1}},"canonical_sha256":"32516ad0b35a15a6ca1d0b63744643acd8b006f9ddce35af0796f54859e2ebc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32516ad0b35a15a6ca1d0b63744643acd8b006f9ddce35af0796f54859e2ebc4","first_computed_at":"2026-05-18T01:33:14.445171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:14.445171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohvua571t6pdUdKUQ7tJKwwQbWuT2bf2G4IpIpytPhmvBXpf6WqbTmwtJ1fxXe81TInVGOOWd4IVyv455tUEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:14.445744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab10851bf340f4d11b841521b89f32a3521869d2c2a2656a26964143ceefc7e1","sha256:9b01e6acc79e68fd8da38a075d859f3577dea7e18f5a1fb343468a30040d514d"],"state_sha256":"1f77307369478a0f534cfc72fa2a5afc078cf611b34953e6a62f6f6c0453f763"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEUz00saKUqKCN3tTO/SGF+/sHzyVegaRI2JTFCkw3C21Upbx/M/yEsK2JZDtKdE6tih8nRmx9vY28Ltsc7BDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:53:34.099672Z","bundle_sha256":"d65eaea0c31351b96ec49fc526b5785941d5cf87527d77f6a5bb3cb89512bffa"}}