{"id":"W3177419060","doi":"10.1145/3409964.3461819","title":"A Scalable Recoverable Skip List for Persistent Memory","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrent data structure; Scalability; Parallel computing; Lock (firearm); Data structure; Blocking (statistics); Linked list; Benchmark (surveying); Concurrency; Node (physics); Persistent data structure; B-tree; Algorithm; Distributed computing; Database; Operating system; Computer network","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.0001239744,0.00009704599,0.0001342788,0.00004682918,0.0001235483,0.0001427197,0.00073387,0.0000570442,0.00009255055],"category_scores_gemma":[0.0002857413,0.00009015081,0.00009948567,0.0003185934,0.00003706579,0.0006937219,0.0005597543,0.00007828254,0.00006883114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008319132,"about_ca_system_score_gemma":0.00008860906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001542113,"about_ca_topic_score_gemma":0.00003006627,"domain_scores_codex":[0.999006,0.00001273943,0.0001310113,0.000438245,0.0001301214,0.0002819159],"domain_scores_gemma":[0.9987217,0.0001103263,0.00003821701,0.0009565807,0.0001286402,0.0000445361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001746054,0.0003044718,0.000105211,0.0001207375,0.0001004958,0.0001460631,0.000297757,0.002090803,0.01106287,0.5012958,0.236109,0.2483493],"study_design_scores_gemma":[0.001152571,0.0002869769,0.00003437783,0.00004665893,0.00002071214,0.0001602099,0.001090304,0.1222854,0.2259614,0.08594925,0.5622935,0.000718531],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007148249,0.0004939958,0.9742215,0.003187849,0.0003347079,0.0001429405,0.00001232081,0.0006787211,0.02021309],"genre_scores_gemma":[0.02158721,0.00004930485,0.9374632,0.0009663528,0.00003270854,0.00004634561,0.00001494274,0.00001020319,0.03982971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4153466,"threshold_uncertainty_score":0.3676243,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02597355170160844,"score_gpt":0.2535948008980298,"score_spread":0.2276212491964214,"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."}}