{"id":"W2018251139","doi":"10.1016/s0012-365x(00)00083-2","title":"Forbidden minors to graphs with small feedback sets","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Constructive; Treewidth; Pathwidth; Minor (academic); Vertex (graph theory); Discrete mathematics; Chordal graph; 1-planar graph; Constructive proof; Robertson–Seymour theorem; Maximal independent set; Clique-sum; Indifference graph; Graph; Line graph; Computer science","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.0003390877,0.0002290575,0.0002512078,0.0002206607,0.0001392237,0.0001894397,0.001390972,0.00005082005,0.00003114437],"category_scores_gemma":[0.00007821879,0.0001699953,0.00008004647,0.001084027,0.00009177233,0.0002885456,0.000385032,0.0001585335,0.0002749765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003027775,"about_ca_system_score_gemma":0.00003626271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006316452,"about_ca_topic_score_gemma":0.00004224617,"domain_scores_codex":[0.9982298,0.00004438085,0.0002569247,0.0004156218,0.0004726537,0.0005806135],"domain_scores_gemma":[0.9982315,0.000172359,0.00008618462,0.001112466,0.0001151826,0.0002822603],"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.00006131351,0.0002013051,0.001480024,0.0001644546,0.00009455531,0.0002217646,0.007461248,0.0003378509,0.0007046849,0.9627348,0.0008003284,0.02573773],"study_design_scores_gemma":[0.001078844,0.000762024,0.001240459,0.0002952337,0.00003012672,0.000369541,0.001327427,0.02004407,0.003695256,0.9636725,0.006375215,0.00110932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2138553,0.00003136358,0.7715837,0.0006988469,0.00005304364,0.000486777,0.000004817819,0.0002022662,0.01308393],"genre_scores_gemma":[0.2117127,0.00001622834,0.7850556,0.0003289875,0.00002439027,0.00008232178,0.000004339721,0.00005114884,0.002724288],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02462841,"threshold_uncertainty_score":0.6932206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03692080333076946,"score_gpt":0.2924530463846984,"score_spread":0.255532243053929,"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."}}