{"id":"W2152623377","doi":"10.1145/1921659.1921663","title":"Tree exploration with logarithmic memory","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Tree traversal; Node (physics); Traverse; Binary logarithm; Computer science; Tree (set theory); Logarithm; Graph; Upper and lower bounds; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Algorithm","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.0004768119,0.000664183,0.0008101299,0.0005319755,0.0007569289,0.001424194,0.001759413,0.001157632,0.00890852],"category_scores_gemma":[0.004698718,0.0003416073,0.0006814786,0.001215762,0.0008332919,0.005341371,0.002135182,0.0009566001,0.001580247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008616146,"about_ca_system_score_gemma":0.0008052894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002094957,"about_ca_topic_score_gemma":0.002395911,"domain_scores_codex":[0.9994701,0.0001121409,0.00003061478,0.0001179183,0.0001037607,0.0001655114],"domain_scores_gemma":[0.9979072,0.00124034,0.0001733104,0.0004219531,0.0001325792,0.0001247592],"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.002172488,0.0002452257,0.002285818,0.0006837369,0.0001064648,0.0005083198,0.0005145972,0.690487,0.01392836,0.1185366,0.01355054,0.1569808],"study_design_scores_gemma":[0.0001058329,0.0001382068,0.0001916151,0.00002527294,0.00003288222,0.0001377789,0.00007026217,0.8732919,0.003567233,0.1180793,0.004342837,0.00001689732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1772003,0.002035035,0.7905157,0.001488724,0.0001464855,0.0001396739,0.0007438735,0.003079285,0.02465086],"genre_scores_gemma":[0.7061142,0.0009093629,0.2783747,0.0003566244,0.00006529933,0.0003085715,0.0008090432,0.0004284189,0.01263382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00890852,"threshold_uncertainty_score":0.02980196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0695535220691234,"score_gpt":0.2535367779472618,"score_spread":0.1839832558781384,"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."}}