{"id":"W2239313659","doi":"10.11575/prism/17658","title":"The 2DR-tree: a 2-dimensional spatial access method","year":2004,"lang":"en","type":"dissertation","venue":"PRISM (University of Calgary)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Node (physics); Algorithm; Computer science; Mathematics; Bounding overwatch; Tree (set theory); Partition (number theory); Time complexity; Binary number; Theoretical computer science; Combinatorics; Artificial intelligence","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.000306316,0.0001893686,0.0002411494,0.0001792014,0.0004377597,0.0001631676,0.003075948,0.0001423452,0.00005096069],"category_scores_gemma":[0.000018068,0.0001807343,0.0001634894,0.0002680048,0.00005800218,0.0008240654,0.0007660618,0.0002700716,0.00004423801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005804448,"about_ca_system_score_gemma":0.0002196846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002627128,"about_ca_topic_score_gemma":0.0004899529,"domain_scores_codex":[0.998536,0.00007870394,0.0001441284,0.000443645,0.0005581231,0.0002394007],"domain_scores_gemma":[0.9988143,0.0001022908,0.0002963018,0.0006031458,0.0001059165,0.00007805099],"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.00003954965,0.00004819434,0.000008131697,0.00004490074,0.00009507641,0.00006218023,0.0003898006,0.000002765252,0.00002082699,0.01492534,0.005724679,0.9786385],"study_design_scores_gemma":[0.003728258,0.0003077942,0.05744597,0.0004777782,0.0005323285,0.00001094239,0.0002917626,0.5793586,0.0009897255,0.05297536,0.3020508,0.00183061],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006288722,0.0002355994,0.9775841,0.0006834112,0.0008529025,0.0002554591,0.00000111337,0.00008086491,0.01967769],"genre_scores_gemma":[0.001198275,0.0005042458,0.9008092,0.0001713952,0.0001019274,0.000002364973,0.001006489,0.00003842323,0.09616763],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.976808,"threshold_uncertainty_score":0.737013,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01211885645645039,"score_gpt":0.2474575217851173,"score_spread":0.2353386653286669,"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."}}