{"id":"W2076172709","doi":"10.1145/765568.765571","title":"The height of a random binary search tree","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Binary search tree; Combinatorics; Binary number; Random binary tree; Mathematics; Binary tree; Tree (set theory); Self-balancing binary search tree; Optimal binary search tree; Discrete mathematics; K-ary tree; Arithmetic; Tree structure","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.00127681,0.0001883287,0.0004930252,0.0007928117,0.0005069122,0.001213927,0.0008555268,0.0007686891,0.003734874],"category_scores_gemma":[0.01513907,0.0003615063,0.0002285816,0.0008379942,0.0007660544,0.002322009,0.001053945,0.0006897877,0.0008418041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076261,"about_ca_system_score_gemma":0.0008490996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207216,"about_ca_topic_score_gemma":0.001666323,"domain_scores_codex":[0.9990163,0.000246831,0.0000362747,0.0001788484,0.0002953572,0.0002263256],"domain_scores_gemma":[0.9939693,0.003959205,0.0005176853,0.0006426409,0.0004805434,0.0004305405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001591807,0.0001882792,0.0319655,0.0006123677,0.0001922649,0.0005293419,0.0005745748,0.3476055,0.04613889,0.359686,0.02747069,0.1834448],"study_design_scores_gemma":[0.0001299445,0.0002817945,0.01065106,0.00008914727,0.00007075324,0.0007613657,0.0002307066,0.758586,0.008502944,0.2113518,0.009274228,0.00007031875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6811479,0.002899147,0.2848557,0.003506045,0.0002390943,0.0001159136,0.002195911,0.001040865,0.02399931],"genre_scores_gemma":[0.9622296,0.0007103921,0.03211674,0.000300273,0.00009915618,0.0000716391,0.0007049791,0.0001319106,0.003635389],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003734874,"threshold_uncertainty_score":0.01249444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02206708586160027,"score_gpt":0.2553730957915877,"score_spread":0.2333060099299874,"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."}}