{"id":"W1986633843","doi":"10.1006/jcss.2002.1822","title":"Optimal Bounds for the Predecessor Problem and Related Problems","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matching (statistics); Set (abstract data type); Computer science; Element (criminal law); Class (philosophy); Dynamic problem; Multiplication (music); Upper and lower bounds; Mathematics; Algorithm; Mathematical optimization; Combinatorics","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.01388675,0.004301832,0.005248293,0.006822004,0.003293706,0.01167747,0.009582475,0.005806073,0.02723122],"category_scores_gemma":[0.09448473,0.002694789,0.002723225,0.008747675,0.005521022,0.02683913,0.008437512,0.01354675,0.004042646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00642968,"about_ca_system_score_gemma":0.005634132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00272913,"about_ca_topic_score_gemma":0.004108267,"domain_scores_codex":[0.9897192,0.003596846,0.0004904506,0.001540284,0.002837656,0.001815678],"domain_scores_gemma":[0.880115,0.1039227,0.002937282,0.00586886,0.00457511,0.002580948],"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.001534568,0.0008729274,0.001264379,0.001716371,0.0001844043,0.0001836769,0.0005932372,0.1739486,0.00219366,0.5973677,0.05540515,0.1647352],"study_design_scores_gemma":[0.0001510327,0.000162539,0.0004079956,0.0003108114,0.0001235486,0.0002581633,0.0001767245,0.3416273,0.001315364,0.6475728,0.007824153,0.00006957492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03910154,0.026489,0.8336782,0.01485309,0.001743528,0.0003798165,0.00158418,0.001327128,0.08084351],"genre_scores_gemma":[0.3878987,0.02418773,0.5282868,0.004502759,0.006756912,0.001541377,0.004102891,0.002489423,0.04023356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02723122,"threshold_uncertainty_score":0.09109747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02422048326305505,"score_gpt":0.2379167837357343,"score_spread":0.2136963004726792,"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."}}