{"id":"W3174155805","doi":"10.1145/3464794","title":"The Reachability Problem for Two-Dimensional Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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; 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; Mathematics; Reachability problem; Sequence (biology); Discrete mathematics; Path (computing); Combinatorics; Binary number; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219208,0.0006544464,0.0005454245,0.0004847562,0.0007962396,0.00211136,0.001206108,0.001079957,0.003761909],"category_scores_gemma":[0.004848951,0.0003721809,0.001102014,0.0006438614,0.002270969,0.00466979,0.003128873,0.001922047,0.000376793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00124576,"about_ca_system_score_gemma":0.001481356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001915461,"about_ca_topic_score_gemma":0.001597574,"domain_scores_codex":[0.9987356,0.0002660946,0.0001309549,0.0003657984,0.0002757933,0.0002257603],"domain_scores_gemma":[0.9952275,0.003771834,0.0003734358,0.0002599936,0.0002199052,0.0001472827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007668614,0.000298981,0.001737724,0.0008358106,0.0000938037,0.0007486536,0.001104903,0.3581082,0.03112025,0.5555678,0.001122648,0.04849441],"study_design_scores_gemma":[0.0001034155,0.0001630358,0.0004415005,0.00006089698,0.00004307573,0.0001841019,0.000278258,0.5007903,0.02156333,0.4742916,0.002019929,0.0000605546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2728984,0.0002060497,0.7186985,0.0006945108,0.00004211814,0.0001592129,0.0005061695,0.0008146573,0.00598041],"genre_scores_gemma":[0.8884535,0.0001970314,0.1053999,0.0001478559,0.00002696326,0.000265531,0.0007957891,0.00009481125,0.004618544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003761909,"threshold_uncertainty_score":0.01258487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02423893025548463,"score_gpt":0.2867847053904783,"score_spread":0.2625457751349937,"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."}}