{"id":"W3138307748","doi":"10.1109/tit.2022.3193316","title":"Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Popularity; Cache; Computer science; Upper and lower bounds; Parallel computing; Theoretical computer science; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.002670136,0.001265457,0.001462238,0.001063618,0.0007847026,0.002379976,0.002460234,0.001312196,0.001390485],"category_scores_gemma":[0.02142592,0.0006296863,0.0004453263,0.002161921,0.001284009,0.00441691,0.001391188,0.001089244,0.0003096989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004011806,"about_ca_system_score_gemma":0.001667104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004054261,"about_ca_topic_score_gemma":0.003005359,"domain_scores_codex":[0.9976937,0.0006105584,0.0001300119,0.000376569,0.0005632524,0.0006258551],"domain_scores_gemma":[0.9874334,0.008064812,0.001356037,0.00157377,0.001312112,0.0002599124],"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.0006912113,0.0001151025,0.002261876,0.0002718521,0.00006995728,0.0003753094,0.000229704,0.8683937,0.01588472,0.08403558,0.001207907,0.02646291],"study_design_scores_gemma":[0.00001702118,0.00008086139,0.0004136194,0.00002075227,0.00002476862,0.0001414443,0.00005650809,0.9831842,0.005075745,0.01061592,0.0003407254,0.00002846586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3618911,0.002883283,0.6252787,0.0007672702,0.00006823913,0.00009688955,0.0003497352,0.0005094595,0.008155325],"genre_scores_gemma":[0.9721838,0.0008658002,0.02530106,0.0000801311,0.00004665785,0.00007192433,0.0001079894,0.0000688096,0.001273947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004054261,"threshold_uncertainty_score":0.02910787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0106051596144814,"score_gpt":0.2061341089099911,"score_spread":0.1955289492955097,"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."}}