{"id":"W1598672207","doi":"10.37236/2533","title":"A Note on Forbidding Clique Immersions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Digraph; Eulerian path; Clique; Discrete mathematics; Graph; Structured program theorem; Immersion (mathematics); Robertson–Seymour theorem; Extremal graph theory; Pathwidth; Line graph; Pure mathematics; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"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.001403844,0.0001246147,0.0001829215,0.0001988237,0.0002397256,0.00009851113,0.001922267,0.00004870895,0.00001444037],"category_scores_gemma":[0.0001965203,0.0000788614,0.0001423741,0.000727035,0.00006237766,0.0005500086,0.0001772579,0.001169305,0.00007405001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003332284,"about_ca_system_score_gemma":0.000367735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004193193,"about_ca_topic_score_gemma":6.989105e-7,"domain_scores_codex":[0.9981011,0.0002288915,0.0002993524,0.0001299241,0.0005464817,0.0006942343],"domain_scores_gemma":[0.9981245,0.000667072,0.0002628816,0.0004964123,0.0003298807,0.0001192002],"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.00001417344,0.00006143089,0.000020213,0.000001939188,0.00002281149,0.000005128576,0.0001657566,0.0001076753,0.001024464,0.9941411,0.0005154015,0.003919892],"study_design_scores_gemma":[0.0004195959,0.0008473566,0.00012216,0.00002111573,0.000005667725,0.0001230749,0.00004491381,0.00202116,0.003689483,0.990038,0.00257363,0.00009383049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1078787,0.001032296,0.8788394,0.008759561,0.0006029226,0.0002812029,1.934112e-7,0.00003725239,0.002568438],"genre_scores_gemma":[0.9987731,0.0003348488,0.0002402091,0.000261959,0.00005331444,0.000005760587,7.550707e-8,0.00001263565,0.0003181022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8908944,"threshold_uncertainty_score":0.5080112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01142446973192866,"score_gpt":0.2835691420794096,"score_spread":0.2721446723474809,"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."}}