{"id":"W2970227064","doi":"10.1109/spawc.2019.8815475","title":"Optimal Cache Placement for Modified Coded Caching with Arbitrary Cache Size","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Cache; Computer science; Smart Cache; Cache invalidation; Cache algorithms; Cache coloring; Cache-oblivious algorithm; Scheme (mathematics); Parallel computing; CPU cache; Distributed computing; 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.0006695577,0.0005835364,0.0006499757,0.0001397199,0.0002027591,0.0005698954,0.001871558,0.0002829874,0.00001851859],"category_scores_gemma":[0.00004394943,0.0004681945,0.0003183387,0.0001146536,0.00004376756,0.0002857893,0.00157576,0.001001652,0.00002750391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001817534,"about_ca_system_score_gemma":0.0006388081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001015628,"about_ca_topic_score_gemma":0.00004218682,"domain_scores_codex":[0.9968321,0.0001220321,0.0004739274,0.001355795,0.0005810182,0.0006350935],"domain_scores_gemma":[0.997142,0.000564713,0.0002909467,0.001644723,0.0001721445,0.0001854859],"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.0003215852,0.0002499422,0.0003660516,0.0003274744,0.000561887,0.00003325082,0.001181696,0.9742733,0.0006849129,0.01643179,0.004102999,0.001465095],"study_design_scores_gemma":[0.001853285,0.0002644237,0.0001050042,0.000220396,0.000100599,0.00002158549,0.0001715372,0.994455,0.0007602696,0.0007026547,0.0004030759,0.0009421084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1018301,0.0001800153,0.8866826,0.001004514,0.0009845891,0.001466025,0.00005360032,0.000447208,0.007351287],"genre_scores_gemma":[0.903466,0.000009745122,0.08634602,0.0009634608,0.0001981093,0.0002785008,0.00007575354,0.00005028079,0.008612102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8016359,"threshold_uncertainty_score":0.999777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.031862979384558,"score_gpt":0.2484780207292654,"score_spread":0.2166150413447074,"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."}}