{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001244711,0.0009675015,0.00118314,0.0002862541,0.0007286788,0.002864361,0.003191364,0.0008616342,0.00002919043],"category_scores_gemma":[0.0001734378,0.0008819993,0.0004387415,0.0003113728,0.0002650511,0.002401657,0.001410549,0.000761313,0.0001232516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001966134,"about_ca_system_score_gemma":0.0003786721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006693677,"about_ca_topic_score_gemma":0.00005038997,"domain_scores_codex":[0.9948712,0.00004679125,0.001976711,0.0009893919,0.0007317061,0.001384172],"domain_scores_gemma":[0.9942477,0.0002669949,0.001193823,0.002653075,0.001091055,0.0005473053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001048543,0.005944457,0.02823339,0.0262539,0.002964894,0.0000839417,0.05682567,0.001764874,0.0004232559,0.08939654,0.7295418,0.05751875],"study_design_scores_gemma":[0.003178247,0.0009923875,0.0009051847,0.0008812763,0.0001014414,0.00008774491,0.0003293293,0.3367929,0.0003844104,0.004257454,0.650358,0.001731682],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07600279,0.0003616108,0.8839514,0.0005781122,0.008427931,0.005818084,0.01944952,0.0007453536,0.004665184],"genre_scores_gemma":[0.8506624,0.0001893274,0.1285487,0.003064475,0.002357499,0.002447102,0.009964583,0.0002842454,0.002481698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7746596,"threshold_uncertainty_score":0.9993631,"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."}}