{"id":"W2005147105","doi":"10.1007/s00446-011-0137-5","title":"Fully-adaptive algorithms for long-lived renaming","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; University of Toronto; Dalhousie University","funders":"","keywords":"Computer science; Asynchronous communication; Algorithm; Process (computing); Bounded function; Theoretical computer science; Mathematics; Programming language; Computer network","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"],"consensus_categories":[],"category_scores_codex":[0.0005631213,0.0003204475,0.0004099818,0.00008775306,0.0004453304,0.00021514,0.001376604,0.0001378069,0.000007802539],"category_scores_gemma":[0.00007701012,0.0003190832,0.0002057208,0.0006368583,0.00006136308,0.0003752132,0.0002687321,0.0002124736,0.00003579983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001104096,"about_ca_system_score_gemma":0.00008071404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006918525,"about_ca_topic_score_gemma":0.000004079652,"domain_scores_codex":[0.9974568,0.00008520923,0.000587162,0.0007804151,0.0002992217,0.0007911223],"domain_scores_gemma":[0.9981568,0.0001712239,0.0003375348,0.0007367075,0.0003941929,0.0002035372],"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.0002250287,0.001258801,0.009931132,0.0003214941,0.0007215747,0.0004704336,0.01091968,0.003960981,0.001187449,0.2699546,0.0107687,0.6902802],"study_design_scores_gemma":[0.00127334,0.0002735533,0.01369445,0.0001983278,0.00002474729,0.00005969423,0.0003409345,0.9756922,0.002392248,0.002313552,0.003013257,0.0007236713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008079177,0.000208672,0.9885164,0.00007086887,0.0008670073,0.0004842289,0.0001875841,0.0005457239,0.001040266],"genre_scores_gemma":[0.903703,0.000001775923,0.09577356,0.00008726402,0.0001882354,0.00003266505,0.0001608329,0.00002068664,0.00003197459],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9717312,"threshold_uncertainty_score":0.9999261,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0666930311508916,"score_gpt":0.2723594850737362,"score_spread":0.2056664539228446,"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."}}