{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007968438,0.0007348239,0.0007877406,0.000479702,0.000387325,0.001016903,0.001337023,0.001117719,0.001367918],"category_scores_gemma":[0.005421953,0.0003928457,0.0004095556,0.001035171,0.0009758538,0.001349125,0.0007908168,0.0007874573,0.0001403299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0025109,"about_ca_system_score_gemma":0.001750024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01129181,"about_ca_topic_score_gemma":0.007084477,"domain_scores_codex":[0.9994414,0.0002046395,0.00001857908,0.000092992,0.0001108429,0.0001315131],"domain_scores_gemma":[0.9978986,0.001300236,0.0002355505,0.0001325733,0.0003227861,0.0001103206],"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.00006598207,0.00003424901,0.0004144365,0.00004814634,0.00001476211,0.0001295849,0.00003549845,0.9687673,0.002429632,0.02182907,0.0007311818,0.005500205],"study_design_scores_gemma":[0.000007887416,0.00001557204,0.00006983543,0.000003220985,0.000004554758,0.00001860158,0.00001227679,0.996267,0.0004110739,0.003023635,0.0001615895,0.000004694213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2001548,0.0005962731,0.7914077,0.0005643443,0.00007487439,0.000110961,0.0001995459,0.0001717572,0.006719722],"genre_scores_gemma":[0.9022762,0.0003118666,0.09389947,0.00009463783,0.00003271781,0.0001116269,0.0001028668,0.00005563471,0.003114998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01129181,"threshold_uncertainty_score":0.02245218,"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."}}