{"id":"W2796240652","doi":"10.1109/tit.2019.2946361","title":"Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Base (topology); Cache; Cover (algebra); Coding (social sciences); Clique; Mathematical optimization; Set cover problem; Set (abstract data type); Base station; Time complexity; Algorithm; Parallel computing; Mathematics; Computer network","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.0007075253,0.0002363921,0.0003163634,0.0003086472,0.0001421903,0.00009551746,0.0007429597,0.0002287489,0.00002944703],"category_scores_gemma":[0.000008786546,0.0001863302,0.000309936,0.0001446174,0.00006114633,0.0008865638,0.00002095887,0.0003577865,0.00001731326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009990334,"about_ca_system_score_gemma":0.0002545232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001592243,"about_ca_topic_score_gemma":0.000002659052,"domain_scores_codex":[0.998416,0.00008947188,0.0007731966,0.0001865659,0.0003668327,0.0001679551],"domain_scores_gemma":[0.9976125,0.0003736265,0.0007861369,0.0007550387,0.0004360139,0.00003665019],"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.001444503,0.0000771374,0.000001350951,0.0004682922,0.0002990673,9.317058e-8,0.003794307,0.9579689,0.004512964,0.009539222,0.00004660643,0.02184759],"study_design_scores_gemma":[0.001417231,0.0004698736,0.0001075643,0.0002577451,0.00016442,0.000005794789,0.0004049136,0.9409285,0.05459945,0.0009618797,0.0003308427,0.0003518579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07855467,0.00001342406,0.9178306,0.00009220668,0.001750304,0.001012737,0.0005643158,0.00006136551,0.0001203349],"genre_scores_gemma":[0.9976841,0.0001096051,0.001479075,0.0002336722,0.00002623876,0.0001350957,0.0001502091,0.00001061005,0.0001713452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9191295,"threshold_uncertainty_score":0.7598324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01065496740790834,"score_gpt":0.2184766131450712,"score_spread":0.2078216457371629,"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."}}