{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213365,0.0001666628,0.0001605299,0.0002933225,0.001102259,0.0001653324,0.0004056911,0.0000340064,0.00007008541],"category_scores_gemma":[0.0000036986,0.0001448898,0.000128318,0.0002700306,0.00002852806,0.001474584,0.000004952382,0.0002908289,0.00002070705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001934022,"about_ca_system_score_gemma":0.0001005073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002065655,"about_ca_topic_score_gemma":0.00001154585,"domain_scores_codex":[0.9987541,0.0001550939,0.0003377781,0.0001670183,0.0003429914,0.0002430124],"domain_scores_gemma":[0.9990222,0.0003425974,0.0001477706,0.0003489781,0.00006720208,0.00007124813],"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.001170727,0.00007974837,2.984536e-7,0.0000210026,0.00008439193,8.196374e-7,0.0029442,0.954488,0.0001098522,0.01375402,0.0001645905,0.02718234],"study_design_scores_gemma":[0.01536965,0.001493256,0.0000190275,0.00005228737,0.0001335154,0.0001083546,0.008506462,0.9539124,0.009177515,0.006445915,0.003972608,0.0008089889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01058117,0.000009309979,0.9859169,0.0004536237,0.0006804487,0.0005379256,0.00005435051,0.0002353194,0.001530961],"genre_scores_gemma":[0.9959278,0.000004325342,0.0009944877,0.001817325,0.00001596152,0.000444926,0.00001765199,0.00001024942,0.00076734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9853466,"threshold_uncertainty_score":0.8477794,"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."}}