{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356963,0.0006887971,0.001159581,0.001245888,0.002347524,0.001828181,0.001429744,0.001994505,0.006302049],"category_scores_gemma":[0.008820392,0.0007973968,0.001714842,0.0008045604,0.005642987,0.009785225,0.004745918,0.005766102,0.001014313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001200891,"about_ca_system_score_gemma":0.0006013867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002764161,"about_ca_topic_score_gemma":0.002672828,"domain_scores_codex":[0.9980251,0.0006118987,0.0001010554,0.0005037243,0.0004398313,0.0003184412],"domain_scores_gemma":[0.9932055,0.004349578,0.0002223763,0.001189699,0.0004659717,0.0005667958],"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.00002669823,0.00001384265,0.000199343,0.00006482534,0.000008014887,0.00009888314,0.0003347653,0.0008900099,0.001284851,0.9902037,0.002434676,0.004440401],"study_design_scores_gemma":[0.00002269816,0.00005430812,0.000266352,0.00003331365,0.00001450931,0.0001482993,0.0001683384,0.005454366,0.001570776,0.967418,0.02481966,0.00002938086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2029984,0.009298238,0.5190993,0.02262346,0.003186449,0.0001479634,0.0005081148,0.001184498,0.2409537],"genre_scores_gemma":[0.8555591,0.004251451,0.09680664,0.003126902,0.001859721,0.0001197429,0.0003180318,0.0005305034,0.03742795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006302049,"threshold_uncertainty_score":0.02108246,"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."}}