{"id":"W2619218210","doi":"10.1145/3039870","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Leader election; Node (physics); Logarithm; Upper and lower bounds; Computer science; String (physics); Tree (set theory); Binary logarithm; Computer network; Advice (programming); Time complexity; Simple (philosophy); Multiplicative function; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Algorithm","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.0002870316,0.000202387,0.0002208451,0.0003949599,0.0008925198,0.0004730572,0.001466547,0.0001333394,0.00003832233],"category_scores_gemma":[0.00006439346,0.0002084906,0.0001639566,0.0002761571,0.0001193044,0.002602858,0.00001970989,0.0002826884,0.0001111416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008746435,"about_ca_system_score_gemma":0.00006306247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001324544,"about_ca_topic_score_gemma":0.0001452754,"domain_scores_codex":[0.9986556,0.00003596916,0.0003356759,0.0003292106,0.0002676364,0.000375945],"domain_scores_gemma":[0.9983211,0.0001498182,0.0001464172,0.001218866,0.00008089768,0.0000828925],"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.00004153917,0.0001994921,0.00001172406,0.00001468603,0.00002645948,0.000002476334,0.0008070814,0.0009842801,0.0001223926,0.001172919,0.0002727541,0.9963442],"study_design_scores_gemma":[0.003921564,0.001097508,0.01489881,0.00009616202,0.00003565012,0.00007241043,0.0001514692,0.90786,0.01143496,0.02711806,0.03240108,0.0009123362],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002251275,0.00001524286,0.9907219,0.00492559,0.0007955822,0.0004584333,0.00003521375,0.0002185372,0.0005782453],"genre_scores_gemma":[0.6192331,0.00009318751,0.3772035,0.001022681,0.0002514652,0.0004649119,0.00003241953,0.00003719303,0.001661614],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9954318,"threshold_uncertainty_score":0.8502001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02881095360955493,"score_gpt":0.2745985513117078,"score_spread":0.2457875977021529,"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."}}