{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894485,0.0002090222,0.0001785585,0.0003064421,0.0009703758,0.0005734732,0.001207742,0.00005523425,0.0004701611],"category_scores_gemma":[0.00005105224,0.0002182895,0.000125096,0.0004217048,0.0001090588,0.001783981,0.0005210965,0.0003700769,0.0001434279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001804643,"about_ca_system_score_gemma":0.00006059907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001909951,"about_ca_topic_score_gemma":0.000001726549,"domain_scores_codex":[0.9978188,0.0003584974,0.0004551974,0.0003008434,0.0007977764,0.0002689345],"domain_scores_gemma":[0.9986356,0.0003712449,0.0002679033,0.0004749473,0.0001404584,0.0001098061],"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.0004313299,0.0001192183,0.0002652298,0.00001763985,0.00009636293,0.00001097951,0.003902531,0.007554746,0.001433689,0.9717873,0.003950924,0.0104301],"study_design_scores_gemma":[0.00331242,0.001533598,0.002199466,0.00009673899,0.00005681434,0.0003751414,0.002089511,0.2155253,0.01965979,0.5861243,0.1674083,0.001618617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5012611,0.00007085833,0.4251609,0.003597357,0.005458731,0.0007427969,0.0002291226,0.0007969493,0.06268224],"genre_scores_gemma":[0.994606,0.00003284015,0.001419,0.003199593,0.00008985068,0.00009875264,0.00006901229,0.00001200252,0.0004729278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.493345,"threshold_uncertainty_score":0.8901588,"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."}}