{"id":"W2951157870","doi":"10.1137/1.9781611974331.ch44","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Upper and lower bounds; Node (physics); Logarithm; Computer science; Computer network; String (physics); Binary logarithm; Advice (programming); Tree (set theory); Time complexity; Discrete mathematics; Mathematics; Combinatorics; 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.0004917993,0.0002088695,0.0003292337,0.0001995519,0.00003963918,0.0003451504,0.0006640265,0.0003000657,0.000008261231],"category_scores_gemma":[0.00003906326,0.0001902673,0.00009498965,0.0002444368,0.00001856035,0.0009680751,0.0001784565,0.0002508455,0.0001245699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001840454,"about_ca_system_score_gemma":0.0002434023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000201541,"about_ca_topic_score_gemma":0.0001152942,"domain_scores_codex":[0.9985912,0.00004091551,0.0005023858,0.0003220006,0.0002601703,0.0002833513],"domain_scores_gemma":[0.9990238,0.00002991474,0.0002094949,0.0004653435,0.0001996978,0.00007175317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001883763,0.0004495114,0.00028843,0.0009904021,0.000126024,0.000008873943,0.01084899,0.05710909,0.0003312295,0.03406981,0.6310889,0.2645004],"study_design_scores_gemma":[0.0008305721,0.0001147178,0.0007682292,0.0001081212,0.000005633697,0.00001162978,0.00005884011,0.8685022,0.000270037,0.00271609,0.126197,0.0004169379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003998728,0.0001190461,0.9798713,0.001711937,0.001121323,0.001118297,0.0000750586,0.0003418162,0.01164253],"genre_scores_gemma":[0.967536,0.00001893875,0.02225187,0.0008533115,0.0004222332,0.0006918202,0.0008399828,0.00002625233,0.007359548],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9635373,"threshold_uncertainty_score":0.7758877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02140562872449713,"score_gpt":0.2534460718057035,"score_spread":0.2320404430812064,"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."}}