{"id":"W1992434757","doi":"10.1142/s0129054100000259","title":"FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supertree; Combinatorics; Mathematics; Tree (set theory); Vertex (graph theory); Minor (academic); Bounded function; Embedding; Discrete mathematics; Computer science; Graph; Biology; Artificial intelligence; Phylogenetic tree","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.001044045,0.0001064879,0.0001646919,0.0007137593,0.0001685413,0.0003739133,0.004031408,0.00002286932,0.0002062462],"category_scores_gemma":[0.0000693496,0.00009344855,0.000113005,0.0006892545,0.0005297947,0.001889813,0.0003133617,0.0001526743,0.00002430306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001786867,"about_ca_system_score_gemma":0.0004554122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008503235,"about_ca_topic_score_gemma":0.000004750573,"domain_scores_codex":[0.9974315,0.00005561563,0.0005490343,0.0002375995,0.001489133,0.000237155],"domain_scores_gemma":[0.9976573,0.0002593001,0.0002739812,0.0003455011,0.0013286,0.0001353014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006797961,0.0003407817,0.002430469,0.000004422357,0.0001252179,0.00005971343,0.001144951,0.031183,0.007255271,0.3378368,0.0002112069,0.6193402],"study_design_scores_gemma":[0.006087428,0.002489855,0.1455983,0.0007363627,0.00004162308,0.003169481,0.0003290831,0.3206992,0.04772129,0.4524248,0.01937103,0.001331526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2935923,0.00004040091,0.7030054,0.001809173,0.0007616432,0.00005577029,0.000001762905,0.00001114456,0.0007224528],"genre_scores_gemma":[0.8422722,0.00003452793,0.157285,0.0001780093,0.0001307905,0.000001342538,6.376866e-7,0.000003532343,0.00009404727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6180087,"threshold_uncertainty_score":0.7491425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0312662277924988,"score_gpt":0.3391405770950674,"score_spread":0.3078743493025686,"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."}}