{"id":"W4289655091","doi":"10.1109/isit50566.2022.9834891","title":"Maximum-Length Low-Density MDS Codes and Near Resolvable Designs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Separable space; Discrete mathematics; Code (set theory); Computer science; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009027666,0.0005599916,0.0004705291,0.001076662,0.0007488008,0.0009560156,0.0008024777,0.000877116,0.002190536],"category_scores_gemma":[0.005366405,0.0004745513,0.0004774516,0.0008356972,0.001802468,0.001492746,0.001587064,0.001986672,0.0004888216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009510258,"about_ca_system_score_gemma":0.0007193437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004010566,"about_ca_topic_score_gemma":0.0004399752,"domain_scores_codex":[0.9988328,0.000326553,0.00005071298,0.0001585843,0.0004792541,0.0001521116],"domain_scores_gemma":[0.9955551,0.002434173,0.0008645618,0.0005662748,0.0003448043,0.0002350904],"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.0001976385,0.00006671213,0.001038321,0.0001176381,0.00002437866,0.0001516472,0.0003782393,0.05898414,0.0189919,0.9005157,0.0006781535,0.01885557],"study_design_scores_gemma":[0.00009225323,0.0003470414,0.001038992,0.00007445119,0.00002201224,0.0005858849,0.0001328813,0.2427508,0.02782068,0.7218481,0.005215659,0.00007126643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4707609,0.0004649514,0.5101157,0.0005424495,0.0000381872,0.00007276332,0.0003148989,0.0002870665,0.01740325],"genre_scores_gemma":[0.8963395,0.0004230122,0.09555821,0.0001774784,0.00006703252,0.0001924686,0.0003008189,0.00006049027,0.006881069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002190536,"threshold_uncertainty_score":0.007328033,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01110291532929121,"score_gpt":0.2274738459194741,"score_spread":0.2163709305901829,"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."}}