{"id":"W1810597274","doi":"10.4230/lipics.approx-random.2015.915","title":"Separating Decision Tree Complexity from Subcube Partition Complexity","year":2015,"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":"Upper and lower bounds; Mathematics; Combinatorics; Partition (number theory); Computational complexity theory; Discrete mathematics; Randomized algorithm; Time complexity; Algorithm","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.004923667,0.0009589887,0.002056133,0.001595607,0.001925323,0.007118109,0.003821373,0.002643763,0.007686327],"category_scores_gemma":[0.03338387,0.0008078034,0.002434066,0.002573739,0.005009975,0.01632971,0.005624448,0.007925807,0.001016604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005780852,"about_ca_system_score_gemma":0.003392795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002576139,"about_ca_topic_score_gemma":0.002570649,"domain_scores_codex":[0.9890832,0.0029494,0.0004779776,0.002486361,0.00343058,0.001572553],"domain_scores_gemma":[0.9459072,0.03955992,0.002060649,0.009562601,0.001726672,0.001182962],"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.000214223,0.00008497076,0.001376862,0.0001637439,0.00005258875,0.00006475365,0.0002509132,0.0590666,0.00208324,0.9133629,0.003198385,0.02008076],"study_design_scores_gemma":[0.00002352492,0.0000323957,0.0004423515,0.00003020896,0.00002983521,0.0000764481,0.00005515006,0.1927082,0.001959416,0.8017159,0.002900437,0.00002624545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1193371,0.0009868573,0.8458413,0.004991753,0.0001315542,0.0002093631,0.0009127621,0.0006495976,0.02693971],"genre_scores_gemma":[0.8906458,0.00132195,0.09688123,0.001175888,0.0004118865,0.0005856653,0.001111553,0.0004760134,0.007389992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007686327,"threshold_uncertainty_score":0.04194319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1036924692433647,"score_gpt":0.3225837877556316,"score_spread":0.2188913185122669,"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."}}