{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00133637,0.001269271,0.001409787,0.001159468,0.001152475,0.002014769,0.002538798,0.001580446,0.01134238],"category_scores_gemma":[0.005720995,0.0008426845,0.001653303,0.002388351,0.0007989123,0.003910571,0.002981775,0.003944983,0.003603606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001670721,"about_ca_system_score_gemma":0.002621887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002241345,"about_ca_topic_score_gemma":0.00379654,"domain_scores_codex":[0.9980955,0.0003406091,0.000119049,0.0004453279,0.0006194405,0.0003800876],"domain_scores_gemma":[0.9976351,0.00111848,0.0002005314,0.0005910938,0.0003152814,0.0001395595],"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.0008526401,0.0006223564,0.001537789,0.0006466643,0.0001347724,0.0002758258,0.0005406585,0.2751001,0.01770736,0.08971651,0.02565494,0.5872105],"study_design_scores_gemma":[0.0002698509,0.0001365402,0.000281634,0.00006485557,0.0000462384,0.0002213193,0.000178729,0.8455343,0.006650569,0.1357414,0.01083959,0.00003496948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01444095,0.0002763479,0.9766911,0.0004710715,0.00009260308,0.0002278271,0.0003479088,0.002513355,0.004938885],"genre_scores_gemma":[0.09000721,0.0001159395,0.9060182,0.0002143249,0.00006256775,0.0003063111,0.0008946751,0.0002965536,0.002084118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01134238,"threshold_uncertainty_score":0.03794402,"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."}}