{"id":"W2020287344","doi":"10.1007/978-3-642-19222-7_23","title":"Skip Lift: A Probabilistic Alternative to Red-Black Trees","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lift (data mining); Computer science; Pointer (user interface); Data structure; Probabilistic logic; Algorithm; Combinatorics; Theoretical computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001954829,0.0007305177,0.001299934,0.001203361,0.001475279,0.001928088,0.002457044,0.001514463,0.01315175],"category_scores_gemma":[0.008200516,0.0006142623,0.001108903,0.002015177,0.001396736,0.003892605,0.004586406,0.003092559,0.003397562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006261372,"about_ca_system_score_gemma":0.001510846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001610158,"about_ca_topic_score_gemma":0.002941053,"domain_scores_codex":[0.9984615,0.0003444181,0.00006123002,0.0002560552,0.0006712743,0.0002055551],"domain_scores_gemma":[0.9966289,0.0012567,0.0001387399,0.001295553,0.0004387287,0.0002413209],"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.0007177084,0.0001592022,0.0006642591,0.0001951187,0.00006050631,0.000168617,0.0002516079,0.05893139,0.004246151,0.511036,0.02460975,0.3989596],"study_design_scores_gemma":[0.00005512844,0.00007074123,0.0002245693,0.00004824128,0.00003974245,0.0001423908,0.00003901452,0.3417383,0.002145808,0.6384177,0.01704394,0.00003434067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007160877,0.0002677994,0.982477,0.0003327907,0.0002020217,0.00005373383,0.0002573636,0.001822857,0.007425484],"genre_scores_gemma":[0.2679012,0.0006955604,0.7024745,0.0008083993,0.0006321534,0.0002632898,0.001164124,0.002295325,0.0237655],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01315175,"threshold_uncertainty_score":0.04399705,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02590739915814784,"score_gpt":0.2531766838766929,"score_spread":0.227269284718545,"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."}}