{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001067127,0.0007500164,0.0007886872,0.0007043353,0.0005679071,0.001238392,0.002655611,0.0005275604,0.00001245772],"category_scores_gemma":[0.00005954018,0.0007095617,0.0002027193,0.001020081,0.0005597568,0.0008287869,0.0007214292,0.001241893,0.00002875317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005974031,"about_ca_system_score_gemma":0.0004028089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001479968,"about_ca_topic_score_gemma":0.00003488133,"domain_scores_codex":[0.9948313,0.00007336566,0.0008304159,0.002061456,0.001175692,0.001027785],"domain_scores_gemma":[0.9968478,0.0004931893,0.0005696733,0.001575511,0.0002663698,0.0002474356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008627498,0.00004000664,0.0001287612,0.00005224148,0.0000217574,0.0002181347,0.0005095505,0.123914,0.00003547802,0.03088862,0.00004844451,0.8441343],"study_design_scores_gemma":[0.0003926405,0.0001712398,0.00009596367,0.001214779,0.00001228278,0.0002521579,9.354382e-7,0.9695004,0.0001316443,0.01787157,0.009455019,0.0009013889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009977239,0.0006396627,0.972407,0.0004202987,0.004203543,0.0004419334,0.000004661262,0.0004337808,0.02134934],"genre_scores_gemma":[0.4655026,0.0001466867,0.5300182,0.001525279,0.002289542,0.00002667399,0.00001886477,0.0001081621,0.0003639703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8455864,"threshold_uncertainty_score":0.9997984,"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."}}