{"id":"W1998843748","doi":"10.1016/s0304-3975(98)00116-9","title":"Competitive analysis of randomized paging algorithms","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Paging; Competitive analysis; Computer science; Online algorithm; Cache; Algorithm; Randomized algorithm; CPU cache; Demand paging; Page fault; Cache algorithms; Deterministic algorithm; Virtual memory; Memory management; Parallel computing; Upper and lower bounds; Mathematics; Operating system","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":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003394283,0.0001378466,0.0006222902,0.0005716127,0.0002206001,0.000276266,0.001898534,0.00003168027,0.0009561434],"category_scores_gemma":[0.0000913379,0.0001053503,0.0002416257,0.004672198,0.003961053,0.0005201633,0.0003732544,0.0001283928,0.0000440105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002687346,"about_ca_system_score_gemma":0.00008809678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008084495,"about_ca_topic_score_gemma":6.004889e-7,"domain_scores_codex":[0.9973611,0.0003539698,0.0004511581,0.0005553968,0.0008573942,0.0004210245],"domain_scores_gemma":[0.998095,0.0006296893,0.00008463021,0.0006482695,0.0003227323,0.0002196596],"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.0001010339,0.00004594006,0.000007380757,0.000002047305,0.000069289,0.000002646904,0.0006670746,0.01135252,0.00003003765,0.9526325,0.000004016641,0.03508545],"study_design_scores_gemma":[0.00425428,0.0000456333,0.0001241082,0.00001275204,0.00005760959,0.000002842917,0.000004798731,0.9666694,0.0004384223,0.02817253,0.00008659009,0.0001309957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00242172,0.00002050614,0.9628409,0.0006763919,0.0001028411,0.0002150622,0.000002510626,0.0001084067,0.03361172],"genre_scores_gemma":[0.7388724,0.00002569932,0.2606899,0.0003484808,0.00001897886,0.000006356352,0.000001967511,0.000003233633,0.00003297355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9553169,"threshold_uncertainty_score":0.9999571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008541897466011434,"score_gpt":0.2632950407095936,"score_spread":0.2547531432435822,"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."}}