{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006621834,0.0003950515,0.0004011319,0.0004616044,0.0002673169,0.0002627137,0.001003316,0.0003766486,0.00002935639],"category_scores_gemma":[0.00002434219,0.0003607894,0.00009713053,0.0003005738,0.0003847416,0.003714743,0.00005841805,0.001008097,0.00009004786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004167318,"about_ca_system_score_gemma":0.0002575408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004460203,"about_ca_topic_score_gemma":0.00004282728,"domain_scores_codex":[0.9981459,0.0001469778,0.0004958783,0.0005182046,0.0003746032,0.0003184068],"domain_scores_gemma":[0.9973179,0.0003480682,0.0003766966,0.001663647,0.0002182091,0.00007547322],"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.0009528701,0.0001718827,0.00003339536,0.0007161085,0.0002661614,0.00001048006,0.001900511,0.6405558,0.00007219115,0.02408756,0.00009555728,0.3311375],"study_design_scores_gemma":[0.002177958,0.0008796239,0.0004835401,0.0006317421,0.0001479497,0.0001620692,0.00150914,0.8363764,0.006159401,0.1481055,0.001559668,0.001806949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007620523,0.0000405362,0.9884307,0.0002234512,0.0005685908,0.0006968538,0.000409018,0.001251783,0.0007584975],"genre_scores_gemma":[0.9047162,0.0002253395,0.09450909,0.0002144121,0.000005215856,0.00007810996,0.00007152832,0.00001895066,0.0001611721],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8970957,"threshold_uncertainty_score":0.9998844,"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."}}