{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017735,0.0009036745,0.001738868,0.001529017,0.0008619669,0.002653154,0.003486431,0.001225526,0.005661551],"category_scores_gemma":[0.0112023,0.0006761334,0.0007047387,0.00427645,0.002470225,0.01352037,0.005782412,0.002140424,0.001890817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009579449,"about_ca_system_score_gemma":0.0008059089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001370321,"about_ca_topic_score_gemma":0.001264935,"domain_scores_codex":[0.9973848,0.0006646058,0.00015871,0.0005995284,0.0008176701,0.0003745718],"domain_scores_gemma":[0.993679,0.002428922,0.0006369082,0.00268287,0.0003479909,0.0002242775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001215478,0.000332112,0.003659619,0.0006129055,0.0001092129,0.0004570479,0.0009127282,0.1120096,0.0179834,0.4845689,0.02220003,0.3559391],"study_design_scores_gemma":[0.0001180977,0.0005154902,0.0008442489,0.0001223181,0.00006581232,0.001135324,0.000414044,0.632917,0.01455331,0.3232883,0.0259161,0.000110032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1257092,0.005771958,0.8400382,0.00339275,0.0003742262,0.0001581201,0.0007538279,0.002747645,0.02105406],"genre_scores_gemma":[0.6342789,0.003209371,0.350033,0.0009677081,0.0005857256,0.00028982,0.0008355916,0.000443729,0.009356193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005661551,"threshold_uncertainty_score":0.01893973,"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."}}