{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00223458,0.0006368509,0.001966724,0.001999794,0.001203783,0.00519612,0.002211451,0.001966597,0.008021026],"category_scores_gemma":[0.02337809,0.0007583198,0.0015196,0.002635327,0.001904438,0.01002441,0.002115264,0.003382533,0.0004587519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002783193,"about_ca_system_score_gemma":0.00189848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002274257,"about_ca_topic_score_gemma":0.002713765,"domain_scores_codex":[0.9972125,0.0006530234,0.0001717477,0.0005044626,0.0009272477,0.000531002],"domain_scores_gemma":[0.95617,0.03632225,0.002247631,0.002213839,0.00131533,0.001730927],"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.001708926,0.0007107006,0.02202812,0.0007300896,0.0003239263,0.0005960332,0.000903891,0.2011312,0.007093917,0.6494648,0.02162479,0.09368362],"study_design_scores_gemma":[0.00009995323,0.00009056921,0.002524153,0.00003283827,0.00008545181,0.0003718717,0.0001523144,0.4258934,0.00153423,0.5675629,0.001626347,0.00002600095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7638748,0.001303003,0.2117766,0.005497378,0.0000881292,0.0001908772,0.003920381,0.0008053407,0.01254346],"genre_scores_gemma":[0.9598476,0.0005346343,0.03405684,0.0002951017,0.000162546,0.0001316452,0.002328325,0.0001252238,0.002518136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008021026,"threshold_uncertainty_score":0.026833,"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."}}