{"id":"W2072365573","doi":"10.1016/s0304-3975(97)00300-9","title":"On computing graph minor obstruction sets","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001642538,0.00150325,0.002574317,0.004586121,0.002620155,0.004274671,0.003598455,0.001590924,0.0163305],"category_scores_gemma":[0.0111154,0.0009643987,0.002385746,0.004524762,0.003348996,0.01064745,0.007249358,0.003207643,0.002322355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002196227,"about_ca_system_score_gemma":0.001530493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002952547,"about_ca_topic_score_gemma":0.006865475,"domain_scores_codex":[0.9979125,0.0004132123,0.0001153155,0.000468209,0.0006421925,0.0004486858],"domain_scores_gemma":[0.9910925,0.005299067,0.0003637291,0.00193713,0.0006175034,0.0006899633],"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.002621089,0.001128058,0.01266177,0.0008983549,0.0002314379,0.0003737944,0.002128313,0.06250206,0.01445408,0.5124937,0.03392413,0.3565832],"study_design_scores_gemma":[0.0001294072,0.0002281356,0.002717836,0.00008345938,0.0001321719,0.0002253896,0.0004565612,0.1780905,0.004590336,0.8026227,0.01066479,0.0000587758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3953034,0.001282698,0.5491804,0.002699977,0.0005275423,0.0005182238,0.001671042,0.006309416,0.04250725],"genre_scores_gemma":[0.7066553,0.0006444512,0.2674308,0.000666451,0.000520796,0.0003236343,0.004584015,0.00127899,0.01789555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0163305,"threshold_uncertainty_score":0.05463099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01312345332286378,"score_gpt":0.2875945407344291,"score_spread":0.2744710874115653,"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."}}