{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HFREUK67IQ6OLUESHYJOKFVQMA","short_pith_number":"pith:HFREUK67","schema_version":"1.0","canonical_sha256":"39624a2bdf443ce5d0923e12e516b0603b7ce130fdd7c7cdc1f6404f788ed82b","source":{"kind":"arxiv","id":"1311.0798","version":1},"attestation_state":"computed","paper":{"title":"Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"L\\'elia Blin (LIP6), Maria Gradinariu Potop-Butucaru (LIP6), Shlomi Dolev, Stephane Rovedakis (CEDRIC)","submitted_at":"2013-11-04T18:17:47Z","abstract_excerpt":"We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor $\\Theta(n)$, to the price of increasing the best known space complexity by a factor $O(\\log n)$. The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with"},"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":"1311.0798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-04T18:17:47Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"5c353a3f4d1f487629e47de1e9532457c268c31fd2c371040e512cee5f7a46be","abstract_canon_sha256":"fc303b32df7a63e9aad8dfb2faa252585e6f3c8ad2e7fc369691c31f3d97dc65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:04.807736Z","signature_b64":"G7UTtdnWqLRIu83oDqxN5I4299MYUsxYfCXH6djwULDrMD/itAsssX10swCewlKCPye1f9rRCyvKHzLB6NSvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39624a2bdf443ce5d0923e12e516b0603b7ce130fdd7c7cdc1f6404f788ed82b","last_reissued_at":"2026-05-18T03:08:04.807115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:04.807115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"L\\'elia Blin (LIP6), Maria Gradinariu Potop-Butucaru (LIP6), Shlomi Dolev, Stephane Rovedakis (CEDRIC)","submitted_at":"2013-11-04T18:17:47Z","abstract_excerpt":"We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor $\\Theta(n)$, to the price of increasing the best known space complexity by a factor $O(\\log n)$. The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0798","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":"1311.0798","created_at":"2026-05-18T03:08:04.807229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0798v1","created_at":"2026-05-18T03:08:04.807229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0798","created_at":"2026-05-18T03:08:04.807229+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFREUK67IQ6O","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFREUK67IQ6OLUES","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFREUK67","created_at":"2026-05-18T12:27:46.883200+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/HFREUK67IQ6OLUESHYJOKFVQMA","json":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA.json","graph_json":"https://pith.science/api/pith-number/HFREUK67IQ6OLUESHYJOKFVQMA/graph.json","events_json":"https://pith.science/api/pith-number/HFREUK67IQ6OLUESHYJOKFVQMA/events.json","paper":"https://pith.science/paper/HFREUK67"},"agent_actions":{"view_html":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA","download_json":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA.json","view_paper":"https://pith.science/paper/HFREUK67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0798&json=true","fetch_graph":"https://pith.science/api/pith-number/HFREUK67IQ6OLUESHYJOKFVQMA/graph.json","fetch_events":"https://pith.science/api/pith-number/HFREUK67IQ6OLUESHYJOKFVQMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/action/storage_attestation","attest_author":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/action/author_attestation","sign_citation":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/action/citation_signature","submit_replication":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/action/replication_record"}},"created_at":"2026-05-18T03:08:04.807229+00:00","updated_at":"2026-05-18T03:08:04.807229+00:00"}