{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005646228,0.001098539,0.0009090218,0.0007866027,0.0008000664,0.001063277,0.002237769,0.001232174,0.005508783],"category_scores_gemma":[0.002337281,0.0004769146,0.0009164027,0.001744472,0.0003650866,0.002604421,0.001599569,0.001931877,0.001777718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293448,"about_ca_system_score_gemma":0.001284352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002819702,"about_ca_topic_score_gemma":0.004749451,"domain_scores_codex":[0.9992819,0.0001010797,0.00004227168,0.0001911723,0.0002054027,0.0001781365],"domain_scores_gemma":[0.9992059,0.0002695513,0.0000948648,0.0002188504,0.0001161326,0.00009477284],"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.0006041865,0.0006900721,0.002128352,0.0005639009,0.0001313107,0.0003422888,0.0004536133,0.2268691,0.02962571,0.04169445,0.03526683,0.6616302],"study_design_scores_gemma":[0.0002270851,0.0002522837,0.0008354297,0.00003624491,0.00006372584,0.0005129142,0.0001272754,0.9330317,0.007923884,0.04409077,0.01286517,0.00003352951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03561417,0.0004465207,0.9537424,0.0005664697,0.0000650227,0.00017825,0.0003325705,0.003255744,0.005798901],"genre_scores_gemma":[0.1778045,0.0003912174,0.8147226,0.0002009345,0.00006372639,0.0003054567,0.001787956,0.0003149903,0.004408672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005508783,"threshold_uncertainty_score":0.01842868,"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."}}