{"id":"W4405022145","doi":"10.1109/lcsys.2024.3511407","title":"Underapproximating Safe Domains of Attraction for Discrete-Time Systems Using Implicit Representations of Backward Reachable Sets","year":2024,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Discrete time and continuous time; Attraction; Computer science; Mathematics; Theoretical computer science; Control theory (sociology); Artificial intelligence; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385988,0.0007320044,0.0006099397,0.0007766363,0.0003271633,0.00102882,0.0008327501,0.0006943422,0.0009795075],"category_scores_gemma":[0.006068329,0.0003985381,0.0008694088,0.0002367515,0.001227351,0.001185402,0.001489808,0.00123465,0.0001819132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008711258,"about_ca_system_score_gemma":0.001000533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002631516,"about_ca_topic_score_gemma":0.002258427,"domain_scores_codex":[0.9993945,0.0001801425,0.00004003943,0.00005917625,0.000267623,0.00005850456],"domain_scores_gemma":[0.9973188,0.001644901,0.0003636435,0.0003876547,0.0002307003,0.0000542585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000421035,0.0000210261,0.0006649492,0.00005199183,0.00001244715,0.00008149035,0.0001802112,0.9587967,0.005750122,0.02144828,0.00007044456,0.01288026],"study_design_scores_gemma":[0.000002251482,0.00001192058,0.0000423925,0.000007199811,0.00000156338,0.0000102599,0.000007841923,0.9939774,0.001639552,0.004125958,0.0001704278,0.00000317134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02778191,0.00004120724,0.9711954,0.00003216429,0.000004964617,0.00002839605,0.0000173568,0.000148418,0.0007501663],"genre_scores_gemma":[0.6810501,0.0001122444,0.3173661,0.00003241863,0.000007864096,0.0001590875,0.0001039652,0.00008021822,0.001087962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002631516,"threshold_uncertainty_score":0.007329881,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0371756085811912,"score_gpt":0.3275783915530437,"score_spread":0.2904027829718525,"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."}}