{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003301436,0.0003718868,0.0007329789,0.0005550642,0.0008605169,0.0009767979,0.001189848,0.001247462,0.004354257],"category_scores_gemma":[0.002095704,0.0004029384,0.0006339853,0.000460407,0.001206425,0.001337784,0.001500313,0.0008695829,0.0003425677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006173725,"about_ca_system_score_gemma":0.0008006319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002741378,"about_ca_topic_score_gemma":0.003108023,"domain_scores_codex":[0.9997234,0.00006854373,0.00001640098,0.00008638559,0.0000522237,0.00005304848],"domain_scores_gemma":[0.9986815,0.0008435773,0.00008162185,0.0001682934,0.0001113944,0.0001135236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005483016,0.00013591,0.00162805,0.000174457,0.00007393423,0.0004523877,0.0002454908,0.8114321,0.01732022,0.13045,0.001189683,0.03634951],"study_design_scores_gemma":[0.00003425319,0.0000631879,0.0001195565,0.000009906182,0.00001284492,0.00003923931,0.00002040336,0.9590362,0.001993901,0.03821339,0.0004441051,0.00001306231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.480087,0.0002971706,0.50543,0.0006893735,0.0001270702,0.00007134287,0.0001823101,0.001356173,0.01175947],"genre_scores_gemma":[0.9368954,0.0000812467,0.05749592,0.00007521748,0.00001187334,0.00007256943,0.00006234529,0.00008031194,0.005225096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004354257,"threshold_uncertainty_score":0.01456648,"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."}}