{"id":"W4398864","doi":"10.1016/0006-2952(71)90175-4","title":"Searching through spatial relationships using the 2DR-tree.","year":2006,"lang":"en","type":"article","venue":"IMSA","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Optimal binary search tree; Tree (set theory); Computer science; Binary search tree; Ternary search tree; Binary tree; Data mining; Random binary tree; Spatial analysis; Curse of dimensionality; Binary data; Tree traversal; Space partitioning; Binary number; Artificial intelligence; Interval tree; Mathematics; Tree structure; Algorithm; Statistics","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.0003115838,0.00006355426,0.00004880621,0.00003110819,0.0003762646,0.0003407124,0.0006479358,0.00001722881,0.00000823977],"category_scores_gemma":[0.00001979207,0.00004550968,0.0000293229,0.0002372793,0.00003450469,0.0008461113,0.0003261862,0.0001403042,0.00006159643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001769242,"about_ca_system_score_gemma":0.0000160696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001222086,"about_ca_topic_score_gemma":0.0001711588,"domain_scores_codex":[0.999244,0.0000793545,0.0001083642,0.0001772546,0.0002120926,0.0001789562],"domain_scores_gemma":[0.9994296,0.00008573054,0.00004149268,0.0004123471,0.00001672887,0.00001413639],"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.000002275201,0.00006454909,0.005715459,0.000009817827,0.0000206458,0.0000381571,0.0009272891,0.004098702,0.0004233861,0.852959,0.008128027,0.1276127],"study_design_scores_gemma":[0.0003090331,0.00001934041,0.0320772,0.00002339936,0.00001459917,0.00001249194,0.00009653471,0.7857574,0.0005945191,0.1072113,0.07362889,0.000255317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01443646,0.00005140164,0.9669546,0.001620979,0.0002867736,0.00009563622,0.00000180751,0.00009275012,0.01645958],"genre_scores_gemma":[0.9027513,0.000002717819,0.09580787,0.0001669557,0.0003838888,0.000003107007,0.00001044088,0.000006388691,0.000867298],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8883148,"threshold_uncertainty_score":0.3285498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.064313225270257,"score_gpt":0.2842151916977682,"score_spread":0.2199019664275111,"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."}}