{"id":"W4399412507","doi":"10.1016/j.dam.2024.05.024","title":"Graph exploration by a deterministic memoryless automaton with pebbles","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Mathematics; Deterministic automaton; Two-way deterministic finite automaton; Automaton; Graph; Büchi automaton; Combinatorics; Theoretical computer science; Discrete mathematics; Nondeterministic finite automaton; Algorithm; Finite-state machine; Computer science; Automata theory","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.0002185809,0.0001817877,0.0001804125,0.0001210649,0.0001190969,0.000672283,0.0004436859,0.00005322693,0.00002234996],"category_scores_gemma":[0.000008631501,0.000135191,0.00003906881,0.0004944456,0.00006535772,0.0004580998,0.0001029242,0.0001210895,0.00009605495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002388827,"about_ca_system_score_gemma":0.00006517203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001307046,"about_ca_topic_score_gemma":0.000002229118,"domain_scores_codex":[0.9987229,0.00001524724,0.0002571244,0.0003492594,0.0004013859,0.0002540673],"domain_scores_gemma":[0.9992539,0.0001046327,0.00006193517,0.0004389458,0.00003931305,0.0001012589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003997821,0.00008561234,0.000001333022,0.0005877022,0.00005031486,0.00002246028,0.00636273,0.001067628,0.002223566,0.9787791,0.003356631,0.007458957],"study_design_scores_gemma":[0.0002901097,0.00008872255,0.000001871121,0.0001773522,0.00002869581,0.00002581318,0.0005988888,0.9067975,0.003730577,0.08619723,0.001692088,0.0003711102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001049553,0.00007959813,0.9868702,0.0004094228,0.00006521263,0.0003921596,0.000008139384,0.0007171311,0.01040859],"genre_scores_gemma":[0.6053607,0.0000655026,0.393244,0.0001659067,0.00003351646,0.0003403946,0.00005482106,0.00005977503,0.0006753491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057299,"threshold_uncertainty_score":0.6482841,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01631122847895078,"score_gpt":0.2548495017715611,"score_spread":0.2385382732926103,"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."}}