{"id":"W4408059813","doi":"10.1016/j.ipl.2025.106572","title":"A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees","year":2025,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Simple (philosophy); Binary number; Mathematics; Binary tree; Algorithm; Combinatorics; Weight-balanced tree; Tree (set theory); Binary search tree; Arithmetic","routes":{"ca_aff":true,"ca_fund":true,"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.0003471593,0.0001858572,0.0001541232,0.0004963955,0.0004727611,0.0005188499,0.0005587417,0.00006275684,0.000004021533],"category_scores_gemma":[0.0001099312,0.0001796952,0.00008632542,0.0007089482,0.00005349539,0.002514822,0.0001187053,0.0001214549,0.00001679012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001066225,"about_ca_system_score_gemma":0.00008094931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001443672,"about_ca_topic_score_gemma":0.000009774646,"domain_scores_codex":[0.9986628,0.00003017651,0.0004570849,0.0002273921,0.0003140927,0.0003084167],"domain_scores_gemma":[0.9990603,0.0001800524,0.0002277913,0.0003259131,0.0001587078,0.00004718401],"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.00001580859,0.00005326928,0.0001582746,0.0001416289,0.00001307947,6.979214e-7,0.0007401773,0.002861348,0.0001569891,0.002972354,0.004219332,0.988667],"study_design_scores_gemma":[0.001053789,0.0000747645,0.004884257,0.0001305666,0.000007647818,0.000001834949,0.00007465982,0.9678344,0.001379135,0.009897842,0.01444836,0.0002127879],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007035258,0.00002072442,0.9872235,0.004116483,0.0003306278,0.0005587949,0.00001795548,0.0002770309,0.0004196407],"genre_scores_gemma":[0.5791712,0.000003502816,0.4043825,0.0154993,0.00009604621,0.0004403782,0.0003213927,0.00001258961,0.00007306854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9884543,"threshold_uncertainty_score":0.7327756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01551651200459429,"score_gpt":0.2570153997252107,"score_spread":0.2414988877206164,"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."}}