{"id":"W1977261082","doi":"10.1007/s00453-014-9947-8","title":"Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Combinatorics; Data structure; Path (computing); Multiset; Binary logarithm; Rank (graph theory); Tree (set theory); Linear space; Element (criminal law); Mathematics; Order (exchange); Space (punctuation); Range (aeronautics); Time complexity; Discrete mathematics; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0002636933,0.0001991694,0.0002230247,0.00006547219,0.0002483789,0.0001786868,0.001366387,0.00008276122,0.000008427835],"category_scores_gemma":[0.0001542079,0.0001550738,0.00003285221,0.0001178622,0.00008415651,0.0006939604,0.000611172,0.000128058,0.000009840715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001113081,"about_ca_system_score_gemma":0.00003201177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009233281,"about_ca_topic_score_gemma":0.00002946962,"domain_scores_codex":[0.9985499,0.0000565526,0.0001827716,0.0006910337,0.0002284938,0.0002912481],"domain_scores_gemma":[0.9979087,0.0003008703,0.00008802805,0.001523942,0.00005845828,0.0001200652],"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.00003220613,0.00007253145,0.0002225901,0.00004343861,0.00004148911,0.000006541776,0.0003980475,0.00003634884,0.0009103566,0.2335256,0.01854945,0.7461613],"study_design_scores_gemma":[0.001433509,0.0006131103,0.004856109,0.0000696932,0.00002588996,0.00002935051,0.00004079354,0.728922,0.002996155,0.08864537,0.17171,0.000658064],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001769569,0.0002727616,0.9946893,0.001758614,0.0004929065,0.000233742,0.0002078572,0.000157992,0.0004171949],"genre_scores_gemma":[0.06822116,0.00006894538,0.9300114,0.0005536076,0.0007620872,0.00002773096,0.0001830231,0.00002473815,0.0001473399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7455033,"threshold_uncertainty_score":0.6323726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02915508463569145,"score_gpt":0.2760695025497986,"score_spread":0.2469144179141072,"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."}}