{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001578079,0.0001472927,0.000117432,0.0002176602,0.0002233931,0.0000857399,0.0007362236,0.00006411206,0.0002666665],"category_scores_gemma":[0.000007790118,0.0001224609,0.00005050676,0.0005401477,0.00006262006,0.001135288,0.00001115016,0.0002067058,0.0002222672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003134851,"about_ca_system_score_gemma":0.00007181164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005568924,"about_ca_topic_score_gemma":0.00005985586,"domain_scores_codex":[0.9988433,0.00006744349,0.0001731219,0.000362276,0.0003050165,0.0002488798],"domain_scores_gemma":[0.9988551,0.00004321708,0.00004746684,0.0008075977,0.0001176226,0.0001289622],"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.00003003994,0.0003737947,0.000005201281,0.00000696831,0.00004248137,0.00002220457,0.003219703,0.002989517,0.00006859488,0.00171331,0.00009367929,0.9914345],"study_design_scores_gemma":[0.006268807,0.004485484,0.002132857,0.0001419301,0.00008568359,0.0002220401,0.002026498,0.9080893,0.04564631,0.02540511,0.003562158,0.001933816],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001296158,0.000009739053,0.9905366,0.001028068,0.0002131923,0.0002564579,0.000003004491,0.0003451985,0.007478113],"genre_scores_gemma":[0.1006818,0.00006379067,0.8968768,0.0004445191,0.00002771269,0.0001321607,0.000003892369,0.0000217825,0.001747586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9895007,"threshold_uncertainty_score":0.4993809,"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."}}