{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002394132,0.002000724,0.002490925,0.003095602,0.001574165,0.002441862,0.003851492,0.0034361,0.004627734],"category_scores_gemma":[0.02483122,0.0009914223,0.001559084,0.003603094,0.003849705,0.007306412,0.004191895,0.006222404,0.001080922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002637475,"about_ca_system_score_gemma":0.001546922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001641612,"about_ca_topic_score_gemma":0.001595151,"domain_scores_codex":[0.9970357,0.001083587,0.0001281871,0.0008224218,0.0006244388,0.0003054929],"domain_scores_gemma":[0.9757699,0.02003881,0.001276824,0.001631977,0.0007410797,0.0005413903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003551685,0.0003626236,0.001849073,0.001204875,0.0002077084,0.0002832677,0.0006759809,0.4947373,0.007068923,0.3868216,0.014164,0.09226955],"study_design_scores_gemma":[0.00007635721,0.000133693,0.0004159016,0.00009465976,0.00004033412,0.0001842596,0.0001903993,0.4527255,0.002010696,0.5406535,0.003419907,0.00005483186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07378812,0.002945693,0.9044933,0.004069127,0.0001706571,0.0001803969,0.0006181566,0.0006165282,0.01311804],"genre_scores_gemma":[0.4771316,0.003827413,0.5039012,0.001774027,0.0008344713,0.0006688366,0.002067529,0.0007451765,0.009049795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004627734,"threshold_uncertainty_score":0.01913631,"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."}}