{"id":"W1997048861","doi":"10.1016/j.tcs.2010.12.005","title":"On the complexity of reconfiguration problems","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":258,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Mathematics; Time complexity; Transformation (genetics); PSPACE; NP-complete; Computer science; Computational complexity theory; Combinatorics; Theoretical computer science; Algorithm","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00341654,0.000129033,0.0001488038,0.0001617189,0.0004479804,0.0002113946,0.003795618,0.00004014512,0.0001321244],"category_scores_gemma":[0.0004343846,0.00007825829,0.00005781038,0.001308711,0.01296404,0.0004549227,0.0006514207,0.0004856347,0.00006965602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001602732,"about_ca_system_score_gemma":0.0001004311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000190429,"about_ca_topic_score_gemma":0.000002051881,"domain_scores_codex":[0.9977493,0.0001720399,0.0002515033,0.0005487584,0.0008461772,0.0004322395],"domain_scores_gemma":[0.9971123,0.0008304449,0.00009103326,0.001503665,0.000308066,0.0001544869],"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.000006344228,0.00004694998,0.000008376092,0.000003255692,0.000001575672,8.205675e-7,0.0002038494,0.00007463386,0.01774219,0.9698718,0.00001936212,0.01202089],"study_design_scores_gemma":[0.00006967686,0.0001639968,0.0003971664,0.00001016662,5.751849e-7,0.000009515372,0.000002081478,0.2067305,0.03529591,0.7572078,0.0000329764,0.00007964717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1039117,0.000002151212,0.8822166,0.004071025,0.0004402151,0.0002753094,0.000001326102,0.00008805465,0.008993648],"genre_scores_gemma":[0.9381642,7.034623e-7,0.06144895,0.0003219959,0.00004181478,0.00001004707,2.591675e-7,0.000004720767,0.000007282377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8342525,"threshold_uncertainty_score":0.9897221,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04184605298491346,"score_gpt":0.2974343397464628,"score_spread":0.2555882867615493,"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."}}