{"id":"W1968759207","doi":"10.1016/j.jcta.2006.11.005","title":"Maximum distance separable codes and arcs in projective spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Projective test; Separable space; Combinatorics; Discrete mathematics; Pure mathematics; 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.001418543,0.0001378917,0.0002912332,0.0001953664,0.0001118415,0.0002164851,0.0004393311,0.00005548695,0.000006238409],"category_scores_gemma":[0.00007989986,0.000114848,0.00008122354,0.0004642193,0.0001797862,0.0009617998,0.00009961423,0.0002246937,6.469449e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003679435,"about_ca_system_score_gemma":0.00007103398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001174152,"about_ca_topic_score_gemma":0.0000111538,"domain_scores_codex":[0.9987506,0.00030481,0.0003398757,0.000159306,0.0002315824,0.0002137858],"domain_scores_gemma":[0.9990563,0.0002946773,0.0002823504,0.0001849099,0.0001280564,0.00005367249],"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.0006165018,0.0001112677,0.001907367,0.00001286358,0.0000175746,0.00005202249,0.0006213833,0.00002718087,0.0003185368,0.9950433,0.0001367171,0.001135228],"study_design_scores_gemma":[0.0008388555,0.0004580743,0.001478207,0.00007054517,0.000007996781,0.00009733955,0.0002683481,0.00003329949,0.001682251,0.9869483,0.007979973,0.0001368791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.929405,0.002226672,0.05434254,0.0006911447,0.003636455,0.0002327895,0.000004082271,0.00006272538,0.009398555],"genre_scores_gemma":[0.9974374,0.00006405151,0.002170884,0.00002508845,0.0002026416,0.000003298567,1.995454e-7,0.000006702317,0.00008977713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06803232,"threshold_uncertainty_score":0.4683366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004965791969250566,"score_gpt":0.2156267922402884,"score_spread":0.2106610002710379,"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."}}