{"id":"W4287556996","doi":"10.48550/arxiv.2012.03005","title":"Optimal Caching for Low Latency in Distributed Coded Storage Systems","year":2020,"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":"University of Toronto; University of Victoria","funders":"","keywords":"Erasure code; Computer science; Latency (audio); Distributed data store; Distributed computing; Computer network; Computer data storage; Data retrieval; Decoding methods; Algorithm; Data mining","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.000314077,0.0003314065,0.000490387,0.0002222585,0.0001465388,0.0002364638,0.001751591,0.0002650502,0.000002143552],"category_scores_gemma":[0.00006701754,0.0003980565,0.0002655178,0.0004568894,0.00003969695,0.0003400373,0.001344861,0.0007225006,0.0000227601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003765023,"about_ca_system_score_gemma":0.000215945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00082448,"about_ca_topic_score_gemma":0.00003841701,"domain_scores_codex":[0.9978191,0.0001723099,0.0002858565,0.001190201,0.000102514,0.0004299904],"domain_scores_gemma":[0.9984647,0.000156178,0.000246712,0.0008175121,0.0001251695,0.0001897386],"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.00005561774,0.00006439887,0.0007502401,0.0001784615,0.00005642411,0.0005197395,0.0001873427,0.9693958,0.0001060711,0.02837563,0.000263248,0.00004702154],"study_design_scores_gemma":[0.0007805408,0.00005473305,0.0003760149,0.0002297516,0.0000373869,0.000003716445,0.00009154315,0.9965218,0.00001480743,0.001321851,0.0001361987,0.0004316915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3328035,0.00008287014,0.6653756,0.0001189413,0.0007484527,0.00041514,0.0001244646,0.0002290656,0.000101907],"genre_scores_gemma":[0.9989011,0.00003618582,0.0004291013,0.00005171591,0.00008810581,0.000004360377,0.0001194369,0.0000197612,0.0003501777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6660976,"threshold_uncertainty_score":0.9998471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07345067531008968,"score_gpt":0.1844884528890904,"score_spread":0.1110377775790007,"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."}}