{"id":"W3123946441","doi":"10.1145/3558549","title":"Continuous One-counter Automata","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Reachability; Decidability; Upper and lower bounds; Reachability problem; Automaton; Mathematics; Discrete mathematics; Combinatorics; Counterexample; Parametric statistics; Computer science; Theoretical computer science","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.001216676,0.0009239536,0.0008562,0.0007883992,0.0009845528,0.002530408,0.002673777,0.001646534,0.005112284],"category_scores_gemma":[0.007438368,0.000408821,0.001070435,0.001101827,0.003231212,0.003375151,0.001683488,0.002403277,0.000593384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902598,"about_ca_system_score_gemma":0.001488144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003232857,"about_ca_topic_score_gemma":0.002124327,"domain_scores_codex":[0.9979789,0.0003926036,0.000132356,0.000732737,0.0004786608,0.0002847953],"domain_scores_gemma":[0.99045,0.006714375,0.0008251768,0.0008857205,0.000680426,0.000444279],"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.000395442,0.0001962728,0.002593389,0.0005320319,0.00007226796,0.001057496,0.0006016541,0.1886994,0.012673,0.756767,0.002577637,0.03383448],"study_design_scores_gemma":[0.00009603148,0.0001543148,0.0004054316,0.00007429165,0.0000676255,0.000408758,0.0001589835,0.5957718,0.008750703,0.3861524,0.007897545,0.00006219707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1230668,0.001113036,0.8475457,0.0009777687,0.0002084583,0.0002672709,0.0006880374,0.001604468,0.02452853],"genre_scores_gemma":[0.8332484,0.0004965217,0.157927,0.000278203,0.00009750461,0.0003154658,0.0005811119,0.0001262053,0.00692951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005112284,"threshold_uncertainty_score":0.0171023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05042667329219194,"score_gpt":0.2983654345820899,"score_spread":0.2479387612898979,"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."}}