{"id":"W3036465868","doi":"10.48550/arxiv.2006.10957","title":"When Is Amplification Necessary for Composition in Randomized Query Complexity?","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Decision tree; Function (biology); Upper and lower bounds; Mathematics; Combinatorics; Overhead (engineering); Tree (set theory); Discrete mathematics; Computer science; Statistics; Data mining; Mathematical analysis","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.01876473,0.001691278,0.004167726,0.001432314,0.002919942,0.008167026,0.003642969,0.00510928,0.01663993],"category_scores_gemma":[0.1440961,0.002470616,0.003683235,0.001988469,0.01004973,0.04038157,0.009319465,0.01129527,0.002916752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004709525,"about_ca_system_score_gemma":0.004327272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231154,"about_ca_topic_score_gemma":0.001457192,"domain_scores_codex":[0.9726636,0.009058927,0.001622638,0.005650234,0.006708357,0.004296238],"domain_scores_gemma":[0.7931507,0.1750761,0.005732236,0.0178612,0.004568092,0.003611708],"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.004410301,0.0009968943,0.009993237,0.0010553,0.0002698405,0.001071892,0.002176582,0.08641568,0.02080447,0.7774248,0.01027078,0.08511024],"study_design_scores_gemma":[0.000286191,0.0002463162,0.001324739,0.0001231072,0.0001566797,0.0005913932,0.0002860819,0.2178183,0.009532021,0.7656107,0.003922504,0.0001019428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2339378,0.001995972,0.692962,0.02543319,0.0005547114,0.0006006481,0.0009427728,0.003495584,0.04007727],"genre_scores_gemma":[0.9076694,0.001132991,0.07320607,0.004654198,0.001579456,0.0007932692,0.0006670441,0.001097175,0.00920046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01876473,"threshold_uncertainty_score":0.09923857,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06031803637100492,"score_gpt":0.2985062379972715,"score_spread":0.2381882016262666,"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."}}