{"id":"W2139426253","doi":"10.1109/acc.2010.5531392","title":"Overapproximating the reachable sets of LTI systems through a similarity transformation","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Reduction (mathematics); Disjoint sets; Computer science; Set (abstract data type); Decomposition; Transformation (genetics); Similarity (geometry); Series (stratigraphy); Algorithm; Computational complexity theory; Controller (irrigation); Linear system; Mathematics; Control theory (sociology); Mathematical optimization; Discrete mathematics; Control (management); Artificial intelligence","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.001436761,0.00007684301,0.0001085784,0.00002640903,0.0001334014,0.00009436368,0.0006520636,0.00006924022,0.000007405841],"category_scores_gemma":[0.0000963054,0.00004981244,0.00003994736,0.0002647144,0.00005010699,0.001249908,0.00005082714,0.0002111124,0.000006601218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001180146,"about_ca_system_score_gemma":0.00002981314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002122055,"about_ca_topic_score_gemma":0.00001006295,"domain_scores_codex":[0.9990233,0.0001124992,0.0003138109,0.0001422938,0.0002637166,0.0001443662],"domain_scores_gemma":[0.9989939,0.0001016291,0.000157142,0.0006258573,0.0001011332,0.0000202909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002038489,0.00002480232,0.00004726711,0.00005772265,0.000005067564,7.674641e-8,0.004438677,0.0001508328,0.009989366,0.9760163,0.00008469347,0.009183086],"study_design_scores_gemma":[0.000145243,0.0000345627,0.0007007858,0.00001564972,0.000004001981,0.00001815419,0.0002737532,0.9395552,0.04601809,0.01048461,0.002652902,0.00009706894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03804165,0.00001731663,0.9317876,0.0003513482,0.000537145,0.0003098225,0.000001700912,0.0001058265,0.02884766],"genre_scores_gemma":[0.5228946,0.000002868738,0.4769785,0.00005878894,0.00001575936,0.00001769196,9.927467e-7,0.00000273087,0.00002799927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9655318,"threshold_uncertainty_score":0.2031292,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03710882140374817,"score_gpt":0.3048743828217536,"score_spread":0.2677655614180054,"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."}}