{"id":"W1977986119","doi":"10.1016/j.tcs.2007.07.041","title":"Optimal lower bounds for rank and select indexes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Rank (graph theory); Data structure; Upper and lower bounds; Computer science; Word (group theory); Combinatorics; Binary logarithm; Space (punctuation); Index (typography); Order (exchange); Algorithm; Mathematics; Discrete mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01631416,0.006812792,0.007296803,0.01087173,0.003961644,0.01826018,0.009000503,0.006094439,0.02574082],"category_scores_gemma":[0.1021297,0.003071447,0.002546411,0.01382264,0.006767613,0.02295343,0.011351,0.0108116,0.007769041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009002999,"about_ca_system_score_gemma":0.00962744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002294021,"about_ca_topic_score_gemma":0.005243991,"domain_scores_codex":[0.97544,0.006419869,0.001144629,0.002092703,0.01058443,0.004318424],"domain_scores_gemma":[0.8910767,0.0842495,0.003703729,0.0117876,0.00628616,0.002896284],"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.002705854,0.0007409448,0.001755313,0.001510445,0.00025358,0.0001910012,0.0006986848,0.1426874,0.005925396,0.5695769,0.04872957,0.225225],"study_design_scores_gemma":[0.0002419067,0.0003184174,0.0007097223,0.0003201412,0.0002129251,0.0003676135,0.0002995322,0.372339,0.006349754,0.6064754,0.01224538,0.0001201752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03202162,0.01836236,0.8754501,0.009395971,0.001074449,0.0004251556,0.003488718,0.003302239,0.05647928],"genre_scores_gemma":[0.3998834,0.0147456,0.5270165,0.003595388,0.005308063,0.001770717,0.005759505,0.003554504,0.03836636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02574082,"threshold_uncertainty_score":0.08627856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007316668029087797,"score_gpt":0.2601985053427479,"score_spread":0.2528818373136601,"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."}}