{"id":"W2084175966","doi":"10.1504/ijhpcn.2011.038709","title":"A self-stabilising algorithm for 3-edge-connectivity","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Enhanced Data Rates for GSM Evolution; Computation; Spanning tree; Distributed algorithm; Algorithm; Fault tolerance; Self-stabilization; Distributed minimum spanning tree; Minimum spanning tree; Tree (set theory); Distributed computing; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0008380619,0.0001180903,0.0002150595,0.000110847,0.0001626945,0.0001592687,0.0006184753,0.00004561812,0.000001005106],"category_scores_gemma":[0.00001189402,0.0001041692,0.00007350533,0.0001197858,0.00002489571,0.0005553906,0.0001425853,0.0001648605,7.277465e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005556178,"about_ca_system_score_gemma":0.00004528581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001020582,"about_ca_topic_score_gemma":7.912481e-7,"domain_scores_codex":[0.9988714,0.00003451397,0.0004350221,0.0001809806,0.000262228,0.0002158652],"domain_scores_gemma":[0.9987649,0.0001451892,0.0004503645,0.0001094329,0.0004626582,0.00006747435],"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.00002319971,0.00007177222,0.004164067,0.00001959711,0.0001061946,0.00001888299,0.001609967,0.000329117,0.00001511254,0.001221139,0.00008670683,0.9923342],"study_design_scores_gemma":[0.0008302776,0.0001905066,0.007547934,0.0003343148,0.00001083594,0.0004737354,0.00003668272,0.9842066,0.000350253,0.0006232268,0.005233225,0.0001623744],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3151107,0.000426125,0.6810264,0.0000519747,0.003135005,0.00005656993,0.000001520462,0.00003641874,0.0001552505],"genre_scores_gemma":[0.8394988,0.00009777262,0.1591869,0.00006234527,0.001141755,0.000001031162,7.945267e-7,0.000006325556,0.000004315901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9921719,"threshold_uncertainty_score":0.4247896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01976199835953035,"score_gpt":0.2508301788918436,"score_spread":0.2310681805323132,"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."}}