{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004871408,0.0003641258,0.0007016008,0.0007656249,0.001114587,0.001388597,0.001161636,0.001375167,0.006801763],"category_scores_gemma":[0.004452002,0.0004094943,0.001352633,0.0007514482,0.001745728,0.002304768,0.001599216,0.001275118,0.0004251634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009321412,"about_ca_system_score_gemma":0.0008770557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002739653,"about_ca_topic_score_gemma":0.003243069,"domain_scores_codex":[0.9995484,0.0001641647,0.00002514828,0.000128284,0.00007610532,0.00005782294],"domain_scores_gemma":[0.9963966,0.002808359,0.0001102875,0.0003787628,0.0001588907,0.0001470409],"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.0004877019,0.0001531003,0.002215046,0.0002692413,0.0001108679,0.0004406645,0.0006469222,0.3159089,0.01079239,0.6163535,0.002936012,0.04968576],"study_design_scores_gemma":[0.0000488735,0.00005487637,0.0001749536,0.00002080918,0.00002911042,0.00007525997,0.00005852701,0.6549804,0.001765682,0.3411914,0.001583179,0.00001700004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.348976,0.0004381552,0.6217843,0.001460793,0.0001515614,0.0001126739,0.0003558214,0.001845948,0.02487486],"genre_scores_gemma":[0.8981665,0.0001519779,0.09494936,0.0001126499,0.00002340291,0.0001373034,0.0001485573,0.0001637725,0.00614637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006801763,"threshold_uncertainty_score":0.02275413,"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."}}