{"id":"W1974033543","doi":"10.1145/1290672.1290680","title":"Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":378,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Encoding (memory); Trie; Computer science; Prefix code; Theoretical computer science; Tree (set theory); Combinatorics; Mathematics; Data structure; Algorithm; Decoding methods; Artificial intelligence; Programming language","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":[],"consensus_categories":[],"category_scores_codex":[0.0002934815,0.0002500488,0.0002028549,0.0002942,0.0007601408,0.0002026925,0.000736518,0.00009881325,0.00002200085],"category_scores_gemma":[0.00001350855,0.0002089819,0.00004492034,0.0007761644,0.00007860581,0.0008448109,0.00006394739,0.0002854784,0.00003766082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007350184,"about_ca_system_score_gemma":0.00007264358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002441733,"about_ca_topic_score_gemma":0.0002411228,"domain_scores_codex":[0.9981673,0.0000291885,0.0002834296,0.0006858741,0.000410869,0.0004233779],"domain_scores_gemma":[0.9981143,0.0002724414,0.00006960762,0.001055865,0.000100613,0.0003871014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006698267,0.0003366775,0.0003384356,0.00001479561,0.00005210418,0.00001898752,0.0006571586,0.001830945,0.0008252467,0.001440907,0.0002761323,0.9941416],"study_design_scores_gemma":[0.0102209,0.004235323,0.1271848,0.0007662281,0.0003071533,0.00136146,0.001655443,0.1672382,0.05943922,0.009770387,0.6127023,0.005118605],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001609334,0.0001354578,0.9958677,0.0008610297,0.0001981171,0.0005260885,0.000063876,0.0003250101,0.0004133626],"genre_scores_gemma":[0.3288807,0.0001079788,0.6693892,0.0006814072,0.0001196107,0.0002365651,0.00002372218,0.00003245772,0.0005283624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.989023,"threshold_uncertainty_score":0.8522035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0167703244268879,"score_gpt":0.2608292871613097,"score_spread":0.2440589627344218,"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."}}