{"id":"W1484691446","doi":"10.1016/j.tcs.2016.08.016","title":"The complexity of dominating set reconfiguration","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Mathematics; Discrete mathematics; Bipartite graph; Vertex (graph theory); Bounded function; Time complexity; Sequence (biology); Existential quantification; Maximal independent set; Split graph; Pathwidth; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0038324,0.0001176343,0.0001484922,0.0001188839,0.0007078039,0.0002022716,0.00344407,0.00002805861,0.00002319916],"category_scores_gemma":[0.0005431488,0.00005835387,0.00005717654,0.001031274,0.01513647,0.0007787147,0.0009921949,0.0001165522,0.00003892702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005345896,"about_ca_system_score_gemma":0.0001084955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.642398e-7,"about_ca_topic_score_gemma":9.828897e-7,"domain_scores_codex":[0.9975976,0.0002721194,0.0003200537,0.0004830846,0.0007888245,0.0005382673],"domain_scores_gemma":[0.9967221,0.001556996,0.0001215858,0.001043247,0.0003990272,0.0001570348],"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.000009993165,0.000009516185,0.00001684976,0.000001961038,0.000001700858,0.000001037375,0.0001749961,0.000004613526,0.008526814,0.8315347,0.00001074894,0.1597071],"study_design_scores_gemma":[0.0001780045,0.0001345031,0.0005584643,0.00002877817,7.8965e-7,0.00001380505,0.000009565657,0.07089428,0.056276,0.8717282,0.00007937582,0.00009819902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02336185,0.00001501866,0.9692996,0.004288799,0.0002889384,0.0001555425,0.000002031603,0.00007958104,0.002508594],"genre_scores_gemma":[0.9195939,0.000006918731,0.08026369,0.00006498636,0.00004203408,0.000006139303,1.039566e-7,0.000004238427,0.00001800737],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.896232,"threshold_uncertainty_score":0.9875438,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04426428454903826,"score_gpt":0.3193597798728391,"score_spread":0.2750954953238009,"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."}}