{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001705789,0.0001883924,0.0004959977,0.0002638237,0.0001347309,0.0002343545,0.0004391258,0.00009983032,7.495266e-7],"category_scores_gemma":[0.0001100418,0.0001787354,0.0001804106,0.0004269539,0.00006505759,0.0009153963,0.00002793736,0.0001257086,0.000005976081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002075809,"about_ca_system_score_gemma":0.00007087905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005424306,"about_ca_topic_score_gemma":0.000001271792,"domain_scores_codex":[0.9974664,0.0003996935,0.0009694555,0.0004590685,0.0003925934,0.0003127884],"domain_scores_gemma":[0.997742,0.0007441845,0.0005940329,0.0006854407,0.0001729721,0.00006139548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002475694,0.00002023072,0.00006605514,0.001203295,0.0001694108,0.000002255791,0.0005053878,0.1221353,0.8508839,0.02408754,0.0004558798,0.0004459211],"study_design_scores_gemma":[0.0005075567,0.00006131858,0.00008280627,0.0005323236,0.00006619364,0.00005312424,0.0001302458,0.9932199,0.004852186,0.0001216103,0.0002062295,0.000166464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06005401,0.000328892,0.9350057,0.0003258061,0.00245328,0.001468394,0.00007192596,0.0001367202,0.0001553014],"genre_scores_gemma":[0.9054232,0.000002244793,0.09406376,0.00004239255,0.0001965982,0.0001886544,0.000007834149,0.00002847478,0.00004686461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8710846,"threshold_uncertainty_score":0.7288619,"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."}}