{"id":"W2079344815","doi":"10.1142/s0129054106004042","title":"AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Distributed algorithm; Asynchronous communication; Computer science; Enhanced Data Rates for GSM Evolution; Time complexity; Algorithm; Binary logarithm; Message passing; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Distributed computing; Computer network; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.001232801,0.0001186037,0.0002179966,0.0004000567,0.0001834075,0.0005392055,0.002958851,0.00003280499,0.000003077149],"category_scores_gemma":[0.00006674944,0.0001065007,0.0001430682,0.0006525654,0.0002558317,0.001558154,0.0001476246,0.0000893511,0.000002410898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001606777,"about_ca_system_score_gemma":0.0004398449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003658237,"about_ca_topic_score_gemma":0.000003985689,"domain_scores_codex":[0.9977773,0.00004063236,0.0006934328,0.0002835034,0.0009875151,0.0002176126],"domain_scores_gemma":[0.9951161,0.000164989,0.000718597,0.0003582101,0.003539233,0.0001028382],"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.00002972255,0.001712916,0.000805135,0.00001274089,0.00009191075,0.00002645355,0.0003933032,0.212721,0.006498683,0.222873,0.001339666,0.5534955],"study_design_scores_gemma":[0.0006914124,0.0002230014,0.01103962,0.00004760182,0.000005866265,0.0001331007,0.000009354546,0.9775371,0.003518465,0.003998229,0.002666345,0.0001298761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05103299,0.00002843694,0.9451109,0.0005043618,0.003026425,0.0001213808,0.00008389558,0.00002498239,0.00006667486],"genre_scores_gemma":[0.692556,9.053973e-7,0.3070416,0.00002862674,0.0003508991,0.000003137799,0.00001170069,0.000002958308,0.000004202363],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7648161,"threshold_uncertainty_score":0.5498331,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01118293659171928,"score_gpt":0.2938261480125202,"score_spread":0.2826432114208009,"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."}}