{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004719918,0.0005305029,0.0005064227,0.0002072918,0.0004005742,0.0002580595,0.002081911,0.0002877794,0.00001486243],"category_scores_gemma":[0.00004161974,0.0005388951,0.0003163723,0.0003093469,0.0001534448,0.0004142203,0.001530313,0.000766421,0.00002463463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003043761,"about_ca_system_score_gemma":0.0004733138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005728334,"about_ca_topic_score_gemma":0.00006505683,"domain_scores_codex":[0.9971573,0.0001676825,0.0002731573,0.001598595,0.0001866303,0.0006166857],"domain_scores_gemma":[0.9973212,0.000360956,0.0003324517,0.001475287,0.0002540588,0.0002559953],"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.0005218029,0.0002238739,0.0009475467,0.0001340615,0.0005014943,0.0002562258,0.0006444404,0.9605079,0.0001758769,0.03483323,0.00109249,0.0001610103],"study_design_scores_gemma":[0.001932352,0.0003025023,0.0001661999,0.0001843003,0.00021532,0.00001289244,0.000189079,0.9917303,0.0003022683,0.003885129,0.0002173165,0.0008623704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4144311,0.00003480688,0.582859,0.0001040162,0.0003898587,0.000506502,0.00004096784,0.0002458521,0.001387894],"genre_scores_gemma":[0.9880619,0.00001840225,0.008200906,0.0002397072,0.0001984144,0.000009372776,0.00004280181,0.00003873395,0.00318974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.574658,"threshold_uncertainty_score":0.9997063,"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."}}