{"id":"W4403986936","doi":"10.1016/j.disc.2024.114298","title":"On finding the largest minimum distance of locally recoverable codes: A graph theory approach","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph theory; Graph","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.0006949413,0.0001914665,0.0002434068,0.0001140257,0.0001201283,0.000176711,0.001540426,0.00007258062,0.000007102892],"category_scores_gemma":[0.0003819174,0.0001177627,0.00009987012,0.0006583258,0.0002251811,0.0003549859,0.0003675065,0.0002681523,0.00002696227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004151074,"about_ca_system_score_gemma":0.00003744166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001210654,"about_ca_topic_score_gemma":0.000001337516,"domain_scores_codex":[0.9986585,0.00005160889,0.0003168914,0.0003647549,0.0003349004,0.0002733158],"domain_scores_gemma":[0.9975044,0.001026231,0.0001282316,0.00128051,0.00003204607,0.0000285901],"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.000004177635,0.00004720452,0.000002185148,0.000267991,0.00003062061,0.00001021351,0.001274122,0.0004333893,0.0001329882,0.9943071,0.0007641991,0.002725822],"study_design_scores_gemma":[0.00007957519,0.00007043573,0.000002958347,0.0003551296,0.00001566945,0.0000144628,0.0007802246,0.1427201,0.001446104,0.8534906,0.0008467886,0.0001779127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00179371,0.0006792165,0.989421,0.0002641295,0.0001523211,0.0002514157,0.00006982234,0.0004404635,0.006927979],"genre_scores_gemma":[0.644406,0.0001016947,0.3545271,0.00009689378,0.00002005275,0.00006978906,0.00001481708,0.00003427605,0.000729405],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6426123,"threshold_uncertainty_score":0.4802223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.019490960527397,"score_gpt":0.2627805352785573,"score_spread":0.2432895747511603,"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."}}