{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017904,0.001235863,0.001620138,0.0005526606,0.0009544059,0.002178835,0.004823443,0.0008969892,0.00009538882],"category_scores_gemma":[0.000341519,0.001232984,0.000929944,0.0006065082,0.0006434596,0.002255884,0.006343644,0.002052574,0.00032176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005528189,"about_ca_system_score_gemma":0.0004404707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004873847,"about_ca_topic_score_gemma":0.0008144978,"domain_scores_codex":[0.9926248,0.000219268,0.002815982,0.001196041,0.001727002,0.001416865],"domain_scores_gemma":[0.9926059,0.0006675043,0.001696318,0.003222311,0.001123825,0.0006841429],"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.001356619,0.00454521,0.01021957,0.003746957,0.002439937,0.0001166372,0.06112311,0.01033546,0.0000832873,0.4042608,0.1497331,0.3520393],"study_design_scores_gemma":[0.002458543,0.000216691,0.001808535,0.0005999548,0.00007147886,0.0000296854,0.0003668225,0.5920284,0.000175878,0.3813952,0.01961293,0.001235849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1368957,0.0002084064,0.8420474,0.000596584,0.005562571,0.00228233,0.005561805,0.000970793,0.005874379],"genre_scores_gemma":[0.3313659,0.00006800487,0.6572801,0.001246835,0.0009730592,0.0003614842,0.008499615,0.0001070256,0.00009795884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5816929,"threshold_uncertainty_score":0.999012,"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."}}