{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008619079,0.001124448,0.001342484,0.001290405,0.001869421,0.003554219,0.00221947,0.00187677,0.004069925],"category_scores_gemma":[0.07350697,0.000704208,0.0008933448,0.00149704,0.002709955,0.008073768,0.002947684,0.002770875,0.0006781311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002951691,"about_ca_system_score_gemma":0.002422059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007632981,"about_ca_topic_score_gemma":0.001082396,"domain_scores_codex":[0.9927861,0.002456249,0.000325694,0.001057748,0.001701384,0.001672821],"domain_scores_gemma":[0.8671459,0.113246,0.006329806,0.008125555,0.002444834,0.002707961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0046979,0.0005165958,0.003643552,0.0008741268,0.0001564325,0.0003491544,0.001252063,0.593219,0.03572197,0.2702781,0.006086446,0.08320454],"study_design_scores_gemma":[0.0001460805,0.0005058826,0.0009090403,0.00008289114,0.0001036241,0.000256616,0.0002477242,0.8614305,0.01044321,0.123292,0.002520823,0.00006163496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3145046,0.004759436,0.6467813,0.005163237,0.0003451314,0.000286966,0.0006921451,0.001555565,0.0259116],"genre_scores_gemma":[0.9113077,0.00153721,0.08269621,0.0004176253,0.0002656872,0.0002602434,0.0002909084,0.0004151937,0.002809244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008619079,"threshold_uncertainty_score":0.04558265,"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."}}