{"id":"W2061130392","doi":"10.1007/bf02950404","title":"Decision tree complexity of graph properties with dimension at most 5","year":2000,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Monotone polygon; Conjecture; Vertex (graph theory); Graph; Discrete mathematics; Theory of computation; Mathematics; Computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005705595,0.0001017808,0.0003155114,0.001110602,0.0002061655,0.00006611114,0.001352008,0.00005822957,0.00001661482],"category_scores_gemma":[0.00004722544,0.00005514194,0.00003725067,0.004796027,0.001836739,0.0006313963,0.0005056717,0.0001365733,0.00000362609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002600186,"about_ca_system_score_gemma":0.00008520409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000956858,"about_ca_topic_score_gemma":0.00001106379,"domain_scores_codex":[0.9985331,0.00001940846,0.0003559225,0.0002649457,0.0006075822,0.0002190821],"domain_scores_gemma":[0.998715,0.00004648035,0.0002364424,0.0003767727,0.0005322819,0.00009296175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004601938,0.0001203043,0.002980285,0.000004180612,0.00002082829,0.00004463288,0.00007019665,0.0001691326,0.002493911,0.01002078,0.0002529914,0.9837767],"study_design_scores_gemma":[0.007535228,0.02570898,0.1833887,0.0008849809,0.0002361101,0.01273424,0.000194572,0.2764528,0.1540133,0.3141018,0.02286747,0.001881785],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8249392,0.0003572618,0.1723114,0.002183106,0.00007080431,0.00003833228,6.327761e-7,0.00002441472,0.00007483597],"genre_scores_gemma":[0.8941013,0.000130375,0.1056214,0.0001115048,0.00001380259,3.795229e-7,9.671253e-8,0.000001444104,0.00001971885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.981895,"threshold_uncertainty_score":0.6767542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01945976050915833,"score_gpt":0.2235232335664495,"score_spread":0.2040634730572912,"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."}}