{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3Z6XZHABA2LQ626CZTAANRKBUH","short_pith_number":"pith:3Z6XZHAB","schema_version":"1.0","canonical_sha256":"de7d7c9c0106970f6bc2ccc006c541a1c892796611e5bdcda62ab3d6fc74c580","source":{"kind":"arxiv","id":"1312.3303","version":1},"attestation_state":"computed","paper":{"title":"A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christian Lavault (LIPN), Franck Butelle (LIPN), Marc Bui (CHART)","submitted_at":"2013-12-11T20:13:48Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.3303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T20:13:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e0fc9e7a0040d373797e7296c8165d64fed31ad24308c881fa65246ea5f2b5c2","abstract_canon_sha256":"9cf81f3c1b25002843eca98aea84d785076ffb3ba354c62c3cc2ba60e58cffcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:59.957950Z","signature_b64":"ui5kmlYNEyS6IGJhIm4KvBA9gaB3G6/XVW6DE+6zFnvyhyr300PW23LtFkfPENRHIEiHhHN6SmiFPwOtgSk4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7d7c9c0106970f6bc2ccc006c541a1c892796611e5bdcda62ab3d6fc74c580","last_reissued_at":"2026-05-18T03:04:59.957302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:59.957302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christian Lavault (LIPN), Franck Butelle (LIPN), Marc Bui (CHART)","submitted_at":"2013-12-11T20:13:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3303","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.3303","created_at":"2026-05-18T03:04:59.957407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3303v1","created_at":"2026-05-18T03:04:59.957407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3303","created_at":"2026-05-18T03:04:59.957407+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z6XZHABA2LQ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z6XZHABA2LQ626C","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z6XZHAB","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH","json":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH.json","graph_json":"https://pith.science/api/pith-number/3Z6XZHABA2LQ626CZTAANRKBUH/graph.json","events_json":"https://pith.science/api/pith-number/3Z6XZHABA2LQ626CZTAANRKBUH/events.json","paper":"https://pith.science/paper/3Z6XZHAB"},"agent_actions":{"view_html":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH","download_json":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH.json","view_paper":"https://pith.science/paper/3Z6XZHAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3303&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z6XZHABA2LQ626CZTAANRKBUH/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z6XZHABA2LQ626CZTAANRKBUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH/action/storage_attestation","attest_author":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH/action/author_attestation","sign_citation":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH/action/citation_signature","submit_replication":"https://pith.science/pith/3Z6XZHABA2LQ626CZTAANRKBUH/action/replication_record"}},"created_at":"2026-05-18T03:04:59.957407+00:00","updated_at":"2026-05-18T03:04:59.957407+00:00"}