{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009937334,0.002626231,0.003394947,0.001924676,0.0019704,0.006321714,0.005669223,0.002954481,0.01634555],"category_scores_gemma":[0.06809301,0.001381366,0.003605268,0.003152049,0.006587212,0.02207142,0.01031423,0.009990661,0.00315747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007254428,"about_ca_system_score_gemma":0.00605929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002110981,"about_ca_topic_score_gemma":0.001886055,"domain_scores_codex":[0.9816651,0.005484801,0.0008309575,0.004023433,0.005376582,0.002619165],"domain_scores_gemma":[0.9117302,0.06800141,0.002623732,0.01203655,0.003308086,0.002300033],"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.001519845,0.0005330705,0.003000285,0.0006821997,0.0001757595,0.000216651,0.0005541359,0.09379037,0.005806599,0.8101034,0.01469367,0.06892408],"study_design_scores_gemma":[0.000190511,0.0001093267,0.0006519501,0.00005488256,0.00008297791,0.0001519879,0.00008745785,0.3238995,0.003680062,0.6682467,0.002792911,0.00005177336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08297513,0.00233446,0.8636179,0.01018852,0.0003285934,0.0002717404,0.001221593,0.002172075,0.03689007],"genre_scores_gemma":[0.7917203,0.001499896,0.1842612,0.003440186,0.001141028,0.00109734,0.001425319,0.001380916,0.01403368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01634555,"threshold_uncertainty_score":0.05468136,"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."}}