{"id":"W2951684049","doi":"10.1002/rsa.20598","title":"Improved bounds for the randomized decision tree Complexity of recursive majority","year":2015,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Decision tree; Computer science; Tree (set theory); Recursive partitioning; Theoretical computer science; Mathematics; Machine learning; Combinatorics","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.006818144,0.001257647,0.001882444,0.001570823,0.001402181,0.004026255,0.004082324,0.002253836,0.009384719],"category_scores_gemma":[0.03384617,0.0005932011,0.002037799,0.001461568,0.003524909,0.008015186,0.004983535,0.006049405,0.001430407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004547804,"about_ca_system_score_gemma":0.003837096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002049691,"about_ca_topic_score_gemma":0.002390715,"domain_scores_codex":[0.9878653,0.003506224,0.0005306982,0.001792168,0.004563416,0.00174215],"domain_scores_gemma":[0.9584361,0.03093414,0.001445343,0.005457627,0.002904239,0.000822477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00132301,0.0005703892,0.002963098,0.0004560229,0.0001833423,0.0002569195,0.0004060338,0.2190595,0.0169903,0.6563666,0.01041978,0.09100495],"study_design_scores_gemma":[0.0001296472,0.0001210487,0.0005673023,0.00005408752,0.00007408224,0.000100182,0.00004091444,0.6930017,0.008147062,0.2954097,0.002306384,0.00004786814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1142129,0.001524013,0.855591,0.003739622,0.000356984,0.0002737765,0.0005142429,0.001665157,0.02212232],"genre_scores_gemma":[0.7804252,0.0005411851,0.2090883,0.00107582,0.0004299376,0.0004880397,0.0006201892,0.0005211626,0.006810164],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009384719,"threshold_uncertainty_score":0.03605825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04138630458639728,"score_gpt":0.2870490232514411,"score_spread":0.2456627186650438,"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."}}