{"id":"W2953243231","doi":"10.1109/tit.2019.2924888","title":"Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natur og Univers, Det Frie Forskningsråd","keywords":"Locality; Erasure code; Erasure; Mathematics; Discrete mathematics; Code (set theory); Disjoint sets; Bounded function; Computer science; Combinatorics; Algorithm; 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.0007364503,0.000950812,0.0006579308,0.0009272957,0.0006786777,0.001339095,0.001120243,0.000649898,0.0026009],"category_scores_gemma":[0.003808045,0.0003313434,0.0005521996,0.00109075,0.001846893,0.002069322,0.002414804,0.001193111,0.000905462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259128,"about_ca_system_score_gemma":0.00119031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066846,"about_ca_topic_score_gemma":0.002144901,"domain_scores_codex":[0.9987721,0.0002119945,0.00007184415,0.0002525812,0.0004261165,0.0002654537],"domain_scores_gemma":[0.9975417,0.0006767415,0.0003941192,0.0007847109,0.0004288566,0.0001740493],"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.0004221375,0.00006630213,0.0007607875,0.0003076034,0.00004943955,0.0004437628,0.000530216,0.3520222,0.03265853,0.5057623,0.003125956,0.1038507],"study_design_scores_gemma":[0.00004493871,0.0002185859,0.0003427482,0.00007684452,0.00005251918,0.0004416112,0.0001769369,0.7292082,0.04609232,0.2150835,0.008166568,0.00009509523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1133103,0.0004643856,0.8712013,0.0002055698,0.00004298986,0.00006520827,0.0002055905,0.001340777,0.01316376],"genre_scores_gemma":[0.8740987,0.0004784057,0.1155038,0.0001002299,0.00006020858,0.0001352813,0.0003434518,0.0002311557,0.009048724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0026009,"threshold_uncertainty_score":0.009135723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007122627266543371,"score_gpt":0.2160990150505908,"score_spread":0.2089763877840475,"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."}}