{"id":"W2093885745","doi":"10.1145/1370256.1370277","title":"Revisiting 2DR-tree insertion","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Tree (set theory); Tree structure; Computer science; Node (physics); Space (punctuation); Data structure; Theoretical computer science; Algorithm; Mathematics; Binary tree; Engineering; Combinatorics","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.00009980171,0.0000436507,0.000043988,0.00004255628,0.0000952318,0.00006582228,0.0004158283,0.000009792729,0.00003072867],"category_scores_gemma":[0.00001137742,0.00003697666,0.00001917161,0.0001935839,0.000009649966,0.0008560898,0.0002252343,0.00002979574,0.000326228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006886129,"about_ca_system_score_gemma":0.000005921844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001455725,"about_ca_topic_score_gemma":0.000001136203,"domain_scores_codex":[0.9995189,0.00001078273,0.00008155165,0.0001565237,0.0001220116,0.000110268],"domain_scores_gemma":[0.9996452,0.00001074571,0.00002169496,0.0002802874,0.00001593231,0.00002616571],"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":[7.148732e-7,0.0000220415,0.003215292,0.000008443381,0.00000749038,0.00006266045,0.0001177027,0.000005728636,0.0002542445,0.1541313,0.02030515,0.8218693],"study_design_scores_gemma":[0.0009668665,0.0001043096,0.2220594,0.00005742957,0.000009084763,0.00009777911,0.00006579632,0.4166966,0.004059754,0.006399739,0.348658,0.0008253414],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01014235,0.00003159643,0.875684,0.001343885,0.0001428411,0.00004829161,2.134356e-7,0.0002782564,0.1123286],"genre_scores_gemma":[0.6876341,0.00009523878,0.2936668,0.001800201,0.0003121837,0.000005704041,0.00001087593,0.000006697333,0.01646819],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8210439,"threshold_uncertainty_score":0.419311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02936410522848626,"score_gpt":0.2305054446932966,"score_spread":0.2011413394648103,"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."}}