{"id":"W2892776878","doi":"10.1109/allerton.2018.8635867","title":"Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Locality; Erasure code; Disjoint sets; Reed–Solomon error correction; Discrete mathematics; Finite field; Code (set theory); Erasure; Mathematics; Cartesian product; Computer science; Linear code; Algorithm; Block code; Decoding methods","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.0007131406,0.0009081119,0.0007499276,0.0008590439,0.0006955685,0.001131769,0.001188286,0.0006623808,0.002223616],"category_scores_gemma":[0.003526313,0.000343456,0.0006498159,0.001066903,0.001761219,0.002248996,0.002678175,0.001399281,0.0007742008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001105243,"about_ca_system_score_gemma":0.001272944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00188482,"about_ca_topic_score_gemma":0.002025248,"domain_scores_codex":[0.9989003,0.000191812,0.00006500896,0.0002247129,0.0003710437,0.0002471368],"domain_scores_gemma":[0.9976096,0.0007027786,0.0003014008,0.0008938723,0.0003356183,0.0001567924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004767692,0.00007669949,0.0008184392,0.0003784894,0.0000611532,0.0004715156,0.0005634303,0.3451985,0.03951973,0.4684529,0.003794544,0.1401879],"study_design_scores_gemma":[0.00005705946,0.0002502195,0.0003598034,0.00008291128,0.00006536392,0.0004449174,0.0001588644,0.7324038,0.04629457,0.2115117,0.008267918,0.0001028585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1191763,0.0005769344,0.8684298,0.00025584,0.00004931523,0.00007160845,0.0002105826,0.001497179,0.009732413],"genre_scores_gemma":[0.8376129,0.0005776497,0.1525699,0.0001210253,0.0000687985,0.0001509487,0.000379065,0.000214129,0.008305604],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.002223616,"threshold_uncertainty_score":0.008019209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008435974958480879,"score_gpt":0.2260348101211838,"score_spread":0.2175988351627029,"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."}}