{"id":"W1578377210","doi":"10.1002/wcm.1182","title":"OUR: Optimal Update‐based Replacement policy for cache in wireless data access networks with optimal effective hits and bandwidth requirements","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Computer network; Cache invalidation; Bandwidth (computing); Data access; Cache algorithms; Scheme (mathematics); Data transmission; Wireless; Wireless network; Distributed computing; CPU cache; Database; Telecommunications","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.0009085496,0.0002471374,0.00032774,0.0002049318,0.0005878778,0.0003195748,0.002504676,0.00007666848,4.398821e-7],"category_scores_gemma":[0.00001830117,0.0002272473,0.00003300946,0.0004013079,0.0001256144,0.0006394806,0.003395908,0.0002836691,3.643741e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007371201,"about_ca_system_score_gemma":0.0001126762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009177552,"about_ca_topic_score_gemma":0.0001871696,"domain_scores_codex":[0.9981328,0.0002400916,0.0003793862,0.0006842026,0.0001526351,0.0004108761],"domain_scores_gemma":[0.9968535,0.0002787704,0.0002335631,0.002382815,0.0001270257,0.0001243833],"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.0006699716,0.001484617,0.05447195,0.000229882,0.0003498533,0.00001849032,0.006187237,0.03145737,0.0003187777,0.01535226,0.0003038442,0.8891557],"study_design_scores_gemma":[0.001620364,0.0003081528,0.003347192,0.000250813,0.00002550227,0.00001342377,0.0002975656,0.9935309,0.00007263475,0.00001870246,0.0002280737,0.0002866879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4724484,0.0005778322,0.5255467,0.0002925863,0.00005309896,0.0009093411,0.00001704721,0.00008771611,0.00006724408],"genre_scores_gemma":[0.962617,0.0002644349,0.03651073,0.0002066738,0.00003941591,0.0002224333,0.0001107837,0.00002170572,0.000006868451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9620735,"threshold_uncertainty_score":0.9266875,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0880910298997147,"score_gpt":0.3417144043363876,"score_spread":0.2536233744366728,"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."}}