{"id":"W2973453427","doi":"10.1109/tit.2019.2940975","title":"Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamming code; Hamming distance; Combinatorics; Discrete mathematics; Disjoint sets; Mathematics; Locality; Node (physics); Computer science; Linear code; Set (abstract data type); Algorithm; Block code; Decoding methods; Physics","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.0006110906,0.0002160273,0.0002270159,0.0003564381,0.0002710192,0.0001334345,0.0006861927,0.0001536839,0.00006499614],"category_scores_gemma":[0.0000705413,0.0002049807,0.0002132433,0.0003198429,0.00009424928,0.004355625,0.00001223733,0.0002566768,0.0006574588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001572217,"about_ca_system_score_gemma":0.00009233701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001822437,"about_ca_topic_score_gemma":0.00001174571,"domain_scores_codex":[0.998494,0.00005813716,0.0005356814,0.0002944396,0.0002822226,0.0003355561],"domain_scores_gemma":[0.9980207,0.0003085193,0.000223437,0.001200884,0.0001847368,0.00006172176],"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.0004171977,0.0001824475,0.000007765487,0.0002776805,0.0001686479,0.000002543648,0.002103663,0.6407745,0.001865849,0.2745237,0.004026717,0.0756493],"study_design_scores_gemma":[0.003003212,0.0005906578,0.0000233082,0.0001333796,0.00003721725,0.00004027499,0.001452475,0.8005857,0.07404513,0.04775355,0.07148048,0.0008545666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007702613,0.0000169493,0.9936296,0.0003113502,0.0007451927,0.0008860904,0.0001238821,0.002669286,0.00084743],"genre_scores_gemma":[0.5442155,0.00002696725,0.4536815,0.0009628846,0.00001458975,0.000344942,0.00003355707,0.00001847293,0.0007015329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5434452,"threshold_uncertainty_score":0.8450522,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01562384479844742,"score_gpt":0.2370479118258966,"score_spread":0.2214240670274492,"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."}}