{"id":"W2947759080","doi":"10.1016/j.peva.2018.09.006","title":"Worst-case bounds and optimized cache on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e2260\" altimg=\"si453.gif\"><mml:mi>M</mml:mi></mml:math>th request cache insertion policies under elastic conditions","year":2018,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Cache; Bandwidth (computing); Cloud computing; Online algorithm; CPU cache; Upper and lower bounds; Competitive analysis; Average cost","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"],"consensus_categories":[],"category_scores_codex":[0.001285747,0.0002655434,0.0001660484,0.0001898316,0.001021013,0.0004718853,0.0003356742,0.0002300966,0.0000229125],"category_scores_gemma":[0.0002778633,0.0002877532,0.0001278832,0.0003280207,0.0002592553,0.001198141,0.0002159755,0.0003395313,0.0003744317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007415008,"about_ca_system_score_gemma":0.0003241368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004865393,"about_ca_topic_score_gemma":0.0002457638,"domain_scores_codex":[0.9976432,0.0001442689,0.0004521791,0.0005311949,0.000788284,0.0004408121],"domain_scores_gemma":[0.9983836,0.0002667979,0.0003385888,0.0006613344,0.0001998071,0.0001498634],"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.0002374972,0.0001500538,0.00006736998,0.00007337701,0.0001094535,0.00003282335,0.002110079,0.01596963,0.001851265,0.9751371,0.000384125,0.003877249],"study_design_scores_gemma":[0.001038118,0.0006138052,0.001485335,0.0002560214,0.0001682856,0.000374852,0.0002392426,0.9937714,0.001237482,0.0004002855,0.0001303052,0.0002849152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9876586,0.0001660669,0.009917514,0.000503321,0.0007881903,0.0001168881,0.00003158116,0.0001610059,0.0006568255],"genre_scores_gemma":[0.9969317,0.0001526464,0.001199929,0.0007631771,0.0004657269,0.0001824342,0.0001978658,0.00003845777,0.00006803537],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9778017,"threshold_uncertainty_score":0.9999574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03297753809922176,"score_gpt":0.2783680073841614,"score_spread":0.2453904692849396,"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."}}