{"id":"W1822932347","doi":"10.1007/3-540-44634-6_35","title":"Computing Phylogenetic Roots with Bounded Degrees and Errors","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Phylogenetic tree; Combinatorics; Similarity (geometry); Phylogenetics; Mathematics; Tree (set theory); Bounded function; Vertex (graph theory); Graph; Phylogenetic network; Biology; Computer science; Artificial intelligence; Genetics; Image (mathematics)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005004059,0.0006166442,0.000562004,0.0005972784,0.0004836996,0.0008515569,0.002559103,0.0002574806,0.00001057767],"category_scores_gemma":[0.00002626355,0.0004812349,0.00006033073,0.000560166,0.000904921,0.000559926,0.002208939,0.0006877636,0.00001295801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001484242,"about_ca_system_score_gemma":0.000392451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005511793,"about_ca_topic_score_gemma":0.0001536859,"domain_scores_codex":[0.9959981,0.00003427729,0.0004267091,0.001820498,0.000976617,0.0007437406],"domain_scores_gemma":[0.9976116,0.0003002489,0.0002968055,0.001357651,0.0001816239,0.000252076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008628892,0.0000260224,0.0005078826,0.00003322963,0.00001388099,0.0002429014,0.0003747782,0.02226573,0.00007007787,0.005631448,0.00001722658,0.9708082],"study_design_scores_gemma":[0.0005063961,0.0003806562,0.002273304,0.0007852334,0.00001302929,0.0005536359,3.418145e-7,0.9465689,0.0002042427,0.04497511,0.002755721,0.0009834005],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001124598,0.001322442,0.9939601,0.0002625032,0.0006324463,0.0003246098,0.000004295299,0.0001607024,0.002208327],"genre_scores_gemma":[0.18716,0.0001033653,0.8113878,0.0006697209,0.0004174864,0.000003819962,0.00000832004,0.00004745026,0.0002020488],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9698248,"threshold_uncertainty_score":0.9997639,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01586804700467879,"score_gpt":0.2381215292257102,"score_spread":0.2222534822210314,"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."}}