{"id":"W3027490412","doi":"10.1016/j.tcs.2020.05.010","title":"Local search is a PTAS for feedback vertex set in minor-free graphs","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Vertex (graph theory); Minor (academic); Robertson–Seymour theorem; Local search (optimization); Mathematics; Feedback vertex set; Set (abstract data type); Combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Graph; 1-planar graph; Chordal 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":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002354137,0.000295031,0.0003776457,0.0003988974,0.0003666179,0.0004340378,0.007831434,0.0001005433,0.00006254457],"category_scores_gemma":[0.0003635586,0.0002615173,0.0001509891,0.004049372,0.005292885,0.0009527629,0.003441453,0.0005441625,0.0001360765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009630805,"about_ca_system_score_gemma":0.0002900135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005716351,"about_ca_topic_score_gemma":0.000001743927,"domain_scores_codex":[0.9950771,0.0002455094,0.0004142702,0.001510477,0.001341097,0.00141149],"domain_scores_gemma":[0.9964742,0.0008799226,0.00004767931,0.001477373,0.0003197476,0.0008010822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009057341,0.00005402126,0.0001005876,0.00003047059,0.000005039231,0.00002894036,0.00197829,0.0004626283,0.0004679909,0.9624081,0.0005100609,0.03386325],"study_design_scores_gemma":[0.0006984916,0.000455415,0.000267374,0.00002085876,0.000001656152,0.00001214188,0.00003555437,0.5570766,0.004894105,0.4361581,0.0001502141,0.000229519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02567782,0.00004956035,0.9630397,0.009525991,0.0002133829,0.0005928382,0.00001822727,0.0001739063,0.0007085915],"genre_scores_gemma":[0.850616,0.000004965789,0.1460598,0.003216499,0.00004722967,0.00002904163,0.000001344343,0.00001676613,0.000008255058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8249382,"threshold_uncertainty_score":0.9999837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03530793057521974,"score_gpt":0.3088514233584,"score_spread":0.2735434927831803,"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."}}