{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915452,0.0005697349,0.0007139239,0.001078733,0.0007232139,0.001850304,0.0007966445,0.0006659711,0.0128537],"category_scores_gemma":[0.002291165,0.0004839053,0.0006657632,0.001572743,0.0006881472,0.002750655,0.001951046,0.001391122,0.001769917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006726088,"about_ca_system_score_gemma":0.0003473478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008795069,"about_ca_topic_score_gemma":0.001123604,"domain_scores_codex":[0.9993475,0.0001259321,0.00004293297,0.0001703974,0.000130294,0.0001829803],"domain_scores_gemma":[0.9984763,0.0004509997,0.0001496599,0.0005237416,0.0001707682,0.0002285236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001206004,0.0002702993,0.001736343,0.0007335561,0.0001517998,0.001264659,0.0009561811,0.1109707,0.06193927,0.4167484,0.03161482,0.3724079],"study_design_scores_gemma":[0.00009787713,0.0001437712,0.001118437,0.0001030866,0.00009172905,0.0006029549,0.0004676264,0.2418634,0.01537443,0.7028801,0.03721026,0.00004645234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3167509,0.001498283,0.5964025,0.001092035,0.0005061039,0.000262145,0.001353311,0.006008381,0.07612635],"genre_scores_gemma":[0.8250901,0.0008221197,0.1533892,0.0002882317,0.0001722069,0.0001275936,0.001853848,0.001314206,0.01694242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0128537,"threshold_uncertainty_score":0.04299992,"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."}}