{"id":"W2953301595","doi":"10.4153/cmb-2011-008-5","title":"Recurrence Relations for Strongly <i>q</i>-Log-Convex Polynomials","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Recurrence relation; Wilson polynomials; Difference polynomials; Combinatorics; Convexity; Discrete orthogonal polynomials; Bessel function; Orthogonal polynomials; Classical orthogonal polynomials; Pure mathematics; Jacobi polynomials; Regular polygon; Bessel polynomials; Discrete mathematics; Mathematical analysis; Geometry","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007826905,0.0003733905,0.0006348017,0.000207077,0.0002951761,0.00005645348,0.0006076758,0.0002706678,0.01140355],"category_scores_gemma":[0.005815804,0.0003662228,0.0002178759,0.0002280841,0.0002080248,0.00009055161,0.00006234067,0.0002929696,0.004991889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003056894,"about_ca_system_score_gemma":0.0003551926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001779456,"about_ca_topic_score_gemma":0.0003660583,"domain_scores_codex":[0.9974163,0.00008419682,0.0008559155,0.0004616515,0.0002805259,0.0009014205],"domain_scores_gemma":[0.996146,0.001671709,0.0002675285,0.0008451714,0.0002383508,0.0008312477],"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.00001557075,0.0001270232,0.00002219407,0.0001788327,0.00003719691,0.000009963774,0.0008047888,7.221988e-7,0.00001946306,0.9591918,0.03918475,0.0004077104],"study_design_scores_gemma":[0.0005498502,0.0001114534,0.00002170714,0.0001501438,0.00008790736,0.00002260801,0.0002438688,0.0001943131,0.0004368935,0.9591686,0.03858416,0.000428507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07843918,0.0002734472,0.5221003,0.007001226,0.002485881,0.008350614,0.0005666679,0.001026457,0.3797562],"genre_scores_gemma":[0.5288754,0.000004678469,0.4596933,0.0004154925,0.0003215633,0.0007096676,0.0000201172,0.0002066807,0.009753146],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4504361,"threshold_uncertainty_score":0.999879,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07906784643624801,"score_gpt":0.2901964999402241,"score_spread":0.2111286535039761,"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."}}