{"id":"W2253740506","doi":"","title":"A Simple Algorithm for the Graph Minor Decomposition -- Logic meets Structural Graph Theory","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Graph minor; Tree decomposition; Discrete mathematics; Mathematical proof; Graph property; Clique-width; Minor (academic); Mathematics; Robertson–Seymour theorem; Graph theory; Treewidth; Tree-depth; Algorithm; Computer science; Line graph; Voltage graph; Combinatorics; Graph; Pathwidth","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.0005798074,0.0002059992,0.0001693167,0.0001868244,0.0005558438,0.0002931554,0.001581636,0.00006542412,0.0002296237],"category_scores_gemma":[0.00004851669,0.0001208546,0.0002005514,0.000597741,0.0002401375,0.0008259747,0.0003065364,0.0001622796,0.00006287538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002457404,"about_ca_system_score_gemma":0.00002498594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000511109,"about_ca_topic_score_gemma":0.00001486982,"domain_scores_codex":[0.9981624,0.0002032789,0.0002325178,0.000476845,0.0003306236,0.0005942814],"domain_scores_gemma":[0.9974175,0.001322489,0.00007705935,0.0008056401,0.0002412524,0.0001360355],"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.00001044587,0.00001907435,0.00006720263,0.00000583275,0.00004359308,0.000001820512,0.0001271158,0.0001293608,0.001238939,0.6885569,0.0009882558,0.3088115],"study_design_scores_gemma":[0.0003407752,0.0001297704,0.002176307,0.000002767513,0.000005753318,0.00002063249,0.0001035693,0.1071411,0.002333415,0.8872941,0.0002720064,0.0001797633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006878709,0.000299788,0.9895671,0.001179051,0.0002179436,0.001153243,0.000009534885,0.0002115928,0.0004830325],"genre_scores_gemma":[0.5748487,0.00002464984,0.422452,0.001334295,0.0001062264,0.0006024754,0.00001429401,0.00002501186,0.0005923082],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.56797,"threshold_uncertainty_score":0.4928307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02035379765603434,"score_gpt":0.3154488165771951,"score_spread":0.2950950189211607,"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."}}