{"id":"W1587123803","doi":"10.1007/978-3-540-92182-0_13","title":"Succinct and I/O Efficient Data Structures for Traversal in Trees","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Tree (set theory); Path (computing); Binary tree; Binary logarithm; Node (physics); Combinatorics; Graph traversal; Computer science; Data structure; Constant (computer programming); Root (linguistics); B-tree; Discrete mathematics; Asymptotically optimal algorithm; Binary number; Binary search tree; Mathematics; Algorithm; Arithmetic; Physics; Computer network; Operating system","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.0007074127,0.001018761,0.0008747381,0.001362154,0.0008144578,0.002587171,0.002091794,0.0009989666,0.008292759],"category_scores_gemma":[0.005201345,0.0009237961,0.0009126881,0.004457412,0.001180213,0.006202694,0.002225045,0.00231621,0.002768555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288703,"about_ca_system_score_gemma":0.001513165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001408195,"about_ca_topic_score_gemma":0.003174902,"domain_scores_codex":[0.9987804,0.000143091,0.0001752755,0.0001258404,0.0006380077,0.0001373699],"domain_scores_gemma":[0.9966165,0.001174586,0.0002641742,0.001327456,0.0005049255,0.0001122536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007573222,0.0003558144,0.001775384,0.001127685,0.00006330932,0.0002635759,0.0008952178,0.04649888,0.03882022,0.2977458,0.06089458,0.5508022],"study_design_scores_gemma":[0.0002457793,0.0003968961,0.001073378,0.0004787865,0.0001380958,0.0006544379,0.000522439,0.2799582,0.07225783,0.5636604,0.08047199,0.0001417035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0373994,0.001918939,0.9395187,0.0008377791,0.0002876092,0.0002120685,0.0026296,0.005474281,0.01172164],"genre_scores_gemma":[0.2404134,0.001896837,0.7261791,0.0004802536,0.0002010981,0.0004982986,0.00800948,0.00243748,0.01988401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008292759,"threshold_uncertainty_score":0.02774209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0285922626089211,"score_gpt":0.2633235455582299,"score_spread":0.2347312829493088,"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."}}