{"id":"W4403661739","doi":"10.48550/arxiv.2409.08440","title":"A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Simple (philosophy); Binary number; Mathematics; Binary tree; Statistical physics; Applied mathematics; Combinatorics; Algorithm; Physics; Forestry; Geography; Arithmetic","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002792247,0.0003504279,0.0002829907,0.0003409667,0.0002326107,0.0002549383,0.001491495,0.0002190081,0.00001200499],"category_scores_gemma":[0.00004187186,0.0003787006,0.0002290592,0.0006064171,0.00006037512,0.0002196086,0.001978724,0.0003844558,0.0001373948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000238006,"about_ca_system_score_gemma":0.0001563554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001569632,"about_ca_topic_score_gemma":0.0001406721,"domain_scores_codex":[0.997788,0.00005499445,0.0002490436,0.001401869,0.0001280769,0.0003780426],"domain_scores_gemma":[0.9978706,0.0002646405,0.0001975062,0.001384185,0.0001372224,0.000145908],"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.00005255923,0.0009710685,0.0004063285,0.00045803,0.0003536343,0.0002450385,0.000602027,0.1524631,0.0001094905,0.2256678,0.01420075,0.6044701],"study_design_scores_gemma":[0.0004536009,0.0001352601,0.0008315977,0.0001053283,0.0000610791,0.000001531083,0.00004205304,0.8713418,0.0001219218,0.1236284,0.002917713,0.0003597257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02789399,0.00004363209,0.9689339,0.0002467932,0.0004536555,0.0009907141,0.0006379644,0.0004020997,0.0003972877],"genre_scores_gemma":[0.9063145,0.00004530641,0.09073227,0.0000956822,0.0001865058,0.00006132537,0.0009235094,0.00004209439,0.001598826],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8784205,"threshold_uncertainty_score":0.9998665,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06506725166700413,"score_gpt":0.2217817075597279,"score_spread":0.1567144558927238,"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."}}