{"id":"W2402809063","doi":"","title":"Cyclic and Negacyclic codes of length 2 m over finite fields.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007877537,0.0004162228,0.0005007861,0.001214405,0.001229356,0.001713338,0.0006032978,0.00109877,0.006368399],"category_scores_gemma":[0.006569479,0.0003418175,0.0003294802,0.001074035,0.002164933,0.002146051,0.001685803,0.001374456,0.0008121711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001171296,"about_ca_system_score_gemma":0.001647933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00122829,"about_ca_topic_score_gemma":0.001826803,"domain_scores_codex":[0.9989367,0.0002801723,0.00005924128,0.0001634184,0.0002996376,0.0002609486],"domain_scores_gemma":[0.9947639,0.002835259,0.0008009209,0.0007898879,0.0004405786,0.0003695502],"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.0003291037,0.00007854171,0.001694393,0.0001032726,0.00001525481,0.0006033858,0.0003913252,0.00613814,0.003738525,0.9635751,0.006488354,0.01684463],"study_design_scores_gemma":[0.00007913768,0.0001101228,0.001652294,0.0001023646,0.00001955683,0.0008773743,0.0002003747,0.02232593,0.003616959,0.954846,0.01612212,0.0000478896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7043579,0.004639206,0.07894668,0.00535137,0.0006858018,0.0001407231,0.001740086,0.0004321086,0.2037061],"genre_scores_gemma":[0.9740074,0.0006166786,0.00720707,0.0003460817,0.0003397446,0.00006115106,0.0003863104,0.00004004811,0.01699552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006368399,"threshold_uncertainty_score":0.02130443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01746650968873347,"score_gpt":0.2408639349457849,"score_spread":0.2233974252570514,"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."}}