{"id":"W2014252825","doi":"10.1016/s0304-3975(98)00342-9","title":"The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University; University of Victoria","funders":"","keywords":"Colored; Combinatorics; Parameterized complexity; Chordal graph; Mathematics; Pathwidth; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Tree (set theory); Bounded function; Graph; Line graph","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.003213336,0.0002243304,0.0002481536,0.0001607308,0.0007965341,0.0004320896,0.002930418,0.00005408014,0.00005775991],"category_scores_gemma":[0.0000683968,0.0001372268,0.00008100782,0.001233712,0.007465932,0.0003460953,0.0006459792,0.0002784033,0.00003576735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004595963,"about_ca_system_score_gemma":0.00009037793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004144034,"about_ca_topic_score_gemma":0.000001244646,"domain_scores_codex":[0.9966303,0.0003913328,0.000322932,0.0008192661,0.001109107,0.0007270424],"domain_scores_gemma":[0.9976,0.0006539372,0.00008775354,0.001266809,0.0001380304,0.0002535007],"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.00006953753,0.00007960652,0.0001278931,0.000009649899,0.000007756718,0.000003804036,0.0005229742,0.0005364802,0.00104038,0.9503799,0.00004277008,0.04717926],"study_design_scores_gemma":[0.0005402875,0.001176791,0.001645744,0.00008336615,0.00000484801,0.00003950734,0.00001516167,0.1993404,0.00906329,0.7863562,0.001437733,0.0002967092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2731883,0.0002429994,0.7029465,0.002277425,0.0005214653,0.001228717,0.000006908647,0.0002155769,0.01937215],"genre_scores_gemma":[0.9878764,0.00002938647,0.01137027,0.000495425,0.00002864617,0.0000300675,1.412372e-7,0.000012527,0.0001571015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7146881,"threshold_uncertainty_score":0.9952352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02100493328510149,"score_gpt":0.2802367147849774,"score_spread":0.2592317814998759,"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."}}