{"id":"W1480201994","doi":"10.1007/978-3-642-17517-6_12","title":"Should Static Search Trees Ever Be Unbalanced?","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tree (set theory); Computer science; Search tree; R-tree; Binary logarithm; Optimal binary search tree; K-ary tree; Running time; Combinatorics; Tree structure; Algorithm; Mathematics; Search algorithm; Interval tree; Binary tree; Statistics","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.0009647622,0.0006287451,0.0006057112,0.0007622346,0.0004128776,0.0008806678,0.005548148,0.0004919135,0.0001041289],"category_scores_gemma":[0.00007492631,0.0005154356,0.0001363416,0.0006244133,0.0009161532,0.001106585,0.003097526,0.001905415,0.0000785455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001870597,"about_ca_system_score_gemma":0.0007388163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007399783,"about_ca_topic_score_gemma":0.0001277216,"domain_scores_codex":[0.9947342,0.00004381281,0.0005329592,0.001935354,0.001825129,0.0009285572],"domain_scores_gemma":[0.9961674,0.0005741168,0.0002122306,0.002440663,0.0002936264,0.0003120065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009099897,0.00006312812,0.00006694467,0.00004935598,0.00001519781,0.0002144547,0.00102542,0.01170812,0.001287524,0.01578731,0.0002977373,0.9694757],"study_design_scores_gemma":[0.0004621357,0.0002528812,0.0004159754,0.0004407388,0.000009831146,0.0001063228,2.794293e-7,0.8502619,0.004177931,0.1189713,0.02370648,0.001194139],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001055961,0.0002286292,0.9925194,0.00213916,0.002311784,0.0003679698,0.00002952202,0.0002072142,0.00209074],"genre_scores_gemma":[0.02919063,0.00008602752,0.9643143,0.003926743,0.001102102,0.00001343531,0.00003228285,0.00006479109,0.001269675],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9682816,"threshold_uncertainty_score":0.9998323,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03550106160354684,"score_gpt":0.288388382224733,"score_spread":0.2528873206211862,"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."}}