{"id":"W1484014009","doi":"10.1007/bfb0026093","title":"On the maximum path length of AVL trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Path length; Path (computing); Tree (set theory); Bounded function; Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","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.001603832,0.0007258336,0.001041487,0.003233722,0.001398934,0.002828672,0.002446197,0.001215902,0.009115627],"category_scores_gemma":[0.01600397,0.001011965,0.0006736843,0.004635498,0.001924838,0.007393714,0.002243412,0.003025386,0.001580269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00242365,"about_ca_system_score_gemma":0.0007828294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001517707,"about_ca_topic_score_gemma":0.00270924,"domain_scores_codex":[0.9987431,0.000323887,0.00007408563,0.0002497556,0.0004250695,0.0001842006],"domain_scores_gemma":[0.9841582,0.01251772,0.0009835466,0.0008564252,0.0008949715,0.0005893111],"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.000625496,0.000114385,0.004167167,0.001192535,0.000094731,0.0001882462,0.0009693417,0.08334456,0.01137398,0.6647772,0.02297723,0.2101752],"study_design_scores_gemma":[0.00003428758,0.00007242284,0.001588756,0.0001813831,0.00005337702,0.0002157078,0.0001992598,0.0931081,0.002477204,0.8896745,0.01235681,0.00003823046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3624991,0.0152861,0.4358881,0.004706053,0.000535241,0.0001708326,0.004076307,0.001550998,0.1752873],"genre_scores_gemma":[0.8078628,0.007144858,0.1581262,0.0006307657,0.0009345337,0.0003011532,0.003090477,0.001218172,0.02069101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009115627,"threshold_uncertainty_score":0.03049487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02152522107778041,"score_gpt":0.2674662943477522,"score_spread":0.2459410732699717,"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."}}