{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002819305,0.0003476866,0.0003538207,0.0002486976,0.0002164643,0.0002382746,0.003144078,0.0004037211,0.0001254232],"category_scores_gemma":[0.00002510361,0.0003500229,0.0001668501,0.0004626664,0.0001454697,0.0006504969,0.004792543,0.001353584,0.0001152851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131264,"about_ca_system_score_gemma":0.0002935575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004369958,"about_ca_topic_score_gemma":0.00008905814,"domain_scores_codex":[0.9976724,0.0001329477,0.0001944155,0.00129542,0.0002241424,0.0004806187],"domain_scores_gemma":[0.9971517,0.000142669,0.0001534509,0.002111597,0.0001774852,0.0002631217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001610994,0.001006067,0.008925627,0.000474941,0.0004481225,0.003087072,0.002260513,0.4445739,0.001472034,0.4764868,0.03383544,0.02726842],"study_design_scores_gemma":[0.0004707321,0.00005328322,0.003042728,0.00009255939,0.00003371852,0.000005889356,0.00004882486,0.9655036,0.0003180957,0.02169579,0.008165075,0.0005696898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.145683,0.00004008751,0.8502337,0.0004610826,0.001004998,0.00027693,0.00009092104,0.0003074356,0.001901845],"genre_scores_gemma":[0.9831458,0.0001449414,0.01325404,0.0002743865,0.0001674549,0.000001137744,0.00007212118,0.00002283909,0.002917244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8374628,"threshold_uncertainty_score":0.9998952,"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."}}