{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006617435,0.0004280057,0.0003624928,0.0008885646,0.0002807385,0.000858314,0.002506264,0.0002879031,0.00005185329],"category_scores_gemma":[0.00007268404,0.0004032656,0.0001073106,0.0009110573,0.0004598254,0.001474882,0.0007562446,0.0006420053,0.000102477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002802658,"about_ca_system_score_gemma":0.0006774475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001888438,"about_ca_topic_score_gemma":0.00002273637,"domain_scores_codex":[0.9965087,0.00003712138,0.0004745068,0.001294461,0.001095292,0.0005899432],"domain_scores_gemma":[0.998007,0.0002283754,0.0002301124,0.001067299,0.0002589081,0.0002083253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003219591,0.00005154287,0.000007999729,0.00004179962,0.000009487085,0.00004509008,0.001444881,0.5514495,0.0001107682,0.1036088,0.0002114275,0.3430154],"study_design_scores_gemma":[0.0002731462,0.0001316356,0.000003782917,0.0002182201,0.000002217023,0.00001121406,8.22421e-8,0.6356018,0.0006841304,0.3607855,0.001840677,0.0004476596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003592377,0.0002479451,0.9921163,0.002199698,0.0008691955,0.000422845,0.000006034553,0.0003484507,0.003785905],"genre_scores_gemma":[0.04777187,0.0003710057,0.9457841,0.004345533,0.0002772649,0.00004025281,0.0000510176,0.00007060209,0.00128839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3425678,"threshold_uncertainty_score":0.9998419,"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."}}