{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007754978,0.0009517885,0.0007720513,0.0008529887,0.0004037896,0.0007076898,0.0008545202,0.0004992335,0.002614546],"category_scores_gemma":[0.00309424,0.0006616848,0.001519268,0.0005300496,0.001090989,0.000976864,0.00174754,0.001438994,0.0004389782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001184952,"about_ca_system_score_gemma":0.001774376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006157991,"about_ca_topic_score_gemma":0.007283821,"domain_scores_codex":[0.9991449,0.0002089749,0.00004550244,0.0001468013,0.0003550831,0.0000987671],"domain_scores_gemma":[0.9987466,0.0007023943,0.0001165412,0.0002375413,0.0001504957,0.00004636313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005627994,0.00002267529,0.0004191967,0.00005594708,0.00002096999,0.00006872413,0.00004953371,0.9547338,0.003318707,0.02308675,0.0003648768,0.01780257],"study_design_scores_gemma":[0.000005925721,0.00000925239,0.00003790594,0.00000427788,0.000004558738,0.000008436328,0.000004157505,0.9844617,0.0006402034,0.01456985,0.0002509443,0.000002779576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01208594,0.00004285926,0.9860805,0.0000385792,0.000006988073,0.00002808046,0.0001019561,0.0005768244,0.001038397],"genre_scores_gemma":[0.5757864,0.0001541497,0.4203635,0.00007815353,0.00001548245,0.0003042954,0.0008354208,0.0002874221,0.002175075],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006157991,"threshold_uncertainty_score":0.01224428,"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."}}