{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001813933,0.000859042,0.002050569,0.0007354767,0.0004324375,0.001252049,0.00319786,0.0006284826,0.0000274177],"category_scores_gemma":[0.0001884553,0.0008709368,0.001211304,0.0004306736,0.000406067,0.001581762,0.002163785,0.001248728,0.00005358549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002789103,"about_ca_system_score_gemma":0.0002512586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000139469,"about_ca_topic_score_gemma":0.00003209309,"domain_scores_codex":[0.9944271,0.0002276624,0.002786753,0.0009087169,0.0007448182,0.0009049273],"domain_scores_gemma":[0.9951174,0.0009087654,0.001527894,0.001624122,0.0005385258,0.000283271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0199479,0.002421043,0.000895766,0.01616587,0.001904528,0.00001891222,0.142414,0.001748129,0.0001130589,0.7125657,0.04987927,0.05192587],"study_design_scores_gemma":[0.0357932,0.00009866433,0.0001165992,0.0005353448,0.00007591803,0.00001374338,0.0003348392,0.612438,0.0002976944,0.3423274,0.007141764,0.000826855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007319637,0.0001413739,0.9724376,0.007202311,0.002108036,0.007205495,0.002235822,0.0004495038,0.0009002354],"genre_scores_gemma":[0.2795457,0.0001955819,0.699079,0.007667136,0.0006130561,0.003506108,0.009199172,0.0001226987,0.00007157154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6106899,"threshold_uncertainty_score":0.9997848,"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."}}