{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004665344,0.001109848,0.001611671,0.002282091,0.001374263,0.003536646,0.005260833,0.002322152,0.007057831],"category_scores_gemma":[0.02068512,0.001026362,0.002150668,0.004223396,0.001542776,0.009204681,0.004298068,0.002379915,0.005022491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001097634,"about_ca_system_score_gemma":0.002257131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003244353,"about_ca_topic_score_gemma":0.004802682,"domain_scores_codex":[0.9922733,0.001973739,0.0007641401,0.001000283,0.003350933,0.0006375688],"domain_scores_gemma":[0.9802631,0.0054717,0.001052995,0.005817869,0.007041599,0.0003527752],"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.0003978422,0.0003698666,0.005846711,0.0009076694,0.0001230379,0.001470486,0.001026789,0.03225845,0.02640589,0.1178259,0.02926075,0.7841065],"study_design_scores_gemma":[0.000215366,0.000848339,0.003111482,0.0005738615,0.000245737,0.006930971,0.0008925635,0.4307925,0.05686322,0.1629658,0.3360982,0.0004618567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0144801,0.001486241,0.9671178,0.00126008,0.0007309937,0.0003470242,0.0006266931,0.003420844,0.0105301],"genre_scores_gemma":[0.05053857,0.0009314795,0.9401253,0.0009236985,0.0002598728,0.000113815,0.001196594,0.001015941,0.004894835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007057831,"threshold_uncertainty_score":0.02467299,"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."}}