{"id":"W193394673","doi":"10.5220/0001336100610068","title":"ON DIGITAL SEARCH TREES - A Simple Method for Constructing Balanced Binary Trees","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary search tree; Simple (philosophy); Ternary search tree; Computer science; Optimal binary search tree; Weight-balanced tree; Binary tree; Binary number; Random binary tree; Theoretical computer science; Algorithm; Mathematics; Arithmetic; K-ary tree; Tree structure; Interval tree","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":[],"consensus_categories":[],"category_scores_codex":[0.0005406106,0.0001439826,0.0002036745,0.0001121047,0.0001652338,0.0001056669,0.0002812528,0.00004012163,0.00001178604],"category_scores_gemma":[0.0001450883,0.0001120759,0.00007651583,0.0002560507,0.00005041512,0.000847182,0.0001727796,0.00008106644,0.00001378513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003067568,"about_ca_system_score_gemma":0.00004014295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004855015,"about_ca_topic_score_gemma":0.00009679492,"domain_scores_codex":[0.9986774,0.00002494077,0.0002600743,0.0004040096,0.0002165215,0.0004170185],"domain_scores_gemma":[0.9982304,0.001105208,0.00006207831,0.0004232522,0.00007400979,0.0001050596],"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.00005901226,0.00004363222,0.0007049029,0.00002144099,0.00001914276,0.00002114893,0.000316449,0.0002055433,0.007073301,0.7551672,0.0007413249,0.2356269],"study_design_scores_gemma":[0.007940309,0.004081307,0.00681868,0.0003609908,0.00002484397,0.0005565255,0.01468074,0.4117151,0.2118092,0.04977587,0.2890081,0.003228298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02107056,0.0000213457,0.9727687,0.0001155319,0.0001557625,0.000251311,0.00006115612,0.0002110379,0.005344621],"genre_scores_gemma":[0.2793843,8.471027e-7,0.7198484,0.0001318912,0.00008109766,0.0000122257,0.00002027694,0.00001013643,0.0005108273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7053913,"threshold_uncertainty_score":0.4570322,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02787745641179899,"score_gpt":0.3328123971783863,"score_spread":0.3049349407665873,"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."}}