{"id":"W2736699952","doi":"10.1145/3087801.3087837","title":"Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Constant (computer programming); Deadlock; Binary logarithm; Amortized analysis; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Combinatorics; Algorithm; Discrete mathematics; Data structure; Distributed computing","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002212379,0.0005727458,0.001510628,0.00007273147,0.0008115844,0.001224777,0.003368418,0.0002629288,0.00005613252],"category_scores_gemma":[0.0001076901,0.0002899857,0.0003480584,0.0001078471,0.0006811834,0.0002313376,0.001904247,0.0008278173,0.00006914521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009230743,"about_ca_system_score_gemma":0.000579102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007935221,"about_ca_topic_score_gemma":0.0001711462,"domain_scores_codex":[0.9962492,0.0004066049,0.0007436185,0.001100683,0.0009648894,0.0005349978],"domain_scores_gemma":[0.9947542,0.0003867871,0.0009463061,0.003373172,0.0003674936,0.0001720187],"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.01014193,0.0005243758,0.00001186825,0.00009748118,0.0002601515,0.00004627733,0.0006688199,0.009675349,0.00002177433,0.9637831,0.01366797,0.001100873],"study_design_scores_gemma":[0.07874423,0.00002978027,0.000009691089,0.0004330766,0.00003281882,0.0000107793,0.00002718178,0.8883817,0.00008183566,0.03095202,0.0008524848,0.0004444144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00844896,0.0001408759,0.8783923,0.002951109,0.0005680123,0.002143852,0.0001524535,0.0003227168,0.1068798],"genre_scores_gemma":[0.9751846,0.00006617353,0.0196011,0.0006558442,0.00009462179,0.0003448975,0.0000556639,0.00002597989,0.003971132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9667356,"threshold_uncertainty_score":0.9999552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06984348159744433,"score_gpt":0.2909975523089776,"score_spread":0.2211540707115333,"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."}}