{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004249939,0.001757284,0.0009382076,0.0006810237,0.002585796,0.002852106,0.004531374,0.00287888,0.03718839],"category_scores_gemma":[0.001741293,0.002537905,0.002684091,0.002008871,0.004338813,0.002581465,0.003704981,0.002733289,0.001163494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002613958,"about_ca_system_score_gemma":0.002293734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00138786,"about_ca_topic_score_gemma":0.001423584,"domain_scores_codex":[0.9856368,0.0005814577,0.003627466,0.002827807,0.00388819,0.003438267],"domain_scores_gemma":[0.9847233,0.003436014,0.004726941,0.005210388,0.0003657435,0.001537574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.003036692,0.0007997321,0.00005725541,0.002867161,0.002779694,0.001201754,0.005957418,0.0009470996,0.006054475,0.9480652,0.02645088,0.001782685],"study_design_scores_gemma":[0.004252803,0.002236327,0.0001895638,0.003349749,0.002817819,0.003249493,0.00352572,0.4304501,0.5432203,0.001818444,0.002226355,0.002663272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8419358,0.0009503352,0.003375131,0.0007361821,0.002994713,0.000148229,0.0008848157,0.0003279058,0.1486469],"genre_scores_gemma":[0.9803562,0.001311918,0.01279737,0.00087027,0.001628077,0.001034977,0.0006593331,0.001016652,0.0003252566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9462467,"threshold_uncertainty_score":0.9996142,"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."}}