{"id":"W2965722881","doi":"10.4230/lipics.ccc.2019.29","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bounded function; Function (biology); Randomized algorithm; Communication complexity; Discrete mathematics; Combinatorics; 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"],"consensus_categories":[],"category_scores_codex":[0.001386905,0.0003963455,0.0008854584,0.0002482204,0.0004164444,0.0006713561,0.0008673752,0.0001679986,0.00002297202],"category_scores_gemma":[0.0001132046,0.0003516985,0.0004226747,0.0002382149,0.0002713783,0.002081165,0.0004507331,0.0002647233,0.00004077959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006915165,"about_ca_system_score_gemma":0.00007213917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003054435,"about_ca_topic_score_gemma":0.00001824459,"domain_scores_codex":[0.9973978,0.00008495268,0.001029219,0.0003960162,0.0004024699,0.0006895885],"domain_scores_gemma":[0.9976817,0.0007025231,0.0004418004,0.0007205809,0.0002730232,0.0001804079],"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.01283879,0.0008038813,0.003393138,0.002401411,0.001055964,0.000003686136,0.02356572,0.002624607,0.0001275763,0.922,0.006959768,0.02422547],"study_design_scores_gemma":[0.05496005,0.0002910754,0.0002669901,0.00009974225,0.00004804812,0.00002676704,0.0004738487,0.9196303,0.0004096594,0.006362536,0.01684783,0.0005831228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1641703,0.00008685973,0.8254043,0.0003763722,0.001368503,0.003912152,0.0004175595,0.0002846982,0.003979284],"genre_scores_gemma":[0.686546,0.00004465157,0.3109967,0.0006760921,0.000195595,0.0004613044,0.0005270193,0.000042059,0.0005104956],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9170057,"threshold_uncertainty_score":0.9998935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02231420595320773,"score_gpt":0.2829129549148793,"score_spread":0.2605987489616716,"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."}}