{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000300158,0.0004481367,0.0004719521,0.0001776128,0.0003507796,0.000261917,0.001749385,0.000235709,0.00004726748],"category_scores_gemma":[0.0000315114,0.0004597194,0.000302552,0.0003610761,0.000064682,0.0004080833,0.001192772,0.0007828153,0.00002941583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003638853,"about_ca_system_score_gemma":0.0003014477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007708406,"about_ca_topic_score_gemma":0.0003598855,"domain_scores_codex":[0.9976035,0.000137422,0.0002375555,0.001394577,0.0001475026,0.0004794105],"domain_scores_gemma":[0.9979869,0.0001884714,0.0002892863,0.001131497,0.0001392102,0.0002646484],"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.0003508269,0.0001770193,0.0001875902,0.0002305964,0.0003995058,0.000365757,0.0004935521,0.9228277,0.0001215499,0.07063252,0.003702671,0.0005106874],"study_design_scores_gemma":[0.001619402,0.0002626854,0.0004076576,0.0001880803,0.000179121,0.000008756408,0.0003464537,0.98063,0.0001404369,0.01480775,0.0005747015,0.0008349919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1108693,0.00002515184,0.8851578,0.0006795703,0.0004609705,0.0006860633,0.0003007094,0.0004049559,0.001415439],"genre_scores_gemma":[0.9942628,0.0000167155,0.002621788,0.0005810549,0.00009807866,0.000006808201,0.0002167413,0.0000314294,0.002164541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8833935,"threshold_uncertainty_score":0.9997855,"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."}}