{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3Z6XZHABA2LQ626CZTAANRKBUH","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":"9cf81f3c1b25002843eca98aea84d785076ffb3ba354c62c3cc2ba60e58cffcf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T20:13:48Z","title_canon_sha256":"e0fc9e7a0040d373797e7296c8165d64fed31ad24308c881fa65246ea5f2b5c2"},"schema_version":"1.0","source":{"id":"1312.3303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3303","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3303v1","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3303","created_at":"2026-05-18T03:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"3Z6XZHABA2LQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3Z6XZHABA2LQ626C","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3Z6XZHAB","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:de8529965086b27f2a62b85fb6b296fa348d0317157e898a1f4c8ff17db98a40","target":"graph","created_at":"2026-05-18T03:04:59Z","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 present a uniform self-stabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. Our algorithm consists in two stages of stabilizing protocols. The first stage is a uniform randomized stabilizing {\\em unique naming} protocol, and the second stage is a stabilizing {\\em MDST} protocol, designed as a {\\em fair composition} of Merlin--Segall's stabilizing protocol and a distributed deterministic stabilizing protocol solving the (MDST) problem. The resulting randomized distributed algorithm presented","authors_text":"Christian Lavault (LIPN), Franck Butelle (LIPN), Marc Bui (CHART)","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T20:13:48Z","title":"A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3303","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:c3fcf473bba1c8dc8c12ecb140addf570ba6fc870b77758587d3aa2110b686d9","target":"record","created_at":"2026-05-18T03:04:59Z","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":"9cf81f3c1b25002843eca98aea84d785076ffb3ba354c62c3cc2ba60e58cffcf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T20:13:48Z","title_canon_sha256":"e0fc9e7a0040d373797e7296c8165d64fed31ad24308c881fa65246ea5f2b5c2"},"schema_version":"1.0","source":{"id":"1312.3303","kind":"arxiv","version":1}},"canonical_sha256":"de7d7c9c0106970f6bc2ccc006c541a1c892796611e5bdcda62ab3d6fc74c580","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de7d7c9c0106970f6bc2ccc006c541a1c892796611e5bdcda62ab3d6fc74c580","first_computed_at":"2026-05-18T03:04:59.957302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:59.957302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ui5kmlYNEyS6IGJhIm4KvBA9gaB3G6/XVW6DE+6zFnvyhyr300PW23LtFkfPENRHIEiHhHN6SmiFPwOtgSk4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:59.957950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3fcf473bba1c8dc8c12ecb140addf570ba6fc870b77758587d3aa2110b686d9","sha256:de8529965086b27f2a62b85fb6b296fa348d0317157e898a1f4c8ff17db98a40"],"state_sha256":"6aad710a0fce6394414a5e2ed2afbd542e54e5af3b47b9b7317ef7411804d141"}