{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004385663,0.0001682869,0.0001265605,0.0003729528,0.0006871489,0.0006181711,0.001049197,0.00005003632,0.00005942173],"category_scores_gemma":[0.00004248858,0.0001393387,0.00008273193,0.0005596445,0.0001101621,0.0003078163,0.0001105529,0.0001421503,0.0001991682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001149888,"about_ca_system_score_gemma":0.0008112559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003295674,"about_ca_topic_score_gemma":0.01573566,"domain_scores_codex":[0.9982376,0.00004518594,0.0002315154,0.000433019,0.0005215019,0.0005312347],"domain_scores_gemma":[0.9985982,0.0004201163,0.00005968299,0.0003393907,0.0003334495,0.0002492193],"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.000006472612,0.00002033133,0.00022352,0.000004936755,0.00001911453,0.00001138128,0.000008369082,0.006371325,0.000002713219,0.8959618,0.0260303,0.07133976],"study_design_scores_gemma":[0.0007116434,0.0001028065,0.03484404,0.00002141484,0.000007317542,0.000006669495,0.00002022014,0.7644218,0.00001574581,0.1202195,0.07926868,0.000360171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01635873,0.000199733,0.9196595,0.03602953,0.001546883,0.0009647839,0.0006061125,0.0001850054,0.02444977],"genre_scores_gemma":[0.971853,0.000003383282,0.02195835,0.001855912,0.0003731973,0.00005334712,0.0004540206,0.00001571855,0.00343312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9554942,"threshold_uncertainty_score":0.8780866,"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."}}