{"id":"W2921250680","doi":"10.48550/arxiv.1812.09459","title":"Optimal Cache Placement for Modified Coded Caching with Arbitrary Cache Size","year":2018,"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":"Cache; Computer science; Cache invalidation; Smart Cache; Cache algorithms; Cache coloring; Scheme (mathematics); Parallel computing; CPU cache; Cache-oblivious algorithm; Linear programming; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836978,0.0007764391,0.0008381099,0.0004987117,0.000428075,0.001074611,0.001416024,0.001173427,0.001525301],"category_scores_gemma":[0.006149671,0.0004172778,0.0004408197,0.001048142,0.001007566,0.001463112,0.0008376265,0.0008758578,0.0001534661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002779176,"about_ca_system_score_gemma":0.001894875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01146339,"about_ca_topic_score_gemma":0.007500433,"domain_scores_codex":[0.9994073,0.000218659,0.00002045801,0.0001012012,0.0001125124,0.0001398798],"domain_scores_gemma":[0.9977028,0.001441569,0.0002470259,0.0001466479,0.0003429568,0.0001189994],"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.00007590734,0.00004125905,0.0004908037,0.00006054049,0.0000177455,0.0001481713,0.00004394777,0.9609225,0.002596831,0.02814977,0.0009444215,0.00650803],"study_design_scores_gemma":[0.000008143058,0.00001757763,0.00007546407,0.00000382443,0.000005340419,0.00002084573,0.00001456269,0.9956236,0.0004125476,0.003630072,0.0001829357,0.00000512022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1875441,0.0006707587,0.8030474,0.0007007182,0.00008638418,0.0001242134,0.0002234276,0.00019113,0.007411958],"genre_scores_gemma":[0.9058465,0.0003523809,0.08998244,0.0001110643,0.00003610741,0.0001141626,0.0001025609,0.00006022498,0.003394571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01146339,"threshold_uncertainty_score":0.02279329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07680420736718181,"score_gpt":0.1911118731507102,"score_spread":0.1143076657835284,"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."}}