{"id":"W2112729204","doi":"10.1007/s00236-008-0069-0","title":"Weighted height of random trees","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Weight-balanced tree; Combinatorics; Binary search tree; Theory of computation; Extension (predicate logic); Tree (set theory); Set (abstract data type); Random binary tree; Binary logarithm; Discrete mathematics; Ternary search tree; Constant (computer programming); Binary tree; Algorithm; Tree structure; Computer science; Interval tree","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.0001318521,0.00008374704,0.0001548039,0.0001059351,0.00007629194,0.0000452263,0.0008834621,0.00002305521,0.00005868233],"category_scores_gemma":[0.000022768,0.00006331052,0.00005015631,0.0002744292,0.00005378665,0.002073481,0.0002770886,0.00005065349,0.0001400226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005930881,"about_ca_system_score_gemma":0.00002130929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000654346,"about_ca_topic_score_gemma":7.721592e-7,"domain_scores_codex":[0.9991951,0.00001207002,0.0003028599,0.00007841755,0.0002476482,0.0001638887],"domain_scores_gemma":[0.9992496,0.0000607279,0.0001104229,0.00049614,0.00003566494,0.00004744183],"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.00009744929,0.0005008515,0.001508515,0.0003039096,0.0003800756,0.00008173556,0.01454439,0.00002022416,0.0003767944,0.2512127,0.4203132,0.3106602],"study_design_scores_gemma":[0.005458079,0.000261177,0.009328156,0.00007638707,0.00002923909,0.00006900748,0.0001458848,0.371096,0.006222144,0.003048141,0.6036345,0.0006313222],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05508727,0.00008651767,0.6363025,0.002277233,0.0005801659,0.0005414004,0.00001794979,0.0004240253,0.3046829],"genre_scores_gemma":[0.9117178,0.0001285483,0.08661316,0.0004459159,0.00003688478,0.00001003209,0.00002355846,0.000004681769,0.001019454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8566305,"threshold_uncertainty_score":0.2581728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01295459785249171,"score_gpt":0.2064052363635437,"score_spread":0.193450638511052,"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."}}