{"id":"W3201295163","doi":"10.1145/3485490","title":"Verifying concurrent multicopy search structures","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"York University; New York University Abu Dhabi; National Science Foundation","keywords":"Computer science; Data structure; Merge (version control); Concurrent data structure; Parallel computing; Theoretical computer science; Reuse; Key (lock); Algorithm; Programming language; Operating system","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004529309,0.0007066025,0.0007072755,0.0007796045,0.001002859,0.003149551,0.003464084,0.001593383,0.0028904],"category_scores_gemma":[0.02614882,0.0009952015,0.001668754,0.0007781561,0.003228738,0.006268744,0.004055489,0.002261594,0.0006559605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002314995,"about_ca_system_score_gemma":0.004732655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003485797,"about_ca_topic_score_gemma":0.003187431,"domain_scores_codex":[0.9924299,0.001551529,0.0007144581,0.001536461,0.002844486,0.000923196],"domain_scores_gemma":[0.9766283,0.01080289,0.002007089,0.007315458,0.002873621,0.0003725755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001010232,0.0003918803,0.009945782,0.0008586655,0.0002143004,0.0008841248,0.002015511,0.130347,0.08030181,0.5751089,0.00371253,0.1952092],"study_design_scores_gemma":[0.000196784,0.000359012,0.0006441462,0.00008262955,0.0001551433,0.000542473,0.0003344386,0.4590308,0.2575693,0.2727689,0.008229988,0.00008622789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09319548,0.0000707874,0.8966444,0.0003443422,0.00004297766,0.000195584,0.0002530058,0.006090515,0.003162829],"genre_scores_gemma":[0.6974213,0.00007648972,0.2984687,0.0002182396,0.00003750429,0.0001950834,0.0003773666,0.0005861109,0.002619215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004529309,"threshold_uncertainty_score":0.02395356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02956591209122217,"score_gpt":0.3095414499742906,"score_spread":0.2799755378830684,"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."}}