{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050398,0.0006962373,0.001013171,0.000612971,0.0006675798,0.001791123,0.00132637,0.001332101,0.004050512],"category_scores_gemma":[0.01010912,0.0005122247,0.0004869031,0.001149896,0.001162763,0.00168812,0.0009912371,0.0008652981,0.0004321754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003227497,"about_ca_system_score_gemma":0.002019034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005005034,"about_ca_topic_score_gemma":0.003515564,"domain_scores_codex":[0.9992375,0.0001922027,0.00002507583,0.0001258694,0.0002202659,0.0001989859],"domain_scores_gemma":[0.9964223,0.002429983,0.0003819258,0.0002368086,0.000358227,0.0001707639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001654855,0.0000645641,0.0005838422,0.0001239459,0.00002087398,0.0001536594,0.000117208,0.9180534,0.004303155,0.06228473,0.002621531,0.01150746],"study_design_scores_gemma":[0.000009178341,0.00002069624,0.000123645,0.00000930949,0.000004008531,0.00003956259,0.00002572181,0.9822628,0.0007749649,0.01634201,0.0003821577,0.000005924056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1885298,0.0004318187,0.7901968,0.0008368508,0.00004536324,0.0002159278,0.0006339477,0.0003290656,0.01878039],"genre_scores_gemma":[0.895623,0.0004953692,0.09731001,0.0001420294,0.00006237375,0.0002595751,0.000520983,0.0001914651,0.005395261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005005034,"threshold_uncertainty_score":0.02341729,"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."}}