{"id":"W2800605324","doi":"10.4230/lipics.disc.2018.21","title":"An Almost Tight RMR Lower Bound for Abortable Test-And-Set","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Swap (finance); Computer science; Omega; Constant (computer programming); Set (abstract data type); Upper and lower bounds; Cache; Theoretical computer science; Parallel computing; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01032946,0.003853373,0.004494932,0.002344565,0.003298142,0.007346414,0.01034736,0.004274599,0.02726404],"category_scores_gemma":[0.05808804,0.00193792,0.005487635,0.002774556,0.005530101,0.02014525,0.01163254,0.01367962,0.007941881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008082372,"about_ca_system_score_gemma":0.007545148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003065394,"about_ca_topic_score_gemma":0.004219621,"domain_scores_codex":[0.9735724,0.006502231,0.001373995,0.004535258,0.008672027,0.005344115],"domain_scores_gemma":[0.889586,0.06585898,0.0048338,0.03270769,0.004203244,0.002810214],"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.006295325,0.001946005,0.008227481,0.003076316,0.000637145,0.00113685,0.001397816,0.2397469,0.06088364,0.3580585,0.06614111,0.252453],"study_design_scores_gemma":[0.0004685638,0.000631057,0.001594864,0.0002366298,0.0004533483,0.0008036186,0.0002509835,0.6805738,0.02201532,0.2787217,0.01406117,0.0001888857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07888873,0.004358439,0.8475308,0.01146327,0.001193242,0.0008221098,0.00164294,0.01307103,0.04102939],"genre_scores_gemma":[0.6029428,0.001558899,0.3564471,0.005061412,0.00149758,0.001775255,0.003043079,0.004879091,0.02279497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02726404,"threshold_uncertainty_score":0.09120727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01838432143570182,"score_gpt":0.2866736917350727,"score_spread":0.2682893702993708,"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."}}