{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847604,0.0001853681,0.0003550832,0.0006592845,0.001089826,0.0001442374,0.001568181,0.00009859321,0.00004380712],"category_scores_gemma":[0.001125007,0.0002160893,0.0001348586,0.002031262,0.001366263,0.001139255,0.001602472,0.0005896417,0.00003774451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001764704,"about_ca_system_score_gemma":0.0007066969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002176906,"about_ca_topic_score_gemma":0.0004136105,"domain_scores_codex":[0.9963311,0.000486173,0.0002109413,0.001142426,0.0009404604,0.0008889029],"domain_scores_gemma":[0.9956844,0.000643352,0.00009072154,0.001463187,0.001782149,0.0003361589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001086161,0.001498187,0.008134273,0.001378186,0.0007661735,0.0009396077,0.01749013,0.0001982883,0.0994691,0.5024973,0.03844095,0.3281016],"study_design_scores_gemma":[0.009288676,0.001734594,0.0547573,0.0002761325,0.00007198768,0.0006668083,0.01231996,0.003806568,0.09570462,0.3619895,0.4575461,0.001837754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5419227,0.005610781,0.4267964,0.01326233,0.0007108994,0.003476901,0.0003206115,0.0005113645,0.007388073],"genre_scores_gemma":[0.8580064,0.0007768783,0.1301124,0.00003741168,0.0001395118,0.00001035758,0.000101936,0.00004139962,0.01077372],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4191052,"threshold_uncertainty_score":0.8811867,"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."}}