{"id":"W3124632410","doi":"10.1016/j.jctb.2021.01.005","title":"Obstructions for bounded shrub-depth and rank-depth","year":2021,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Institute for Basic Science; National Research Foundation of Korea; Ministry of Education","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Path (computing); Graph; Rank (graph theory); Planar graph; Discrete mathematics; Computer science; Mathematical analysis","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.001026004,0.0006971675,0.0009898753,0.001780182,0.001899705,0.003143064,0.001375309,0.001454142,0.01298643],"category_scores_gemma":[0.008664141,0.0006513462,0.001500726,0.001146826,0.00406323,0.009347417,0.005607071,0.004038964,0.001175629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258929,"about_ca_system_score_gemma":0.0007523986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001378248,"about_ca_topic_score_gemma":0.001427646,"domain_scores_codex":[0.9982179,0.0002473477,0.00008985231,0.000479015,0.0004265029,0.0005394297],"domain_scores_gemma":[0.987815,0.006452041,0.001264261,0.001683832,0.0008018251,0.001983097],"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.0001531264,0.00005892738,0.00223909,0.0001590269,0.00002057041,0.0002683061,0.0006791903,0.003187728,0.003796624,0.9787353,0.003195342,0.007506746],"study_design_scores_gemma":[0.00004503127,0.00006303423,0.001697152,0.00003582042,0.00003260186,0.0004897516,0.0002847614,0.01242557,0.001861548,0.9760599,0.006955802,0.00004903216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6673507,0.001365683,0.2301633,0.003437648,0.0002691106,0.0001543979,0.001984879,0.001479495,0.09379464],"genre_scores_gemma":[0.9724509,0.0005145466,0.01786988,0.0005139326,0.0002307757,0.0001013471,0.0007155649,0.000309086,0.007293989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01298643,"threshold_uncertainty_score":0.04344392,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05923293731809692,"score_gpt":0.3299033342613608,"score_spread":0.2706703969432638,"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."}}