{"id":"W1980155648","doi":"10.1016/j.tcs.2004.07.031","title":"Optimal graph exploration without good maps","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Graph; Computer science; Mathematics; Theoretical computer science","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.0007855304,0.0008761737,0.001435775,0.001108552,0.0009116104,0.001357138,0.001106535,0.001923487,0.007158639],"category_scores_gemma":[0.008353266,0.0008537308,0.0009297192,0.001187752,0.001323063,0.004312681,0.002896153,0.001754599,0.0006840338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007378873,"about_ca_system_score_gemma":0.000985596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001712138,"about_ca_topic_score_gemma":0.002394961,"domain_scores_codex":[0.9993705,0.0002989564,0.00002002923,0.000115475,0.0001036022,0.00009136795],"domain_scores_gemma":[0.9962872,0.002833652,0.0001119323,0.0004807698,0.000125402,0.0001610222],"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.001419179,0.0002370657,0.001268001,0.000714373,0.0001607457,0.0002441759,0.0004556339,0.5891887,0.005097709,0.257098,0.01639659,0.1277197],"study_design_scores_gemma":[0.0001107541,0.0001026484,0.0002930834,0.00004391444,0.0000490593,0.0001012855,0.00009332078,0.636344,0.001638354,0.3581721,0.003034932,0.00001665562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2704399,0.002718221,0.6738353,0.003428087,0.0002640167,0.0001777224,0.0006881281,0.002164073,0.04628455],"genre_scores_gemma":[0.8183689,0.0006436383,0.167105,0.0003507631,0.00007684183,0.0001718336,0.0003596246,0.0003894416,0.01253396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007158639,"threshold_uncertainty_score":0.02394801,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01837253555669641,"score_gpt":0.2655600713819139,"score_spread":0.2471875358252175,"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."}}