{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384733,0.0001044948,0.0002058251,0.0000950003,0.000589972,0.0008894406,0.0008087544,0.00003724661,0.000001811849],"category_scores_gemma":[0.00000667225,0.00005279009,0.00005367041,0.0002348557,0.0001664884,0.001005543,0.0002246073,0.00009802489,8.060415e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001132638,"about_ca_system_score_gemma":0.0000283137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003836641,"about_ca_topic_score_gemma":3.809919e-7,"domain_scores_codex":[0.9987456,0.00006277658,0.0004269774,0.000217311,0.0003555976,0.0001917502],"domain_scores_gemma":[0.9990142,0.0002662175,0.0003459383,0.0001509266,0.0001300842,0.00009265587],"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.00003188392,0.0003115401,0.00241172,0.0008569917,0.0003155924,0.00006556592,0.01760254,0.03450052,0.000293217,0.1690557,0.03927964,0.7352751],"study_design_scores_gemma":[0.0004179859,0.0005637092,0.0005754994,0.0002185315,0.0000120347,0.001242165,0.0001142004,0.9912538,0.000009933506,0.0007830718,0.004718457,0.00009060106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01302014,0.006389637,0.9769832,0.001745619,0.0009346958,0.0002966806,0.000002201964,0.00002989883,0.0005979491],"genre_scores_gemma":[0.7948976,0.0002147503,0.2044459,0.00005845481,0.0002392778,0.00000712162,1.259594e-7,0.00000438416,0.0001324516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9567533,"threshold_uncertainty_score":0.8576897,"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."}}