{"id":"W4387385575","doi":"10.1109/tcomm.2023.3322174","title":"A Family of Binary Locally Repairable Codes for Coded Distributed Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Block code; Decoding methods; Linear code; Matrix multiplication; Computational complexity theory; Concatenated error correction code; Coding (social sciences); Theoretical computer science; Multiplication (music); List decoding; Binary number; Algorithm; Mathematics; Arithmetic","routes":{"ca_aff":true,"ca_fund":true,"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.000420861,0.0001388476,0.0002158343,0.0003515989,0.0005512452,0.00004792287,0.001664176,0.0000770982,0.000002871769],"category_scores_gemma":[0.00004090884,0.0001532693,0.0001425093,0.001660874,0.0001687537,0.0001967749,0.00002698182,0.0001713832,0.00001507044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006355524,"about_ca_system_score_gemma":0.0001031866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004239945,"about_ca_topic_score_gemma":0.00001417776,"domain_scores_codex":[0.9987333,0.0001086813,0.0004525015,0.000270633,0.0001970504,0.0002378046],"domain_scores_gemma":[0.9962667,0.001137959,0.0001655578,0.002015729,0.0003470423,0.00006700188],"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.00007843129,0.001715869,0.00003324647,0.0001397056,0.0002735967,0.000002296624,0.00214251,0.822473,0.01844011,0.1159784,0.009311378,0.02941147],"study_design_scores_gemma":[0.0003694873,0.0001961055,0.0001548887,0.0000861102,0.0000222265,0.000002674798,0.0001019029,0.9898275,0.006084588,0.002449765,0.0005505819,0.0001542059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007644588,0.00004001266,0.9953263,0.001208883,0.0001752937,0.0006085698,0.000228237,0.001411985,0.000236215],"genre_scores_gemma":[0.6849274,0.0001009447,0.314533,0.00007628245,0.000004097689,0.0001893169,0.00006109681,0.00001545535,0.00009242749],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6841629,"threshold_uncertainty_score":0.6250141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05301074733122166,"score_gpt":0.3056533486284639,"score_spread":0.2526426012972423,"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."}}