{"id":"W1501234213","doi":"10.1007/11821069_2","title":"Tree Exploration with an Oracle","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Oracle; Traverse; Tree (set theory); Tree traversal; Competitive analysis; Computer science; Enhanced Data Rates for GSM Evolution; Algorithm; Mathematics; Mathematical optimization; Theoretical computer science; Combinatorics; Artificial intelligence; Upper and lower bounds; Geography","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.0006530234,0.0006106953,0.0009013192,0.0007058904,0.000438562,0.001227986,0.001229079,0.00107721,0.014602],"category_scores_gemma":[0.003950267,0.0003680952,0.0008339043,0.001221938,0.0006044881,0.003074272,0.002172611,0.001926789,0.003925465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003505268,"about_ca_system_score_gemma":0.0006804785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004762359,"about_ca_topic_score_gemma":0.001058892,"domain_scores_codex":[0.9994916,0.0001392373,0.00003177969,0.0001064683,0.0001656236,0.00006531816],"domain_scores_gemma":[0.9988211,0.0006237495,0.00003129673,0.0003671541,0.00009298357,0.00006368478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005878282,0.0001757411,0.0006647665,0.0005173586,0.00005835791,0.0001993074,0.0002033982,0.05444117,0.009893319,0.1524371,0.03938929,0.7414324],"study_design_scores_gemma":[0.0001223916,0.000230929,0.0004489517,0.0001938682,0.00008224269,0.0006517571,0.00008692923,0.5227126,0.01150818,0.4076187,0.05630409,0.00003927455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0193529,0.001848074,0.9175825,0.0008839055,0.0002761723,0.0001705506,0.0007757138,0.00604707,0.05306304],"genre_scores_gemma":[0.234523,0.001175628,0.7251137,0.0003686959,0.0001575673,0.0002277153,0.001675119,0.001526797,0.03523171],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.014602,"threshold_uncertainty_score":0.04884857,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02826344014817172,"score_gpt":0.2543926476781725,"score_spread":0.2261292075300008,"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."}}