{"id":"W1768636550","doi":"10.1007/978-3-319-13524-3_21","title":"Reconfiguration over Tree Decompositions","year":2014,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Control reconfiguration; Vertex (graph theory); Parameterized complexity; Combinatorics; Bounded function; Feedback vertex set; Mathematics; Discrete mathematics; Cardinality (data modeling); Graph; Dominating set; Pathwidth; Computer science; 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":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001757875,0.0004336358,0.0004496063,0.001209859,0.0003807936,0.001144758,0.005532998,0.0002878874,0.00001772558],"category_scores_gemma":[0.0002831439,0.0004149694,0.0001537355,0.002124263,0.0006581495,0.0008635186,0.003692035,0.001372742,0.00004565838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003580349,"about_ca_system_score_gemma":0.0005158203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003844249,"about_ca_topic_score_gemma":0.0001135575,"domain_scores_codex":[0.9953033,0.0003030979,0.0005199955,0.001937514,0.001057542,0.0008786073],"domain_scores_gemma":[0.9958817,0.0008422734,0.0002496859,0.002472844,0.0003164474,0.0002370687],"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.000005820676,0.00007001211,0.0004426053,0.00004057676,0.000007941993,0.00002307097,0.0007063856,0.3415775,0.002688604,0.007229093,0.00001755129,0.6471909],"study_design_scores_gemma":[0.0001650386,0.00005990009,0.001984615,0.0001243268,0.000002055303,0.00002063683,9.206296e-8,0.6570373,0.007892227,0.3323104,0.00005756447,0.0003457966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0146377,0.0001275922,0.9803872,0.001593746,0.002305042,0.0004979486,0.000004429799,0.000269429,0.0001768992],"genre_scores_gemma":[0.5573017,0.00001056173,0.4417827,0.0006150289,0.0002313342,0.00003764198,0.00000658239,0.00001286524,0.000001586052],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.646845,"threshold_uncertainty_score":0.9998922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0202828384000601,"score_gpt":0.31319455821428,"score_spread":0.2929117198142199,"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."}}