{"id":"W2953361111","doi":"10.48550/arxiv.1006.3715","title":"Should Static Search Trees Ever Be Unbalanced?","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Tree (set theory); Search tree; Binary logarithm; Combinatorics; Mathematics; R-tree; Computer science; Algorithm; Statistics; Search algorithm","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.003206158,0.0005612762,0.001127358,0.0008496495,0.001862824,0.002119646,0.001720796,0.00198223,0.003810703],"category_scores_gemma":[0.03723001,0.0008908101,0.0005549915,0.001770145,0.002160423,0.01066828,0.00218866,0.001540134,0.001474165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001080852,"about_ca_system_score_gemma":0.001530105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001777599,"about_ca_topic_score_gemma":0.002872372,"domain_scores_codex":[0.9966449,0.0006469369,0.0002639026,0.0006170449,0.001028992,0.0007983098],"domain_scores_gemma":[0.9765357,0.01283551,0.002228227,0.00548328,0.002153472,0.0007637264],"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.003434194,0.0004310826,0.03861519,0.001160358,0.0002329412,0.001515336,0.001646051,0.1546865,0.07802743,0.2301108,0.02812906,0.4620112],"study_design_scores_gemma":[0.000315936,0.001044038,0.009959483,0.0002836587,0.0003223853,0.003647906,0.001768983,0.3653699,0.04551166,0.4915768,0.08005528,0.0001440191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4731854,0.002978675,0.4952794,0.005653284,0.0003971906,0.0002557819,0.001193134,0.002933101,0.018124],"genre_scores_gemma":[0.8658252,0.001190434,0.1241722,0.001444329,0.0003675846,0.0002153918,0.001183715,0.0008221486,0.004779174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003810703,"threshold_uncertainty_score":0.01695603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1335618447808292,"score_gpt":0.2309265861200713,"score_spread":0.09736474133924206,"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."}}