{"id":"W2163288567","doi":"10.1016/j.disc.2009.12.006","title":"The number of irreducible polynomials of degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si115.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si116.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math> with given trace and constant terms","year":2010,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Degree (music); Combinatorics; TRACE (psycholinguistics); Constant (computer programming); Discrete mathematics; Physics; Computer science","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.001782019,0.0006650017,0.0008464451,0.002235105,0.002216395,0.003729664,0.001357877,0.001018884,0.02066394],"category_scores_gemma":[0.01217757,0.0003363342,0.0007282805,0.001805835,0.002855091,0.00412078,0.002001422,0.002151066,0.00459654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001840541,"about_ca_system_score_gemma":0.002214305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363409,"about_ca_topic_score_gemma":0.001298033,"domain_scores_codex":[0.9977062,0.0003481127,0.0001221794,0.0004233932,0.0006945672,0.0007055555],"domain_scores_gemma":[0.9915596,0.003711146,0.0008880583,0.001297105,0.00141007,0.001134056],"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.00188725,0.0002825627,0.01211555,0.0007215556,0.0001196124,0.0007381816,0.001057705,0.009773038,0.017728,0.799557,0.0330783,0.1229411],"study_design_scores_gemma":[0.0002407788,0.0004344153,0.01478721,0.0002653986,0.0002127201,0.003859287,0.0007497102,0.03847699,0.05350884,0.8216524,0.06559657,0.0002156513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7108335,0.001283482,0.1014643,0.00631886,0.0008232776,0.0001811401,0.007471783,0.001485844,0.1701378],"genre_scores_gemma":[0.9391728,0.0008075273,0.01257967,0.0002394257,0.0004212011,0.00007925871,0.00309807,0.0002943892,0.04330769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02066394,"threshold_uncertainty_score":0.0691278,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01869653219332097,"score_gpt":0.2481750326238643,"score_spread":0.2294785004305433,"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."}}