{"id":"W121085945","doi":"","title":"The PKD-tree for Orthogonal d-Dimensional Range Search.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Range tree; Tree (set theory); Combinatorics; R-tree; Search engine indexing; K-ary tree; Mathematics; Pyramid (geometry); Tree structure; Interval tree; Computer science; Algorithm; Binary tree; Spatial database; Artificial intelligence; Statistics; Spatial analysis; Geometry","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.001774825,0.0007626259,0.001299936,0.002939865,0.001114575,0.002301913,0.002681743,0.001367276,0.006777537],"category_scores_gemma":[0.01358701,0.0006551217,0.0009679304,0.006782678,0.001214717,0.005880855,0.004361108,0.001739069,0.005433338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001029685,"about_ca_system_score_gemma":0.002157552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002524889,"about_ca_topic_score_gemma":0.00298862,"domain_scores_codex":[0.9980902,0.000453743,0.0002872552,0.0003158,0.0006977686,0.000155178],"domain_scores_gemma":[0.9947928,0.001575019,0.0004191426,0.002090147,0.0008782434,0.000244668],"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.0007579374,0.0002308055,0.004293916,0.001233404,0.0001526524,0.0003381052,0.0005363156,0.03833725,0.01188235,0.1036239,0.08084053,0.7577728],"study_design_scores_gemma":[0.0003843339,0.0005490672,0.002010433,0.0003613452,0.0001446703,0.0025918,0.0004568803,0.5574421,0.02018013,0.2176916,0.1979661,0.0002214696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00753032,0.002455297,0.9757621,0.0005630026,0.0002351231,0.0002650272,0.002002579,0.00612305,0.005063637],"genre_scores_gemma":[0.06634533,0.0009700425,0.9247296,0.0003889768,0.0001194897,0.0006246482,0.004490212,0.0004706603,0.001861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006777537,"threshold_uncertainty_score":0.02267307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02736035179704939,"score_gpt":0.2467558209258825,"score_spread":0.2193954691288331,"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."}}