{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004988341,0.0003836089,0.000533102,0.0001037489,0.0001781715,0.001025523,0.006575328,0.0002561898,0.000005511534],"category_scores_gemma":[0.0008967198,0.000273457,0.0003051837,0.0004017738,0.0001260856,0.0002004085,0.007242068,0.0009852384,0.000002664584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008828191,"about_ca_system_score_gemma":0.0001147459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001279596,"about_ca_topic_score_gemma":0.000002959096,"domain_scores_codex":[0.9972895,0.00003077564,0.0004764681,0.0008386192,0.0008690258,0.000495567],"domain_scores_gemma":[0.9974246,0.00008712315,0.0005019073,0.001346257,0.0005384853,0.0001016355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003976741,0.0006198133,0.007832097,0.007531489,0.000575582,0.00003176866,0.02509232,0.0008094481,0.0155348,0.07122286,0.003177,0.867533],"study_design_scores_gemma":[0.004765825,0.0009921455,0.04768525,0.02501114,0.000475972,0.0002881837,0.02776556,0.02634688,0.81653,0.01056314,0.03349094,0.006084953],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9842556,0.004987186,0.00307712,0.002151273,0.00242872,0.001470627,0.00005123556,0.0004812061,0.001096993],"genre_scores_gemma":[0.9588973,0.0000371558,0.04055656,0.00008400819,0.0001911705,0.00008576667,0.00001171112,0.00002721046,0.0001091415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8614481,"threshold_uncertainty_score":0.9999717,"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."}}