{"id":"W3098011197","doi":"10.48550/arxiv.2011.08122","title":"Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cache; Popularity; Padding; Scheme (mathematics); CPU cache; Upper and lower bounds; Computer network; Cache algorithms; Parallel computing; Computer security; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377234,0.001177128,0.001216095,0.001035678,0.0008470498,0.002057447,0.002040509,0.001193017,0.001287634],"category_scores_gemma":[0.02112431,0.0004856625,0.0003847213,0.001844833,0.001491363,0.004117558,0.001407781,0.001109111,0.000267729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003745778,"about_ca_system_score_gemma":0.001721947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003759812,"about_ca_topic_score_gemma":0.003067608,"domain_scores_codex":[0.9983355,0.0004699449,0.00008740682,0.0002372377,0.0003764223,0.0004934882],"domain_scores_gemma":[0.9874089,0.007682423,0.001495361,0.001669793,0.001473961,0.0002696067],"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.0007952659,0.0001356988,0.003415608,0.0003397536,0.00007985109,0.000500285,0.0003306858,0.8308113,0.02653744,0.1063638,0.00181477,0.02887565],"study_design_scores_gemma":[0.00001820234,0.0001304163,0.0005847576,0.00003027383,0.00003287858,0.0002427106,0.00008750256,0.9762306,0.009455171,0.01273598,0.0004085904,0.00004290998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4469125,0.003633028,0.5375714,0.0009394621,0.00008258571,0.0001094698,0.0003801254,0.0005374408,0.009833956],"genre_scores_gemma":[0.9806094,0.0007593511,0.01744449,0.00007880318,0.00003393183,0.00005567746,0.0000689575,0.00004514802,0.0009044765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003759812,"threshold_uncertainty_score":0.02717763,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1019323986737907,"score_gpt":0.1858123191945302,"score_spread":0.08387992052073953,"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."}}