{"id":"W2002942860","doi":"10.5555/545381.545459","title":"Tree exploration with little memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Node (physics); Binary logarithm; Degree (music); Bounded function; Tree (set theory); Computer science; Task (project management); Upper and lower bounds; Time complexity; Combinatorics; Mathematics; Discrete mathematics; Algorithm; 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.0003020568,0.0005610649,0.0008695224,0.0004359829,0.0007057263,0.000956534,0.00138457,0.000931151,0.007056542],"category_scores_gemma":[0.002191718,0.0003694473,0.0005551208,0.000714401,0.0007148192,0.003054317,0.002182713,0.0007716914,0.001641731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004388332,"about_ca_system_score_gemma":0.0006698163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001171892,"about_ca_topic_score_gemma":0.00193799,"domain_scores_codex":[0.9996859,0.00006544842,0.0000237738,0.00007958196,0.00005561128,0.00008977059],"domain_scores_gemma":[0.9989418,0.0005337318,0.0000908212,0.0002791879,0.00007993378,0.00007446847],"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.002825014,0.0002137872,0.002330647,0.0009176132,0.0001258388,0.0006083329,0.000850187,0.3592564,0.06001699,0.09096088,0.02031443,0.4615799],"study_design_scores_gemma":[0.0002049571,0.0003089213,0.0005691635,0.0000693024,0.00006021361,0.0003435664,0.0001492936,0.8336221,0.01786022,0.1348432,0.0119257,0.00004341224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1313197,0.001534878,0.8439602,0.0009373775,0.00007491003,0.00009723577,0.0003627918,0.00490731,0.01680561],"genre_scores_gemma":[0.6101838,0.0007075136,0.3758174,0.0003192832,0.00004251537,0.0003113568,0.0007144837,0.0003867079,0.011517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007056542,"threshold_uncertainty_score":0.02360648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05055938543296268,"score_gpt":0.226879259790743,"score_spread":0.1763198743577803,"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."}}