{"id":"W2526250255","doi":"10.1007/978-3-540-28629-5_34","title":"Graph Exploration by a Finite Automaton","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Planar graph; Graph; Combinatorics; Discrete mathematics; Butterfly graph; Book embedding; Mathematics; Computer science; Voltage graph; Topology (electrical circuits); Line graph; 1-planar graph","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.0002487029,0.0003331415,0.000510846,0.0005195782,0.0007729844,0.0009980059,0.0008645539,0.0008877842,0.008086923],"category_scores_gemma":[0.001877273,0.0003372882,0.001047137,0.0006175728,0.001238296,0.001660058,0.001227042,0.001032527,0.0006556932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005813927,"about_ca_system_score_gemma":0.0005436888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001770894,"about_ca_topic_score_gemma":0.002235261,"domain_scores_codex":[0.9997714,0.000065342,0.0000129922,0.00007057613,0.00004917961,0.00003050541],"domain_scores_gemma":[0.9989457,0.0007492863,0.00003261077,0.0001613627,0.00006032452,0.00005069221],"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.0002706654,0.00009964406,0.001236418,0.000288809,0.00006895629,0.0004136123,0.0005912533,0.2235187,0.01725934,0.6560557,0.00462993,0.09556697],"study_design_scores_gemma":[0.00003519395,0.00005263141,0.0001801647,0.00002920378,0.00002571443,0.0001246339,0.00006425651,0.5219153,0.003785539,0.4686369,0.005131782,0.00001868504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.155582,0.0004722669,0.7938519,0.0007081215,0.0001520658,0.0001085976,0.0003197521,0.002592899,0.04621235],"genre_scores_gemma":[0.7906886,0.0002796911,0.1914767,0.0001085882,0.00002969106,0.0001744506,0.0002435257,0.0003316118,0.01666705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008086923,"threshold_uncertainty_score":0.02705342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02212324347846295,"score_gpt":0.2503645302930045,"score_spread":0.2282412868145416,"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."}}