{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001606137,0.0005014715,0.0005069836,0.0008418254,0.0002785017,0.0002388371,0.006635599,0.0002274683,0.00006403888],"category_scores_gemma":[0.0002511652,0.0003384207,0.0001912439,0.0008674838,0.001680914,0.0004286614,0.001632772,0.001202136,0.00006790504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001926539,"about_ca_system_score_gemma":0.0003859538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006828326,"about_ca_topic_score_gemma":0.00004686048,"domain_scores_codex":[0.9956295,0.00009649835,0.0005057793,0.001346725,0.001668539,0.0007529426],"domain_scores_gemma":[0.9945931,0.00221095,0.0003104387,0.002488049,0.0002535159,0.0001439052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001064224,0.00003200278,0.000008526126,0.00001087946,0.00000945707,0.00002861614,0.0003822563,0.01602438,0.0001217744,0.4558156,0.00002650409,0.5275294],"study_design_scores_gemma":[0.0001790968,0.0003195397,0.00005890631,0.0002844489,0.000003339486,0.00002523748,2.557656e-7,0.1086891,0.002489948,0.88599,0.001548658,0.0004114716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002304539,0.0003616999,0.9870604,0.001756174,0.000595881,0.0004439063,0.000007692763,0.00009331888,0.009450478],"genre_scores_gemma":[0.6815487,0.0001835177,0.312814,0.003273932,0.0006491901,0.0000278718,0.000003276456,0.00008832983,0.001411155],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6813183,"threshold_uncertainty_score":0.9999068,"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."}}