{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305949,0.0003577421,0.0008479709,0.001152388,0.0008354839,0.001270093,0.0007899867,0.000698704,0.001310891],"category_scores_gemma":[0.007514371,0.0004901502,0.000713127,0.001335985,0.001169624,0.003139948,0.002115852,0.0007259194,0.0004015654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005374326,"about_ca_system_score_gemma":0.0008707838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008968936,"about_ca_topic_score_gemma":0.001471307,"domain_scores_codex":[0.9991053,0.0001831729,0.00008059832,0.0002886034,0.0002465841,0.0000957641],"domain_scores_gemma":[0.9926467,0.003962079,0.0009970465,0.00130274,0.0007238968,0.0003675758],"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.0007899396,0.0002321083,0.0145573,0.001224423,0.0001046924,0.001479457,0.004150942,0.06888961,0.09739385,0.3059584,0.0150916,0.4901277],"study_design_scores_gemma":[0.0000522996,0.0002602719,0.004738577,0.00008890202,0.00007220049,0.001941052,0.001143702,0.2043543,0.03479042,0.7340223,0.01848585,0.0000502443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3230009,0.0004981269,0.6699647,0.0004971035,0.00003102637,0.0001663034,0.000835826,0.001133398,0.003872631],"genre_scores_gemma":[0.5946152,0.0004285689,0.3992307,0.0001631267,0.00006766197,0.0001582169,0.002644846,0.000347212,0.002344516],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001310891,"threshold_uncertainty_score":0.004921496,"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."}}