{"id":"W2083082533","doi":"10.1145/1798596.1798599","title":"An approximation algorithm for the maximum leaf spanning arborescence problem","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Subroutine; Spanning tree; Combinatorics; Mathematics; Approximation algorithm; Class (philosophy); Discrete mathematics; Algorithm; Computer science; Artificial intelligence","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.0008929633,0.0002321978,0.0001646603,0.0002249507,0.0009484427,0.0003052089,0.002593356,0.0001236608,0.00002816153],"category_scores_gemma":[0.00005402965,0.0001788716,0.000131892,0.0007691766,0.0002156226,0.001150288,0.00002680971,0.0007956313,0.00003506192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003713096,"about_ca_system_score_gemma":0.00008584627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002605711,"about_ca_topic_score_gemma":0.00002110233,"domain_scores_codex":[0.9979324,0.00008585121,0.0002717522,0.0006537569,0.0004997123,0.0005565318],"domain_scores_gemma":[0.9968979,0.0006315365,0.00008977633,0.001974941,0.0002320884,0.0001737852],"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.00001115717,0.0001586624,0.000002328169,0.000007584233,0.00002170044,0.000002081463,0.0003669115,0.001572798,0.003187046,0.006326037,0.00001144424,0.9883323],"study_design_scores_gemma":[0.0005518906,0.0003184902,0.0001662896,0.00001578601,0.00001512948,0.00003242511,0.0001425101,0.8670442,0.01836115,0.1111518,0.001912065,0.000288211],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000283046,0.00002709639,0.9958711,0.001710385,0.0006601535,0.0009843943,0.000026828,0.0003529081,0.00008408359],"genre_scores_gemma":[0.04220047,0.00002337812,0.9566659,0.0001789696,0.0001379935,0.0005968196,0.000005578941,0.00003480658,0.0001560442],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.988044,"threshold_uncertainty_score":0.729475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02426617907818306,"score_gpt":0.3062330322091877,"score_spread":0.2819668531310046,"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."}}