{"id":"W3193574081","doi":"","title":"The reachability problem for two-dimensional vector addition systems with states","year":2021,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Engineering and Physical Sciences Research Council; Université Paris-Saclay; Natural Sciences and Engineering Research Council of Canada; Technische Universität München; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Reachability; Unary operation; Bounded function; Reachability problem; Sequence (biology); Mathematics; Discrete mathematics; Path (computing); Combinatorics; Binary number; Key (lock); Computer science; Arithmetic","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002144319,0.0001860825,0.0002845394,0.0002989452,0.002020719,0.0001215091,0.001805791,0.00007897354,0.00002071063],"category_scores_gemma":[0.0001888648,0.0001803765,0.0001543323,0.00115434,0.001021652,0.001089656,0.001063992,0.0004808531,0.000004314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003561979,"about_ca_system_score_gemma":0.0007866392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004978302,"about_ca_topic_score_gemma":0.0008798431,"domain_scores_codex":[0.9963568,0.00116319,0.0001742999,0.0007043751,0.0009186582,0.0006826622],"domain_scores_gemma":[0.995333,0.001634529,0.0002185191,0.001012469,0.001548773,0.0002526763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002870933,0.0005832307,0.001371956,0.0004792932,0.0003907039,0.0002086334,0.004067589,0.006153471,0.003403354,0.9351984,0.008681741,0.03659069],"study_design_scores_gemma":[0.004319451,0.002154665,0.009071486,0.0003195891,0.00007530454,0.0000820288,0.01683147,0.3885586,0.001282861,0.02583113,0.5507444,0.0007291077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0524652,0.00008546425,0.9325162,0.002508251,0.000178513,0.001556297,0.0005454011,0.0001563388,0.009988398],"genre_scores_gemma":[0.1373439,0.000356201,0.8555697,0.00002300283,0.00006848275,0.000004790378,0.0003939908,0.00002942203,0.006210517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9093673,"threshold_uncertainty_score":0.9992785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03199811364614424,"score_gpt":0.2734041799044626,"score_spread":0.2414060662583184,"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."}}