{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006000457,0.00003914271,0.00003619246,0.00004077646,0.00004939794,0.0001015745,0.000189101,0.00001333916,0.0005506924],"category_scores_gemma":[0.000005626316,0.00002746522,0.000009204919,0.000219772,0.00001297174,0.0007833298,0.00003272116,0.00003263238,0.0003644597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005724326,"about_ca_system_score_gemma":0.000006724024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004175147,"about_ca_topic_score_gemma":0.00001537535,"domain_scores_codex":[0.9995582,0.00002028266,0.00005821748,0.0001241553,0.0001432007,0.00009602065],"domain_scores_gemma":[0.9996781,0.00001311597,0.00001378685,0.0002022181,0.00004512934,0.00004765977],"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.000005614809,0.0002950604,0.0002077327,0.00001482,0.00001914726,0.00001986217,0.006701657,0.01324406,0.0003284736,0.2903662,0.0972559,0.5915414],"study_design_scores_gemma":[0.0002813441,0.0001052739,0.00004878472,0.00000365366,6.071487e-7,0.000003906365,0.00006633977,0.9915563,0.0009121059,0.0007527293,0.006182284,0.0000867023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008981455,0.0000145843,0.7884763,0.003282395,0.00002813129,0.00006116906,5.55458e-8,0.0001411034,0.2079064],"genre_scores_gemma":[0.3834441,0.00007574024,0.529465,0.001786725,0.00006144898,0.00003835166,0.000002634168,0.00001134799,0.08511464],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9783122,"threshold_uncertainty_score":0.6029695,"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."}}