{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007253457,0.0004072799,0.0006774624,0.0004195009,0.0007293716,0.001011126,0.0009907193,0.0006289279,0.0008238817],"category_scores_gemma":[0.005117013,0.000237585,0.0001515535,0.0006645338,0.0007457635,0.001394276,0.0008215146,0.0005003683,0.0001299242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001846152,"about_ca_system_score_gemma":0.001838423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006618856,"about_ca_topic_score_gemma":0.005421796,"domain_scores_codex":[0.9994681,0.0001295869,0.00003283991,0.00007550484,0.0001757528,0.0001181016],"domain_scores_gemma":[0.997799,0.001198279,0.0002152819,0.0002664156,0.000422575,0.00009834579],"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.0003460551,0.00009107514,0.001127927,0.0001381364,0.00002095212,0.0001944701,0.0001373075,0.9163955,0.01893739,0.03035022,0.001587209,0.03067373],"study_design_scores_gemma":[0.00001117374,0.00001891945,0.00006419807,0.000003564877,0.00000321871,0.00001740485,0.00001306777,0.9927,0.002017563,0.004972646,0.0001733254,0.000004965501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2700456,0.0009795727,0.7244008,0.0003838617,0.00006220194,0.00008427222,0.0001114342,0.0008086435,0.003123626],"genre_scores_gemma":[0.9704728,0.0001319782,0.02857595,0.00002721834,0.00001175053,0.00003000512,0.00003088257,0.00002113388,0.0006982187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006618856,"threshold_uncertainty_score":0.01339483,"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."}}