{"id":"W2074524916","doi":"10.1007/s10732-013-9224-z","title":"Applying local search to the feedback vertex set problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Feedback arc set; Feedback vertex set; Directed acyclic graph; Local search (optimization); Vertex (graph theory); Simulated annealing; Set (abstract data type); Bidirectional search; Heuristic; Mathematical optimization; Representation (politics); Computer science; Graph; Greedy algorithm; Mathematics; Algorithm; Search algorithm; Theoretical computer science; Beam search; Best-first search; Line 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.00116567,0.0001159162,0.0001886134,0.0001731859,0.0001899755,0.0002650183,0.001867391,0.00004064569,0.00003906632],"category_scores_gemma":[0.0002085931,0.00007252955,0.00008295212,0.0005974281,0.0001049085,0.0004306365,0.0004680413,0.0006100217,0.0004383352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007987401,"about_ca_system_score_gemma":0.0001484597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001010244,"about_ca_topic_score_gemma":0.000001807344,"domain_scores_codex":[0.9979837,0.0001870397,0.0003933774,0.0001617548,0.0008468653,0.0004272597],"domain_scores_gemma":[0.9979908,0.0004417159,0.0001273575,0.0004672024,0.0006898431,0.0002830283],"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.00009629762,0.000224252,0.00108885,0.0001024973,0.0001347028,0.0002986135,0.002987348,0.0534458,0.002618209,0.1127506,0.1581839,0.6680689],"study_design_scores_gemma":[0.002071519,0.002501437,0.006620423,0.0003902762,0.00003994024,0.002128915,0.002295362,0.4048935,0.004455511,0.3445552,0.2290656,0.000982262],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005885343,0.0001411478,0.9883611,0.004339166,0.000262797,0.0004362591,0.00000188858,0.00001751888,0.0005547899],"genre_scores_gemma":[0.9037805,0.00003763917,0.09480002,0.0007337051,0.0001884214,0.00002809348,2.850902e-7,0.00001787185,0.0004134976],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8978951,"threshold_uncertainty_score":0.5634059,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02870143752902014,"score_gpt":0.3008019868948117,"score_spread":0.2721005493657915,"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."}}