{"id":"W2180616177","doi":"10.1016/j.jda.2011.12.017","title":"Skip lift: A probabilistic alternative to red–black trees","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lift (data mining); Pointer (user interface); Computer science; Data structure; Combinatorics; Probabilistic logic; Algorithm; Mathematics; Discrete mathematics; Data mining; 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.0005643899,0.0002445049,0.0004005267,0.0002680714,0.0001037379,0.0001644534,0.001901064,0.00006987717,0.00006723469],"category_scores_gemma":[0.0001629575,0.0001738228,0.0001956521,0.0004456207,0.0001099494,0.001276772,0.0005587105,0.0003174356,0.00006653698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007704072,"about_ca_system_score_gemma":0.0001204113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009357937,"about_ca_topic_score_gemma":0.00001085241,"domain_scores_codex":[0.9977539,0.000115929,0.000687337,0.0003648295,0.0006925894,0.0003854664],"domain_scores_gemma":[0.99797,0.00008637641,0.0005108454,0.0006293756,0.0003679036,0.0004354514],"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.0007640028,0.002287694,0.001579656,0.0001410452,0.001003686,0.003373124,0.05082411,0.003435511,0.002543634,0.07192706,0.08299784,0.7791227],"study_design_scores_gemma":[0.007659576,0.01394971,0.05977282,0.002216716,0.0003382583,0.002235205,0.002023039,0.580593,0.02048223,0.2246345,0.08247928,0.003615655],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007820657,0.00023829,0.9858832,0.001211191,0.00117195,0.0002608766,0.00002534742,0.00005376555,0.003334715],"genre_scores_gemma":[0.2873559,0.0001171795,0.7105303,0.0004708251,0.001003098,0.000011316,0.000003695784,0.00003620129,0.0004714805],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.775507,"threshold_uncertainty_score":0.7088286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03582305399091825,"score_gpt":0.2703334173377777,"score_spread":0.2345103633468594,"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."}}