{"id":"W2904368314","doi":"10.1016/j.tcs.2018.10.019","title":"A simple linear-space data structure for constant-time range minimum query","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Data structure; Range (aeronautics); Simple (philosophy); Range query (database); Set (abstract data type); Mathematics; Linear space; Query optimization; Space (punctuation); Constant (computer programming); Computer science; Discrete mathematics; Algorithm; Sargable; Data mining; Web search query; Search engine; Information retrieval","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001312972,0.0002593142,0.0003023956,0.0001348073,0.0008270483,0.0005762982,0.007078367,0.00009092203,0.000124933],"category_scores_gemma":[0.0002276504,0.0001959772,0.0000518023,0.0008826267,0.003853569,0.001556084,0.005326063,0.0001774323,0.0001054011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000360187,"about_ca_system_score_gemma":0.0002751433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006269249,"about_ca_topic_score_gemma":0.00000183853,"domain_scores_codex":[0.9966871,0.00009217878,0.0003159468,0.00139522,0.0007167737,0.0007928043],"domain_scores_gemma":[0.995671,0.0004994603,0.0001072123,0.002958428,0.000402031,0.0003618054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004030757,0.00005408913,0.00002202902,0.00001155699,0.000007504979,0.000008887338,0.0003122026,0.00001286955,0.003379624,0.9500072,0.006505136,0.03963859],"study_design_scores_gemma":[0.0004107508,0.0003073171,0.00006481345,0.00002704727,0.000006680333,0.0000355749,0.000004336538,0.8898076,0.002751424,0.09961257,0.006674087,0.0002977753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006575392,0.00003601684,0.9901248,0.0009763003,0.0008494473,0.0003682075,0.0002312976,0.0002375419,0.0006009716],"genre_scores_gemma":[0.4953857,0.000002091491,0.5031533,0.0007073692,0.0006867382,0.000003893048,0.00003121889,0.00001127374,0.00001840141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8897948,"threshold_uncertainty_score":0.9988574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01974509309859996,"score_gpt":0.2915802183371953,"score_spread":0.2718351252385953,"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."}}