{"id":"W2976821674","doi":"10.48550/arxiv.1909.13039","title":"Guaranteed-Safe Approximate Reachability via State Dependency-Based Decomposition","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reachability; State space; Computer science; Bounded function; Dependency (UML); Graph; State (computer science); Corollary; Model checking; Topology (electrical circuits); Control theory (sociology); Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001378229,0.0004606232,0.0004853715,0.0003714453,0.000184957,0.0001620703,0.002736504,0.0003959375,0.00002852578],"category_scores_gemma":[0.00006972974,0.0005477098,0.0003080379,0.0006292542,0.0001556128,0.0006649056,0.001422716,0.000879284,0.0002668664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005611884,"about_ca_system_score_gemma":0.0003030459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002493764,"about_ca_topic_score_gemma":0.0000229326,"domain_scores_codex":[0.9964036,0.0006520516,0.0004910439,0.001725229,0.0002186041,0.0005094602],"domain_scores_gemma":[0.9958197,0.0001610783,0.0006292664,0.002940516,0.0002831096,0.0001663478],"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.0002600066,0.0004360019,0.01355851,0.0007960845,0.00009758778,0.0001270867,0.0003624542,0.8328967,0.0008109633,0.1426367,0.00004615922,0.007971741],"study_design_scores_gemma":[0.0004550124,0.00008388696,0.002753844,0.0000802299,0.00004182492,0.000006165514,0.0000104301,0.9203643,0.002399663,0.07316022,0.00009950292,0.0005449272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1637181,0.0000222522,0.8321051,0.00004182931,0.0009918688,0.0007109271,0.00003132196,0.0004111255,0.00196751],"genre_scores_gemma":[0.8200973,0.00001637563,0.1794363,0.0001021364,0.00002882488,0.000003693947,0.00003964909,0.00002388573,0.0002518003],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6563792,"threshold_uncertainty_score":0.9996974,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06169567290066699,"score_gpt":0.2268067259616699,"score_spread":0.1651110530610029,"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."}}