{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000476374,0.0001332387,0.0001417154,0.000214694,0.0006704527,0.00009720715,0.001381081,0.00003518379,0.0003852554],"category_scores_gemma":[0.00003973632,0.0001478008,0.0000922421,0.0005594213,0.00004841122,0.0003751522,0.00006144453,0.0003262298,0.0001848386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001685941,"about_ca_system_score_gemma":0.00008739696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001019567,"about_ca_topic_score_gemma":7.878219e-7,"domain_scores_codex":[0.9982262,0.000240931,0.0002796646,0.000408343,0.00063145,0.0002134387],"domain_scores_gemma":[0.9987036,0.0003221803,0.0001065526,0.0007089485,0.00009935282,0.0000593962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003638832,0.0006454663,0.00001778989,0.000008853135,0.00004642192,0.00001036023,0.0003957636,0.6281593,0.00009414453,0.25659,0.0004393986,0.1135561],"study_design_scores_gemma":[0.0008188415,0.0006296271,0.004108572,0.000007801505,0.00001694849,0.0001550068,0.00008735201,0.7050904,0.0003186675,0.2787678,0.009615025,0.0003839587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001988355,0.00001956962,0.9923127,0.00279138,0.0007895751,0.0002156654,0.00003468926,0.000428542,0.00141954],"genre_scores_gemma":[0.4540055,0.000001789614,0.54421,0.001430699,0.00001680432,0.0001116947,0.0000156582,0.000007911343,0.0001999434],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4520172,"threshold_uncertainty_score":0.6027141,"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."}}