{"id":"W2079850117","doi":"10.1007/s00453-011-9528-z","title":"Succinct and I/O Efficient Data Structures for Traversal in Trees","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Tree traversal; Combinatorics; Tree (set theory); Path (computing); Constant (computer programming); Mathematics; Binary tree; Binary logarithm; Data structure; Theory of computation; Discrete mathematics; Binary number; Node (physics); Physics; Algorithm; Computer science; Arithmetic","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.0002168505,0.0001279658,0.0001534217,0.00009560353,0.00008248197,0.00006609785,0.001208007,0.00005571402,0.00001304599],"category_scores_gemma":[0.00002849208,0.0001035699,0.00002014497,0.0001408932,0.00004565093,0.0003423904,0.0007896009,0.00008517755,0.000003400948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001242744,"about_ca_system_score_gemma":0.00003504775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002505233,"about_ca_topic_score_gemma":0.00004423059,"domain_scores_codex":[0.9988506,0.00002769159,0.0001796738,0.0005437183,0.0001404898,0.0002578721],"domain_scores_gemma":[0.9988682,0.00008362602,0.00004954983,0.0008916857,0.00002466092,0.00008227985],"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.00006020819,0.0002262909,0.0008321816,0.00002840699,0.00003217431,0.00005060565,0.002379282,0.00004890054,0.0003397164,0.04342663,0.003291598,0.949284],"study_design_scores_gemma":[0.001153568,0.000151197,0.04999511,0.00002144438,0.0000101344,0.00002959681,0.00007657802,0.9329101,0.001466368,0.008599479,0.005293922,0.0002925424],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03271407,0.0003266425,0.965462,0.0001481784,0.0004207351,0.0003356643,0.0001538622,0.00008805867,0.0003507583],"genre_scores_gemma":[0.5628452,0.00001591855,0.4368418,0.0000908529,0.00009492972,0.00001298841,0.00005960206,0.00001105926,0.00002761572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9489915,"threshold_uncertainty_score":0.4223456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05772345621798793,"score_gpt":0.2688078761154939,"score_spread":0.211084419897506,"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."}}