{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006144014,0.0004691794,0.0005233526,0.0007001188,0.000262683,0.0003807039,0.004536664,0.0002598371,0.000005716219],"category_scores_gemma":[0.00008696909,0.0003887147,0.00005585657,0.0003455408,0.0005421478,0.0005864598,0.003391309,0.0005083889,0.000002675455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001216813,"about_ca_system_score_gemma":0.0003877894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007585324,"about_ca_topic_score_gemma":0.0002332784,"domain_scores_codex":[0.9961821,0.00002565096,0.0004610592,0.002034289,0.000703275,0.0005936542],"domain_scores_gemma":[0.9968858,0.0005527943,0.0001913922,0.002122337,0.00009317344,0.0001545419],"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.00002009024,0.00003753328,0.00009594682,0.00004223909,0.000008217927,0.0001144355,0.0008813824,0.03411377,0.0000525949,0.006192732,0.0002222737,0.9582188],"study_design_scores_gemma":[0.0005858397,0.0001371499,0.001643292,0.0001967372,0.000004911179,0.0001092287,2.303382e-7,0.9738466,0.0001558964,0.01899243,0.00380938,0.0005183554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005086513,0.001229001,0.9960676,0.0002833373,0.001038427,0.0005170438,0.00008912798,0.00006862114,0.0001982273],"genre_scores_gemma":[0.1592192,0.0002816994,0.8390276,0.0006432474,0.0005814104,0.00001125535,0.0001013232,0.00004464017,0.00008965514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9577004,"threshold_uncertainty_score":0.9998565,"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."}}