{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00236935,0.0001681062,0.000179003,0.0001606685,0.0005838955,0.0006244772,0.001608865,0.0000597811,0.00001023578],"category_scores_gemma":[0.00007121933,0.000129063,0.00004586515,0.0006557016,0.001753954,0.0008723389,0.001165959,0.0001440136,0.000009061354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003169372,"about_ca_system_score_gemma":0.00008935645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002326927,"about_ca_topic_score_gemma":4.376581e-7,"domain_scores_codex":[0.9978408,0.00002695037,0.0002343788,0.000724851,0.0004973995,0.0006756825],"domain_scores_gemma":[0.9984781,0.0004121867,0.00005126259,0.0005735732,0.0001736721,0.0003112525],"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.00003039319,0.00004143381,0.00004537272,0.000005205252,0.000002464937,0.000008041648,0.0001698899,0.00003894886,0.000595662,0.9013503,0.0001453977,0.09756687],"study_design_scores_gemma":[0.0006059979,0.0006197638,0.001962294,0.00002954593,0.000004913131,0.00008241127,0.000004050008,0.9104412,0.00635826,0.07727003,0.002283003,0.0003385531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05595393,0.00005376359,0.9422053,0.0003415271,0.00062637,0.0001858987,0.000002560322,0.0001364455,0.000494269],"genre_scores_gemma":[0.5822266,0.000002640876,0.4173099,0.0003129503,0.0001321687,0.000003020226,6.855835e-7,0.000004549452,0.000007488164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9104022,"threshold_uncertainty_score":0.6462516,"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."}}