{"id":"W2963227782","doi":"10.4230/lipics.esa.2018.25","title":"Improved Time and Space Bounds for Dynamic Range Mode","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Data structure; Linear space; Element (criminal law); Range query (database); Range (aeronautics); Computer science; Space (punctuation); Monte Carlo method; Algorithm; Binary logarithm; Theoretical computer science; Combinatorics; Mathematics; Information retrieval; Search engine; Web query classification; Statistics; Web search query","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004264902,0.0003568972,0.0003932176,0.000179205,0.0005756051,0.0006965042,0.001089711,0.0001916029,0.00001473218],"category_scores_gemma":[0.00006408431,0.0003019993,0.0001478008,0.0001974247,0.0001841508,0.002404297,0.0007692547,0.000187203,0.0000797181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008195536,"about_ca_system_score_gemma":0.0000740556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002737836,"about_ca_topic_score_gemma":0.00002482154,"domain_scores_codex":[0.9979481,0.00001915644,0.0006426795,0.0003783872,0.0002893865,0.0007222659],"domain_scores_gemma":[0.9980727,0.000132377,0.0003100687,0.0009314406,0.0003200156,0.000233392],"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.00243191,0.00223918,0.002124388,0.004098359,0.001328405,0.00001793106,0.07829666,0.0001801036,0.01318594,0.07100361,0.1401862,0.6849073],"study_design_scores_gemma":[0.002557492,0.0004979244,0.0001496834,0.00007422874,0.00002087171,0.00003152976,0.0000962943,0.9328141,0.000586033,0.001544185,0.06122017,0.0004075343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03835577,0.00006832401,0.9566785,0.0004351322,0.0008323792,0.001333107,0.001042185,0.0002581746,0.0009964128],"genre_scores_gemma":[0.3561229,0.00007141148,0.637121,0.001932328,0.0005891021,0.0003465561,0.001107782,0.0001067283,0.002602208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9326339,"threshold_uncertainty_score":0.9999432,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007625279048213117,"score_gpt":0.2566653452395519,"score_spread":0.2490400661913388,"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."}}