{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00152455,0.0006473723,0.001124907,0.0006247477,0.0009300653,0.002675238,0.002664357,0.001420352,0.002905149],"category_scores_gemma":[0.008619271,0.000419729,0.0006541075,0.001335281,0.001330749,0.00580069,0.001966615,0.001497203,0.0006444397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001483439,"about_ca_system_score_gemma":0.001684003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001444862,"about_ca_topic_score_gemma":0.001470143,"domain_scores_codex":[0.9982614,0.0005168744,0.00009909688,0.0003721646,0.0003848656,0.0003656554],"domain_scores_gemma":[0.9953791,0.002156808,0.0005191335,0.00144636,0.0003045862,0.0001940154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009264294,0.0002542671,0.001587074,0.0003166072,0.00007024167,0.0002849627,0.0002874736,0.4496805,0.01993589,0.3962452,0.009928962,0.1204824],"study_design_scores_gemma":[0.00004488968,0.00007092646,0.0001807607,0.00002210982,0.00002161044,0.0001552026,0.00005441243,0.8608006,0.006820339,0.1287285,0.003080071,0.00002056995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08786732,0.0004525295,0.8994616,0.0009713321,0.00009775542,0.0001218825,0.0002311856,0.001573328,0.009223102],"genre_scores_gemma":[0.8183095,0.0002355366,0.1764997,0.0001709284,0.00007409495,0.0001141698,0.0001694283,0.0001929988,0.004233439],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002905149,"threshold_uncertainty_score":0.01076317,"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."}}