{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262902,0.001466722,0.001442595,0.001128557,0.001147165,0.002052307,0.002284962,0.001733818,0.01030966],"category_scores_gemma":[0.005370579,0.0007515097,0.00149962,0.002245893,0.0007508944,0.003709988,0.002536806,0.003409699,0.00267127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002023998,"about_ca_system_score_gemma":0.002871302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002802339,"about_ca_topic_score_gemma":0.00422279,"domain_scores_codex":[0.9983321,0.0002824301,0.0001084945,0.0003655924,0.0004906862,0.0004206448],"domain_scores_gemma":[0.9974674,0.001360159,0.0002149726,0.0004749161,0.0003356015,0.0001469918],"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.001069246,0.0007624576,0.001583538,0.0006356416,0.0001151505,0.0003154209,0.0005566904,0.3354999,0.01589787,0.07522234,0.02720656,0.5411352],"study_design_scores_gemma":[0.0002722035,0.0001394523,0.0002594967,0.00005192584,0.00003532143,0.0002163508,0.0001638135,0.9012407,0.004244628,0.08606655,0.007280682,0.00002882022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0287331,0.000406887,0.9590368,0.0007335563,0.0001212354,0.0003418362,0.0004109264,0.002744869,0.007470873],"genre_scores_gemma":[0.1163683,0.0001449995,0.8791697,0.0002420013,0.0000650749,0.0003452429,0.0008680526,0.0002926982,0.002503948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01030966,"threshold_uncertainty_score":0.03448927,"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."}}