{"id":"W3046463707","doi":"10.1145/3382734.3405736","title":"Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Computer science; Process (computing); Crash; Constant (computer programming); Protocol (science); Shared memory; Theoretical computer science; Distributed computing; Parallel computing; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.0001322781,0.0001797937,0.0003577067,0.00001854877,0.0001741854,0.0002502901,0.0005446121,0.00004956253,0.0002116692],"category_scores_gemma":[0.00003376529,0.0001302632,0.00005426371,0.0002973983,0.0001102858,0.0004698481,0.0002344795,0.0001394073,0.00007535923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004732659,"about_ca_system_score_gemma":0.0001455966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002386716,"about_ca_topic_score_gemma":0.00008213426,"domain_scores_codex":[0.9983566,0.00008444867,0.0002974918,0.0005433625,0.0004399931,0.0002781411],"domain_scores_gemma":[0.9990626,0.00008325827,0.0001257834,0.0003718307,0.0001370964,0.000219431],"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.002903156,0.0004670104,0.01365747,0.0001667688,0.000455317,0.0007346604,0.01222465,0.0007221895,0.01777404,0.8254665,0.07928424,0.04614402],"study_design_scores_gemma":[0.02126135,0.004145308,0.01811335,0.0008349013,0.00007935888,0.00008105687,0.003006104,0.5145342,0.03141999,0.03260245,0.3703821,0.003539775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0478479,0.00009847729,0.9141992,0.00298778,0.000146055,0.0002764039,0.0002716749,0.000342257,0.03383027],"genre_scores_gemma":[0.9391321,0.00001145973,0.05926683,0.001288701,0.00006807795,0.000008506599,0.00003575392,0.00000888118,0.0001796741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8912842,"threshold_uncertainty_score":0.5311979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03569281660777281,"score_gpt":0.2341445985202507,"score_spread":0.1984517819124779,"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."}}