{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006952221,0.000687903,0.000644541,0.000881635,0.0002484286,0.0006110881,0.006040474,0.0002852985,0.00005908801],"category_scores_gemma":[0.0001703223,0.0005723429,0.0001429583,0.0006942883,0.0009082168,0.0008525088,0.003949096,0.0007719024,0.0002420114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003031483,"about_ca_system_score_gemma":0.0004630292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001287936,"about_ca_topic_score_gemma":0.0001823481,"domain_scores_codex":[0.995043,0.00004805719,0.000604138,0.002311818,0.001169863,0.0008231467],"domain_scores_gemma":[0.9962698,0.0003527926,0.0003119505,0.002326411,0.0003341824,0.0004049237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001956777,0.00008574064,0.00002069703,0.00004201369,0.00001893562,0.0002164088,0.003224924,0.025288,0.00006336551,0.07670321,0.000461523,0.8938556],"study_design_scores_gemma":[0.0003046321,0.000538042,0.0002460814,0.0008930162,0.00001089353,0.00005887546,2.117623e-7,0.4647578,0.0008143085,0.5209351,0.01030318,0.00113788],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004381551,0.0001708819,0.9886375,0.0009101002,0.001905982,0.0007028535,0.00001968818,0.0001997463,0.007409434],"genre_scores_gemma":[0.06541944,0.00007256127,0.9285024,0.002846143,0.001342567,0.00004263896,0.00001633244,0.00008342882,0.001674518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8927177,"threshold_uncertainty_score":0.9996728,"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."}}