{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CJVPHUV2IN4Z4KJGPNWZELYTTM","short_pith_number":"pith:CJVPHUV2","schema_version":"1.0","canonical_sha256":"126af3d2ba43799e29267b6d922f139b154c8ad73fcfeabf5715496c07c24005","source":{"kind":"arxiv","id":"0905.2287","version":1},"attestation_state":"computed","paper":{"title":"A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"L\\'elia Blin (IBISC), LIP6), Maria Gradinariu Potop-Butucaru (INRIA Rocquencourt), S\\'ebastien Tixeuil (INRIA Futurs, Stephane Rovedakis (IBISC)","submitted_at":"2009-05-14T09:23:06Z","abstract_excerpt":"The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle any kind of transient faults in a unified manner. The loop-free property provides interesting safety assurance in dynamic networks where edge-cost changes during operation of the protocol. We present a new self-stabilizing MST protocol that improves on previous known ap- proaches in several ways. First, it makes fewer system hypotheses as the size of the netwo"},"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":"0905.2287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-05-14T09:23:06Z","cross_cats_sorted":["cs.DC","cs.NI"],"title_canon_sha256":"603ea80c272a517d6389d09907ab55e3c390eb521c2aacd95f09496a959c235c","abstract_canon_sha256":"6eabf77b76019ae84b05c5998eae8e88016b91821629b5135f970734ab24061a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:58.689390Z","signature_b64":"TorvnMzUhEtucNL0hvdymYpQf9NvJaAQSiaDf6p239EjMcfnjog84UMijEH56Notx/3/z78EXX8+4Axt5Wi8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"126af3d2ba43799e29267b6d922f139b154c8ad73fcfeabf5715496c07c24005","last_reissued_at":"2026-05-18T00:56:58.688795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:58.688795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"L\\'elia Blin (IBISC), LIP6), Maria Gradinariu Potop-Butucaru (INRIA Rocquencourt), S\\'ebastien Tixeuil (INRIA Futurs, Stephane Rovedakis (IBISC)","submitted_at":"2009-05-14T09:23:06Z","abstract_excerpt":"The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle any kind of transient faults in a unified manner. The loop-free property provides interesting safety assurance in dynamic networks where edge-cost changes during operation of the protocol. We present a new self-stabilizing MST protocol that improves on previous known ap- proaches in several ways. First, it makes fewer system hypotheses as the size of the netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.2287","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":"0905.2287","created_at":"2026-05-18T00:56:58.688887+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.2287v1","created_at":"2026-05-18T00:56:58.688887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2287","created_at":"2026-05-18T00:56:58.688887+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJVPHUV2IN4Z","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJVPHUV2IN4Z4KJG","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJVPHUV2","created_at":"2026-05-18T12:25:59.703012+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/CJVPHUV2IN4Z4KJGPNWZELYTTM","json":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM.json","graph_json":"https://pith.science/api/pith-number/CJVPHUV2IN4Z4KJGPNWZELYTTM/graph.json","events_json":"https://pith.science/api/pith-number/CJVPHUV2IN4Z4KJGPNWZELYTTM/events.json","paper":"https://pith.science/paper/CJVPHUV2"},"agent_actions":{"view_html":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM","download_json":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM.json","view_paper":"https://pith.science/paper/CJVPHUV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.2287&json=true","fetch_graph":"https://pith.science/api/pith-number/CJVPHUV2IN4Z4KJGPNWZELYTTM/graph.json","fetch_events":"https://pith.science/api/pith-number/CJVPHUV2IN4Z4KJGPNWZELYTTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM/action/storage_attestation","attest_author":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM/action/author_attestation","sign_citation":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM/action/citation_signature","submit_replication":"https://pith.science/pith/CJVPHUV2IN4Z4KJGPNWZELYTTM/action/replication_record"}},"created_at":"2026-05-18T00:56:58.688887+00:00","updated_at":"2026-05-18T00:56:58.688887+00:00"}