{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352531,0.0002183733,0.0001728686,0.0002495863,0.0002021088,0.0002369991,0.000646357,0.000084442,0.00003155974],"category_scores_gemma":[0.00001259178,0.0001687747,0.00005853512,0.0006144922,0.00008455082,0.001081741,0.0001156764,0.0002144702,0.0001709031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006366627,"about_ca_system_score_gemma":0.00007762713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002355868,"about_ca_topic_score_gemma":0.0000417519,"domain_scores_codex":[0.9979938,0.00007313723,0.0002797395,0.0005396429,0.0006207288,0.0004929914],"domain_scores_gemma":[0.9988064,0.00008202407,0.0001008127,0.0006421104,0.0001423806,0.0002262448],"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.000509489,0.001020255,0.0003563878,0.0001138608,0.0002634829,0.0006933977,0.01168429,0.04540448,0.01409587,0.1642675,0.006504893,0.755086],"study_design_scores_gemma":[0.004978078,0.003824594,0.001639856,0.0001797525,0.00003189244,0.0001162349,0.0009802798,0.9282581,0.04161007,0.004242227,0.01236941,0.001769531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004258623,0.00002581649,0.9380558,0.00378284,0.0002864884,0.0003925367,0.000002877551,0.0003349183,0.05669292],"genre_scores_gemma":[0.356058,0.0002139585,0.6277052,0.00324654,0.0006691257,0.0001570676,0.0001024221,0.0001173103,0.01173033],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8828536,"threshold_uncertainty_score":0.6882432,"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."}}