{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008596812,0.001135437,0.001338033,0.001253041,0.001916514,0.003504558,0.002168692,0.001819588,0.003932479],"category_scores_gemma":[0.07282222,0.0007112934,0.0008842596,0.001467035,0.002775068,0.008129937,0.002963166,0.002802959,0.0006548286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002958975,"about_ca_system_score_gemma":0.002441286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007793252,"about_ca_topic_score_gemma":0.001096942,"domain_scores_codex":[0.9928584,0.002461202,0.000321187,0.001044366,0.001678684,0.001636095],"domain_scores_gemma":[0.8700913,0.1109001,0.006283675,0.00774022,0.002392171,0.002592679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004474426,0.0004941949,0.003440441,0.0008323914,0.0001547069,0.0003420894,0.001250055,0.5918868,0.03378066,0.2784647,0.005832421,0.0790471],"study_design_scores_gemma":[0.0001439477,0.0005092213,0.0008608231,0.000080665,0.0001027773,0.0002427042,0.0002493782,0.85953,0.01016931,0.1255435,0.002507373,0.0000603161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3163125,0.004623321,0.6450948,0.0051379,0.0003460711,0.0002885866,0.0006485864,0.001497919,0.0260504],"genre_scores_gemma":[0.9115172,0.001540461,0.08245182,0.0004070663,0.0002659663,0.0002635141,0.0002797804,0.000405148,0.002868946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008596812,"threshold_uncertainty_score":0.04546481,"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."}}