{"id":"W3133750907","doi":"10.4230/lipics.socg.2017.28","title":"Dynamic Orthogonal Range Searching on the RAM, Revisited","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Combinatorics; Binary logarithm; Log-log plot; Range (aeronautics); Data structure; Mathematics; Upper and lower bounds; Computational geometry; Amortized analysis; Constant (computer programming); Word (group theory); Algorithm; Computer science; Geometry; Mathematical analysis","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001189245,0.0003471083,0.0003452037,0.0001511983,0.002187333,0.002091524,0.003943301,0.0001381935,0.00003606532],"category_scores_gemma":[0.0002765147,0.0002244629,0.0002367613,0.0001309249,0.0001648389,0.002581591,0.001634917,0.0006176608,0.000270476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007992251,"about_ca_system_score_gemma":0.00006967917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001617994,"about_ca_topic_score_gemma":0.000008370008,"domain_scores_codex":[0.9974833,0.00006699484,0.0006766117,0.00033853,0.0007307982,0.0007037583],"domain_scores_gemma":[0.9961102,0.0002933359,0.0005691727,0.002641792,0.0001927947,0.0001927157],"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.0005301142,0.001006417,0.01093917,0.001093681,0.0005660906,0.00008271827,0.01583555,0.0004684076,0.0002373968,0.4170324,0.05665755,0.4955505],"study_design_scores_gemma":[0.002346678,0.0002493384,0.01136396,0.0005028741,0.00002077968,0.00005540566,0.0002089142,0.8714051,0.0001317594,0.003273168,0.1098314,0.0006105274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1784377,0.00008858805,0.7963411,0.005476384,0.001896745,0.002279552,0.001027428,0.0004146246,0.01403792],"genre_scores_gemma":[0.9505057,0.00008918678,0.04485586,0.003112164,0.0002331123,0.0001308463,0.0003898039,0.0000521354,0.0006311946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8709368,"threshold_uncertainty_score":0.9991117,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02503697079969792,"score_gpt":0.2930977348193112,"score_spread":0.2680607640196133,"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."}}