{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001475623,0.00003865223,0.00002600405,0.0000133085,0.00009331112,0.0001724843,0.001062862,0.00000697468,0.00003645847],"category_scores_gemma":[0.00001470912,0.00001450473,0.00001783362,0.0000840394,0.0000232274,0.0004893268,0.0004117545,0.00001287016,0.0009249968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005617975,"about_ca_system_score_gemma":0.000005051978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007366425,"about_ca_topic_score_gemma":0.0000235694,"domain_scores_codex":[0.9995558,0.00001018486,0.00005577581,0.0001295545,0.0001120721,0.000136591],"domain_scores_gemma":[0.9993602,0.00008263742,0.00001358177,0.0005074686,0.00001146269,0.00002467194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[1.589452e-7,0.000002579217,0.00005589368,1.420175e-7,0.000002352895,9.082731e-7,0.000003661027,1.035068e-8,0.00002619964,0.3565249,0.06206328,0.5813199],"study_design_scores_gemma":[0.0001156813,0.00001243717,0.001648572,0.00000264464,7.969299e-7,7.809246e-7,0.000003441073,0.001438094,0.0004423452,0.01418142,0.9820942,0.00005954497],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00008750775,0.00002388913,0.7889045,0.02735247,0.0003721074,0.00004369784,4.078549e-7,0.000125524,0.1830899],"genre_scores_gemma":[0.1409582,0.0002533664,0.06568334,0.003063862,0.0003694162,0.00002553684,0.00000136723,0.0000118729,0.789633],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.920031,"threshold_uncertainty_score":0.9998529,"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."}}