{"id":"W2152844281","doi":"10.4204/eptcs.170.6","title":"Simple Balanced Binary Search Trees","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ternary search tree; Weight-balanced tree; Binary search tree; Simple (philosophy); Binary number; Optimal binary search tree; Implementation; Basis (linear algebra); Code (set theory)","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.002712852,0.0002345231,0.0002652857,0.0003530994,0.0003951927,0.0005964268,0.003931891,0.00007479986,0.00001936876],"category_scores_gemma":[0.0001308418,0.0001918762,0.00005202394,0.002105481,0.001126861,0.001502546,0.001938007,0.0005269556,0.0000409244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000208041,"about_ca_system_score_gemma":0.0002240403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006777938,"about_ca_topic_score_gemma":0.000001178003,"domain_scores_codex":[0.9962009,0.00004401887,0.0003165327,0.001114346,0.000899336,0.001424819],"domain_scores_gemma":[0.9988138,0.0001606013,0.00006430493,0.0005204647,0.0001891139,0.000251732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008832041,0.00006146005,0.0004090373,0.000006526693,0.000001424008,0.000002115589,0.0001908458,0.00008044494,0.003344615,0.9599571,0.00008487955,0.03585267],"study_design_scores_gemma":[0.000295468,0.0004299365,0.00311137,0.00002943305,0.00000103205,0.00002192534,0.000005515168,0.7829113,0.004240319,0.2081164,0.0006127433,0.0002245576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1285976,0.00005131993,0.8672216,0.0006859798,0.0001934922,0.0001773553,5.212413e-7,0.0002419643,0.002830172],"genre_scores_gemma":[0.9556821,0.00001477703,0.04369137,0.0004152875,0.0001628166,0.00001396658,0.000001147388,0.00001052476,0.00000799265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8270845,"threshold_uncertainty_score":0.7824484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005834959949034589,"score_gpt":0.2472220491269385,"score_spread":0.2413870891779039,"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."}}