{"id":"W2621324178","doi":"10.5555/1283383.1283446","title":"Tree exploration with logarithmic memory","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Computer science; Node (physics); Tree (set theory); Network topology; Logarithm; Binary logarithm; Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Task (project management); Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence","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.0003988937,0.0005783822,0.0007582689,0.0004298304,0.0006170056,0.001091644,0.00141324,0.0009965398,0.00716597],"category_scores_gemma":[0.003846026,0.000274197,0.0005297601,0.0009908231,0.0007208548,0.003831779,0.001721893,0.0007996842,0.001139357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006579951,"about_ca_system_score_gemma":0.0006754559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001879476,"about_ca_topic_score_gemma":0.001933043,"domain_scores_codex":[0.9996133,0.0000886066,0.00002138419,0.00008327147,0.00007233626,0.0001211983],"domain_scores_gemma":[0.9983608,0.001064085,0.0001221582,0.0002602533,0.00009726459,0.00009546176],"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.001632776,0.0001852652,0.001571462,0.0005449223,0.00008369789,0.0004077181,0.0003759915,0.7722874,0.009961211,0.07838773,0.009081185,0.1254806],"study_design_scores_gemma":[0.00009792434,0.000114507,0.0001659209,0.00001953003,0.00002255103,0.0001063137,0.00005434522,0.9084169,0.002803464,0.08522197,0.002964132,0.00001244377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1938203,0.002284434,0.7768444,0.001349244,0.000127634,0.0001224347,0.0006126657,0.002367051,0.02247174],"genre_scores_gemma":[0.7500607,0.0009946837,0.237097,0.0002758465,0.00006100246,0.0003002389,0.0005950084,0.0002924401,0.01032314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00716597,"threshold_uncertainty_score":0.02397257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01810498012002898,"score_gpt":0.2619032041318963,"score_spread":0.2437982240118673,"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."}}