{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452345,0.0001853681,0.0002126652,0.00008862292,0.0001949622,0.000101057,0.0008008588,0.00008947495,0.0000303585],"category_scores_gemma":[0.00007838133,0.000144827,0.00002173824,0.0003734175,0.0008396474,0.001306284,0.0006280739,0.0001512354,0.00003030087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001225857,"about_ca_system_score_gemma":0.0000724453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001646277,"about_ca_topic_score_gemma":0.0009679811,"domain_scores_codex":[0.9985691,0.00004072487,0.0001669918,0.0006839429,0.0001995792,0.0003396598],"domain_scores_gemma":[0.9984978,0.0001156033,0.00007580443,0.001095548,0.0001454875,0.00006972162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001222044,0.0007193282,0.05415405,0.0002456401,0.0003249102,0.0005793975,0.00137152,0.0006713216,0.01693061,0.3069704,0.005094618,0.6117161],"study_design_scores_gemma":[0.00294589,0.004273202,0.02804679,0.0001405173,0.00004942049,0.00053611,0.0008774231,0.7812043,0.02164912,0.1469955,0.01129142,0.001990265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1125946,0.00004834218,0.8836101,0.0005720972,0.00006285476,0.0001484458,0.0000134898,0.001248127,0.001701884],"genre_scores_gemma":[0.6008369,0.00002187751,0.3987654,0.0001104216,0.000006730395,0.000003566756,0.000003575664,0.000007302643,0.0002442093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.780533,"threshold_uncertainty_score":0.5905875,"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."}}