{"id":"W1964180408","doi":"10.1016/j.ipl.2007.08.014","title":"Improved FPT algorithm for feedback vertex set problem in bipartite tournament","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tournament; Bipartite graph; Vertex (graph theory); Feedback vertex set; Mathematics; Algorithm; Combinatorics; Set (abstract data type); Vertex cover; Feedback arc set; Approximation algorithm; Computer science; Graph","routes":{"ca_aff":true,"ca_fund":false,"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.0009161608,0.0001583997,0.0001490416,0.0003614847,0.0002028028,0.0005165162,0.0005283037,0.00006557655,0.000004219105],"category_scores_gemma":[0.00002403122,0.0001558701,0.00006227254,0.0006376642,0.00004811742,0.003641209,0.00009959189,0.0001852618,0.00001506813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001297916,"about_ca_system_score_gemma":0.00006835881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001968905,"about_ca_topic_score_gemma":0.000008310426,"domain_scores_codex":[0.9984741,0.00001449642,0.0005945674,0.0001845852,0.0002720366,0.0004602617],"domain_scores_gemma":[0.9992624,0.00006651464,0.000252311,0.000213809,0.0001209307,0.00008402501],"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.000009200327,0.00002549484,0.0000543631,0.00008771731,0.000006335837,0.000001783403,0.004245504,0.0001313124,0.0008962004,0.0005458027,0.0008803449,0.993116],"study_design_scores_gemma":[0.001451544,0.00007908234,0.0009386492,0.0001566792,0.000004892484,0.00002242877,0.0003177069,0.9687629,0.005846505,0.002021177,0.02001113,0.000387336],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006338904,0.00002749543,0.9895304,0.002903265,0.0003189896,0.0004103756,0.000006222258,0.0001540224,0.0003103199],"genre_scores_gemma":[0.1030535,0.000004238525,0.8864072,0.01027429,0.00009438381,0.00009168787,0.00004113374,0.00001181722,0.00002173331],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9927286,"threshold_uncertainty_score":0.63562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01527569381448809,"score_gpt":0.254955030244869,"score_spread":0.2396793364303809,"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."}}