{"id":"W2896908943","doi":"10.1145/3308897.3308914","title":"Worst-case Bounds and Optimized Cache on Mth Request Cache Insertion Policies under Elastic Conditions","year":2019,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Cache; Computer science; Cache algorithms; Parallel computing; Smart Cache; Cache invalidation; CPU cache; Arithmetic; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.002814126,0.0002362044,0.0003654258,0.0005212832,0.0003172312,0.0002230089,0.0005133361,0.0000860327,0.00009126934],"category_scores_gemma":[0.001558225,0.0002042391,0.00009659401,0.001777538,0.00004720603,0.0008993879,0.0002041312,0.0002908838,0.0003185198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002833917,"about_ca_system_score_gemma":0.0002123676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006103782,"about_ca_topic_score_gemma":0.000006591669,"domain_scores_codex":[0.9976357,0.0003054196,0.0004971736,0.0004799318,0.0007940655,0.0002877642],"domain_scores_gemma":[0.9974061,0.0006801015,0.0002796769,0.001079446,0.0004379858,0.0001166372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001308114,0.00106243,0.01373159,0.005672162,0.0005059222,0.00008369858,0.002159077,0.05338813,0.001535144,0.04295648,0.01592498,0.8628496],"study_design_scores_gemma":[0.003261766,0.0010074,0.0195781,0.005881485,0.0005539631,0.000781282,0.0001327329,0.962161,0.0001274081,0.001759065,0.003630093,0.0011257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9371526,0.04609175,0.009912644,0.003121596,0.000880515,0.001483358,0.000009426124,0.00018596,0.001162132],"genre_scores_gemma":[0.95966,0.03533563,0.00119319,0.003356593,0.00005380568,0.0001118741,0.00004830652,0.00001503827,0.0002255518],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9087729,"threshold_uncertainty_score":0.8328629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07209332620444928,"score_gpt":0.3327206799919905,"score_spread":0.2606273537875412,"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."}}