{"id":"W2519264255","doi":"10.1145/2938503.2938549","title":"The Hilbert PDC-tree","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; Carleton University","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tree (set theory); Search engine indexing; Overhead (engineering); Hilbert curve; Algorithm; Tree structure; R-tree; Rectangle; Theoretical computer science; Mathematics; Binary tree; Combinatorics; Artificial intelligence; Spatial database; Statistics; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.001346168,0.0004826772,0.000999975,0.002297342,0.001413132,0.002380884,0.002218252,0.0009075989,0.003943368],"category_scores_gemma":[0.008108306,0.0005389179,0.0007101524,0.0056085,0.0009887943,0.004836873,0.003563405,0.001131498,0.002586087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001437974,"about_ca_system_score_gemma":0.004164349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006352782,"about_ca_topic_score_gemma":0.005636024,"domain_scores_codex":[0.9982297,0.00019835,0.0001742396,0.0003294935,0.0008709058,0.0001973197],"domain_scores_gemma":[0.9943409,0.0009588406,0.0003458929,0.002031788,0.001967035,0.0003555282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005288578,0.000202475,0.006092817,0.0005663512,0.0001064617,0.0003552572,0.0004715279,0.04669949,0.01326723,0.10397,0.1004895,0.72725],"study_design_scores_gemma":[0.0001671906,0.0004113075,0.002195061,0.0001114861,0.0001099408,0.001945769,0.0003372937,0.6084424,0.02016499,0.1492164,0.2167433,0.0001548015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02051468,0.00168255,0.9536827,0.0009355764,0.0002063887,0.0004776302,0.00360065,0.007266562,0.01163337],"genre_scores_gemma":[0.1359977,0.001292957,0.8440573,0.0006418863,0.0001791107,0.0005409381,0.008239594,0.0007211287,0.008329527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006352782,"threshold_uncertainty_score":0.01319182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01042858524661519,"score_gpt":0.2118368576341723,"score_spread":0.2014082723875571,"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."}}