{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478314,0.00004746895,0.0001008195,0.00004450654,0.0001241491,0.00009874679,0.004501902,0.00001164279,0.00000712571],"category_scores_gemma":[0.0004264396,0.0000203547,0.0001194968,0.0002579943,0.00004724506,0.0003242248,0.0008085978,0.000135176,0.000006126872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001104224,"about_ca_system_score_gemma":0.00004523672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001720146,"about_ca_topic_score_gemma":0.000001116862,"domain_scores_codex":[0.9990746,0.0001683022,0.0002154212,0.00005652305,0.0003646413,0.000120477],"domain_scores_gemma":[0.9984182,0.0002177744,0.0001828403,0.001079906,0.00007186519,0.00002940086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003445711,0.000575363,0.004336374,0.00005822267,0.0007046391,0.0001873757,0.002089868,0.0006688822,0.005586187,0.13886,0.4725634,0.3740251],"study_design_scores_gemma":[0.01123443,0.001006423,0.03005316,0.0002885969,0.0001470185,0.0004886622,0.0006552438,0.01818152,0.03175936,0.1864914,0.7192405,0.0004536259],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5000078,0.0114885,0.2049857,0.2108533,0.01335265,0.001242321,0.00001023626,0.00006983639,0.05798969],"genre_scores_gemma":[0.9264168,0.000895759,0.06336858,0.0006312403,0.0003536248,0.000002075007,2.137212e-7,0.0000141077,0.00831763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.426409,"threshold_uncertainty_score":0.836573,"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."}}