{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001934254,0.0002836451,0.0009045404,0.0001093602,0.0004004014,0.0002328989,0.0009795751,0.0001093999,0.000007348871],"category_scores_gemma":[0.0007229195,0.0001687358,0.000383226,0.0003210319,0.001016727,0.0002605489,0.0003441279,0.0002089181,3.862754e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002460853,"about_ca_system_score_gemma":0.00009697856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000266162,"about_ca_topic_score_gemma":0.00006059196,"domain_scores_codex":[0.99794,0.0002228142,0.0005693843,0.0004854901,0.0004222158,0.0003600894],"domain_scores_gemma":[0.9957585,0.002735603,0.0003061967,0.000649792,0.0003610741,0.0001887938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.02472418,0.00007127596,0.00001793217,0.00004942018,0.000302609,0.000003535002,0.001933232,0.00009823069,0.00008416204,0.4273868,0.00128215,0.5440465],"study_design_scores_gemma":[0.1126192,0.000142444,0.0001931211,0.0000167954,0.00006140623,0.00002792462,0.0001092055,0.2755961,0.0004389564,0.6093004,0.001307437,0.0001871232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00511101,0.003015101,0.9876695,0.0009894739,0.00149444,0.001401631,0.00006369272,0.00006879949,0.0001863775],"genre_scores_gemma":[0.3754938,0.0003823941,0.6230624,0.0002798603,0.0005022366,0.0001517627,0.00001860543,0.00002383314,0.00008520904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5438594,"threshold_uncertainty_score":0.6880844,"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."}}