{"id":"W2022705034","doi":"10.1155/2007/23408","title":"On Polynomials of the Form<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"E1\"><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mi>r</mml:mi></mml:msup><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>q</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>/</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>","year":2007,"lang":"lv","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; 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":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.01293341,0.003989774,0.001641317,0.003895367,0.007207983,0.009326895,0.01448337,0.008910487,0.8134551],"category_scores_gemma":[0.0114491,0.007725573,0.009361506,0.006549969,0.01092801,0.007496397,0.01053243,0.007724826,0.005531538],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083207,"about_ca_system_score_gemma":0.00727682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004545972,"about_ca_topic_score_gemma":0.003975383,"domain_scores_codex":[0.9573148,0.00252203,0.009373786,0.00699723,0.01381757,0.009974507],"domain_scores_gemma":[0.9635679,0.01063696,0.0113478,0.007166938,0.001441287,0.00583917],"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.004275159,0.001576933,0.00003481948,0.003309763,0.005893833,0.004095671,0.005293716,0.002958441,0.004591886,0.494313,0.4683397,0.005317137],"study_design_scores_gemma":[0.006811781,0.007327941,0.000169438,0.006471542,0.006173073,0.01318164,0.008304548,0.02108493,0.910465,0.005538529,0.007447729,0.007023868],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2646925,0.003731053,0.006193665,0.002974385,0.009405326,0.0001903544,0.001274596,0.0008142894,0.7107238],"genre_scores_gemma":[0.9606906,0.004656337,0.01131397,0.005229423,0.007993363,0.003849437,0.002075486,0.003224862,0.0009665181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9058731,"threshold_uncertainty_score":0.998351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02183615666117088,"score_gpt":0.2576651709614648,"score_spread":0.2358290143002939,"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."}}