{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981333,0.0004748158,0.0004398557,0.0008414132,0.00073005,0.0006347683,0.001316856,0.001010778,0.002772272],"category_scores_gemma":[0.00305244,0.0002498752,0.0004668487,0.0006841583,0.0008807507,0.001448356,0.00174225,0.0009482264,0.0007795061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00052414,"about_ca_system_score_gemma":0.00075394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001104731,"about_ca_topic_score_gemma":0.001259377,"domain_scores_codex":[0.9995363,0.0000901333,0.00003607937,0.0001201936,0.0001567856,0.00006049463],"domain_scores_gemma":[0.9989446,0.0003899257,0.0001280271,0.0002464088,0.0002266154,0.00006451146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005253188,0.0001890317,0.001479473,0.0002436707,0.00006532726,0.0003377863,0.0006686726,0.266962,0.0667787,0.1418853,0.00731437,0.5135504],"study_design_scores_gemma":[0.00009593039,0.0002065818,0.0002923187,0.00002646684,0.00001954851,0.0002800965,0.00006450284,0.9024101,0.01555045,0.07397819,0.007036772,0.00003902045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0191854,0.0001072053,0.9770944,0.0001364715,0.00002945341,0.00007922309,0.00003431804,0.001108789,0.002224791],"genre_scores_gemma":[0.4020811,0.0001255963,0.5938416,0.0001386851,0.00003034712,0.0002168409,0.0001861724,0.000145663,0.003234038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002772272,"threshold_uncertainty_score":0.009274185,"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."}}