{"id":"W3183901574","doi":"10.1145/3465084.3467938","title":"Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Canada Research Chairs","keywords":"Mutual exclusion; Swap (finance); Upper and lower bounds; Fetch; Computer science; Synchronization (alternating current); Log-log plot; Algorithm; Binary logarithm; Parallel computing; Combinatorics; Mathematics; Theoretical computer science; Topology (electrical circuits)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005561617,0.002587483,0.003539142,0.002085174,0.002014425,0.004769635,0.005571552,0.003346043,0.01360252],"category_scores_gemma":[0.04337371,0.00103202,0.002565084,0.002313368,0.003368812,0.01379243,0.006767475,0.00831169,0.003672605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005308606,"about_ca_system_score_gemma":0.003642067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002181938,"about_ca_topic_score_gemma":0.002160626,"domain_scores_codex":[0.9864041,0.003197979,0.0006241081,0.002178442,0.004655416,0.002939873],"domain_scores_gemma":[0.9447508,0.04118326,0.002063638,0.008582743,0.002285865,0.001133659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002103088,0.001040825,0.002447049,0.001653105,0.0002603732,0.0005600832,0.0007144119,0.5178699,0.03575514,0.2388719,0.03094026,0.1677839],"study_design_scores_gemma":[0.0001377584,0.0002241105,0.0007086013,0.00008679526,0.00008011809,0.0003808074,0.0001123797,0.8528747,0.008761285,0.1301304,0.006422694,0.00008021617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06955293,0.00584056,0.8749061,0.008052613,0.0004005945,0.0005019014,0.00148255,0.005399477,0.03386331],"genre_scores_gemma":[0.729328,0.002690953,0.2485584,0.001964369,0.0009504508,0.001147852,0.002323065,0.001559544,0.01147728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01360252,"threshold_uncertainty_score":0.04550499,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04479827334313959,"score_gpt":0.2708985467195957,"score_spread":0.2261002733764561,"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."}}