{"id":"W4372272740","doi":"10.4230/lipics.icalp.2023.80","title":"Efficient Caching with Reserves via Marking","year":2023,"lang":"en","type":"preprint","venue":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Competitive analysis; Online algorithm; Paging; Computer science; Randomized algorithm; Cache; Upper and lower bounds; Simple (philosophy); Function (biology); Rounding; Randomized rounding; Dual (grammatical number); Time complexity; Freivalds' algorithm; CPU cache; Algorithm; Mathematical optimization; Theoretical computer science; Approximation algorithm; Mathematics; Parallel computing; Computer network","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.01638464,0.0006405822,0.001321755,0.002638074,0.001086578,0.002344036,0.004654092,0.000395665,0.00006081512],"category_scores_gemma":[0.00381833,0.0005564679,0.0002186788,0.001802865,0.0102135,0.001281866,0.008433633,0.002155813,0.00003921278],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001308957,"about_ca_system_score_gemma":0.009296047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006172357,"about_ca_topic_score_gemma":0.000573292,"domain_scores_codex":[0.9890679,0.0003635654,0.001895068,0.002695342,0.001083572,0.004894612],"domain_scores_gemma":[0.9875726,0.001679029,0.0005361036,0.001852265,0.001554657,0.006805344],"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.00006576141,0.0002220625,0.006420522,0.0002029927,0.00003684273,0.000008101948,0.00007595942,0.02381259,0.0002387817,0.9679148,0.00003080632,0.000970798],"study_design_scores_gemma":[0.00104734,0.000721565,0.03051323,0.0003756057,0.0000221155,0.0000436054,0.0003455592,0.8106301,0.001127479,0.1538615,0.0004944117,0.0008174002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.976654,0.0002411649,0.002518647,0.01484345,0.0004614275,0.001043791,0.000286969,0.00006427372,0.003886281],"genre_scores_gemma":[0.9780778,0.001701382,0.01928395,0.0003156065,0.0002971266,0.00003791517,0.00001787814,0.00004915385,0.0002192089],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8140532,"threshold_uncertainty_score":0.9996887,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07166955629201377,"score_gpt":0.3617039445031969,"score_spread":0.2900343882111832,"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."}}