{"id":"W3127093867","doi":"10.1109/focs46700.2020.00031","title":"A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract","year":2020,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Composition (language); Mathematics; Conjecture; Measure (data warehouse); Characterization (materials science); Boolean function; Function (biology); Oracle; Randomized algorithm; Discrete mathematics; Type (biology); Physics; Computer science","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.01968854,0.002734906,0.004581633,0.003399816,0.003932554,0.01055779,0.006479797,0.003747115,0.02064303],"category_scores_gemma":[0.08703522,0.002715906,0.007023375,0.003880304,0.008904017,0.03288177,0.01463581,0.01341732,0.003384836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007522975,"about_ca_system_score_gemma":0.00622707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002479214,"about_ca_topic_score_gemma":0.001355048,"domain_scores_codex":[0.9676039,0.006348514,0.001950789,0.007361155,0.01230854,0.004427154],"domain_scores_gemma":[0.8909903,0.07882181,0.005223935,0.01627942,0.005690868,0.002993695],"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.001618171,0.0007752466,0.003952565,0.0008608809,0.0003081164,0.0004071447,0.000799954,0.06671502,0.01488911,0.8545141,0.007454951,0.04770487],"study_design_scores_gemma":[0.0002007254,0.0002062696,0.0009383139,0.00008448579,0.0001702644,0.0003716768,0.0001128264,0.3078371,0.01304554,0.6727103,0.00422552,0.00009698164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07030842,0.001046304,0.8996037,0.004756452,0.0002874438,0.0003799458,0.0007863347,0.002772254,0.02005922],"genre_scores_gemma":[0.7534665,0.001065214,0.2231565,0.003140301,0.001555875,0.001696986,0.001554933,0.001790553,0.01257319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02064303,"threshold_uncertainty_score":0.1041241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0623333746463483,"score_gpt":0.2754493478310923,"score_spread":0.213115973184744,"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."}}