{"id":"W2137031274","doi":"10.1007/3-540-45414-4_14","title":"Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Spanning tree; Computer science; Distributed minimum spanning tree; Minimum spanning tree; Message passing; Atomicity; Identifier; Self-stabilization; Tree (set theory); Distributed computing; Connected dominating set; Euclidean minimum spanning tree; Theoretical computer science; Distributed algorithm; Algorithm; Computer network; Discrete mathematics; Combinatorics; Mathematics; Database transaction","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628391,0.0002633538,0.0005115792,0.0005560213,0.0006109518,0.0005486463,0.001031164,0.0005562005,0.001075149],"category_scores_gemma":[0.00132086,0.0003002165,0.0003036113,0.0007381148,0.0003826934,0.001071246,0.000988757,0.000678194,0.0002742778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004030264,"about_ca_system_score_gemma":0.0003992532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004942448,"about_ca_topic_score_gemma":0.0006244855,"domain_scores_codex":[0.9997743,0.00006897694,0.00001214957,0.00003546838,0.00008328917,0.00002577623],"domain_scores_gemma":[0.9995216,0.0001880989,0.00004487838,0.0001199721,0.00009184991,0.00003356119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003107761,0.00017625,0.0008725434,0.0003183256,0.00007542543,0.0001782764,0.0004220865,0.350953,0.06255902,0.242053,0.006347425,0.3357339],"study_design_scores_gemma":[0.000034808,0.00008198925,0.0003253186,0.00001967554,0.0000280027,0.0001022108,0.00004016032,0.8750899,0.01365741,0.1072842,0.003321474,0.0000147462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07122228,0.0002444913,0.9231386,0.0002149382,0.00005597932,0.00005354243,0.00004982542,0.0007288359,0.004291569],"genre_scores_gemma":[0.6261163,0.0003537718,0.3676031,0.00005982596,0.00005486196,0.0001374142,0.0002170276,0.0001347777,0.005322863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001075149,"threshold_uncertainty_score":0.003596723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01406585157854846,"score_gpt":0.2336594783033897,"score_spread":0.2195936267248413,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}