{"id":"W2039936247","doi":"10.1016/j.tcs.2005.07.014","title":"Graph exploration by a finite automaton","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Butterfly graph; Robot; Regular graph; Upper and lower bounds; Voltage graph; Computer science; Line graph; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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.001114079,0.0001363372,0.0001234795,0.0002025152,0.0003959368,0.0007006584,0.001823932,0.00004139156,0.00007726756],"category_scores_gemma":[0.00006377375,0.0001147411,0.00004361604,0.001438848,0.001168217,0.002299391,0.0005615748,0.0001475988,0.0002833978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004518756,"about_ca_system_score_gemma":0.00009071823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001080564,"about_ca_topic_score_gemma":3.43402e-7,"domain_scores_codex":[0.9978758,0.0001005467,0.0002421957,0.000565295,0.0007259984,0.0004902178],"domain_scores_gemma":[0.9987361,0.0001419702,0.00005038867,0.0005982959,0.0001820114,0.0002912778],"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.000001554988,0.00005458294,0.000005386856,0.000001862398,0.000001204159,0.000001146082,0.0004658638,0.005866795,0.0003272131,0.9339461,0.0008749659,0.05845338],"study_design_scores_gemma":[0.0001724142,0.00009950474,0.00001839989,0.000008922168,8.433609e-7,0.000005998459,0.000002515826,0.9257401,0.003574315,0.06817894,0.002044458,0.000153587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001017688,0.00002185034,0.9868971,0.007342363,0.000203155,0.0001505767,0.000001102647,0.0004303821,0.003935797],"genre_scores_gemma":[0.6760599,0.00001242065,0.3223915,0.001425604,0.00005873931,0.000009546527,0.000001682295,0.000005002157,0.00003564327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9198733,"threshold_uncertainty_score":0.6756465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01346512824973406,"score_gpt":0.2579631548572839,"score_spread":0.2444980266075498,"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."}}