{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344561,0.0006178159,0.0005393233,0.0004888757,0.0008130396,0.002224442,0.001163662,0.001114505,0.00378438],"category_scores_gemma":[0.005041722,0.0003901173,0.001162225,0.0006284671,0.002480255,0.004563591,0.003195583,0.001956103,0.0003539684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001265744,"about_ca_system_score_gemma":0.001505412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001966042,"about_ca_topic_score_gemma":0.001677885,"domain_scores_codex":[0.9986836,0.0003015343,0.0001354688,0.000382058,0.0002667703,0.0002305026],"domain_scores_gemma":[0.9947524,0.004241925,0.0003871305,0.0002664635,0.0002054947,0.0001465328],"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.0007654482,0.0002837829,0.001805388,0.0007641193,0.00009554406,0.0006928295,0.001143159,0.3464198,0.02677645,0.5731445,0.001112562,0.04699639],"study_design_scores_gemma":[0.0001088443,0.0001476392,0.0004652057,0.00006168498,0.00004315149,0.0001715627,0.0002934374,0.4872953,0.01982683,0.4894389,0.002086456,0.00006105798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2903543,0.0002145562,0.7004678,0.0007982221,0.00004472714,0.0001638784,0.0005183368,0.0008004701,0.006637685],"genre_scores_gemma":[0.8864022,0.0001906522,0.1073355,0.0001435079,0.00002663368,0.0002590062,0.0007665689,0.00009172104,0.004784134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00378438,"threshold_uncertainty_score":0.01266003,"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."}}