{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002138668,0.00126543,0.002671924,0.001335389,0.004206867,0.005444769,0.005073055,0.00487021,0.01203153],"category_scores_gemma":[0.02607558,0.002826901,0.002544116,0.003378584,0.005901365,0.01808124,0.004799561,0.007258296,0.0009839929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003011861,"about_ca_system_score_gemma":0.002376746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008095568,"about_ca_topic_score_gemma":0.007567025,"domain_scores_codex":[0.9975539,0.0007970872,0.000126687,0.0005907072,0.0004209516,0.0005107443],"domain_scores_gemma":[0.9701226,0.02386652,0.001866614,0.002197672,0.0006371749,0.001309206],"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.000991159,0.0003492657,0.00255312,0.0007318162,0.0001508936,0.0005443658,0.001305793,0.1768898,0.003196326,0.7516,0.02620367,0.03548376],"study_design_scores_gemma":[0.0001491308,0.00004355938,0.0007723354,0.00005245573,0.00005503,0.0001739461,0.0003741542,0.06918839,0.0009484345,0.9254968,0.002717415,0.00002832755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5958303,0.002371463,0.2949956,0.02180357,0.0005100415,0.0003459823,0.003571746,0.001209345,0.07936185],"genre_scores_gemma":[0.9016251,0.001973034,0.06625857,0.001456053,0.000540078,0.0003081066,0.002174819,0.0006036123,0.02506068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01203153,"threshold_uncertainty_score":0.04024947,"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."}}