{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":81,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":81,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"ec2f5dae5580","filters":{"venue":"Finite Fields and Their Applications"}},"results":[{"id":"W2119936466","doi":"10.1016/j.ffa.2010.10.002","title":"On constructing permutations of finite fields","year":2010,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of British Columbia; University of Lethbridge","funders":"","keywords":"Permutation (music); Mathematics; Combinatorics; Finite field; Set (abstract data type); Cyclic permutation; Permutation graph; Partial permutation; Discrete mathematics; Algebra over a field; Pure mathematics; Symmetric group; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.009601733691645173,"gpt":0.2273680458957087,"spread":0.2177663122040636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000125466,0.00008714108,0.0000993393,0.00009886639,0.0001922311,0.00004831787,0.0003073532,0.00009109172,0.00005472808],"category_scores_gemma":[0.00005409407,0.00007392836,0.000059624,0.0002851252,0.0000904302,0.00008217707,0.00007580768,0.0002525803,0.000008626822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001080829,"about_ca_system_score_gemma":0.00001903367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005884938,"about_ca_topic_score_gemma":0.0000155023,"domain_scores_codex":[0.999465,0.00001868634,0.0001550908,0.0001963857,0.00005468121,0.0001100804],"domain_scores_gemma":[0.9983398,0.001045354,0.0000732276,0.000435549,0.00005430419,0.00005176253],"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.000001923079,0.00003187843,0.0001765417,0.000006939439,0.000008925997,1.514912e-7,0.0007394163,0.00003551716,0.0004439366,0.9582627,0.00003754417,0.04025456],"study_design_scores_gemma":[0.00024783,0.0001314293,0.0006528342,0.00002193579,0.000009411666,0.00001064473,0.0002566689,0.00949751,0.003452882,0.9741365,0.01136931,0.0002130565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06115939,0.00002215776,0.9239047,0.0007184453,0.000105527,0.000141817,0.00002286216,0.00007003347,0.01385503],"genre_scores_gemma":[0.9921511,0.000009421061,0.007386195,0.0002915465,0.00004346643,0.0000665179,0.000005679522,0.000003869592,0.00004224169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9309916,"threshold_uncertainty_score":0.3014711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011798878","doi":"10.1006/ffta.2001.0332","title":"Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions","year":2002,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Divisibility rule; Mathematics; Boolean function; Correlation; Nonlinear system; Property (philosophy); Mathematical proof; Algebraic number; Domain (mathematical analysis); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009731903311448296,"gpt":0.1986584480474658,"spread":0.1889265447360175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001091399,0.0000666202,0.0001150913,0.0002021197,0.0001751883,0.00003492058,0.0001296196,0.00004428014,0.00005883761],"category_scores_gemma":[0.000004762575,0.00005737878,0.0000729831,0.0008324415,0.00005584776,0.00007969611,0.00005542754,0.00007729881,0.000003944412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003640054,"about_ca_system_score_gemma":0.000002936461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001027422,"about_ca_topic_score_gemma":0.00001427955,"domain_scores_codex":[0.9995179,0.00002375905,0.000150759,0.0001782215,0.0000456544,0.0000836691],"domain_scores_gemma":[0.9993848,0.0001593772,0.00006230362,0.0003296785,0.00002441922,0.00003945734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005740765,0.00009970424,0.002313529,0.00000886617,0.0002402339,2.28793e-7,0.002953699,0.0007254466,0.0003931086,0.9424388,0.0001439845,0.05067663],"study_design_scores_gemma":[0.0006746406,0.0003569606,0.08908357,0.00002924653,0.000433038,0.00001068795,0.0009376887,0.5286103,0.0004999823,0.3398089,0.03902097,0.0005340102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05296427,0.0005041505,0.941877,0.0004334262,0.00002284552,0.0001089419,0.00002105549,0.00003509803,0.00403322],"genre_scores_gemma":[0.99749,0.00009067811,0.002151614,0.00004978143,0.0000148922,0.00003374516,0.00001189521,0.000002171391,0.0001552298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9445257,"threshold_uncertainty_score":0.2339839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096776883","doi":"10.1016/j.ffa.2013.02.005","title":"Cyclotomy and permutation polynomials of large indices","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Mathematics; Discrete orthogonal polynomials; Finite field; Permutation graph; Difference polynomials; Partial permutation; Construct (python library); Cyclic permutation; Combinatorics; Classical orthogonal polynomials; Random permutation; Bit-reversal permutation; Discrete mathematics; Algebra over a field; Orthogonal polynomials; Pure mathematics; Symmetric group; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.006411509416715652,"gpt":0.2189252886992095,"spread":0.2125137792824938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009509184,0.00005500395,0.00007404885,0.0000643265,0.0001100641,0.00005379802,0.000145076,0.00004244181,0.00002766989],"category_scores_gemma":[0.000005922989,0.00004389328,0.00002158305,0.0001499903,0.00003666051,0.0001537517,0.00007656468,0.00004816625,0.000006211509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":9.191883e-7,"about_ca_system_score_gemma":0.000006223988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000016615,"about_ca_topic_score_gemma":0.000004351785,"domain_scores_codex":[0.9996376,0.00001868551,0.0001029808,0.000130802,0.00003096917,0.00007897033],"domain_scores_gemma":[0.9995092,0.0001881851,0.00005480753,0.0001818457,0.00002894672,0.00003706996],"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.000001746669,0.00005826169,0.00221785,0.00002704453,0.00001937147,7.220126e-8,0.003325196,0.00000222586,0.001455531,0.9110231,0.0001427543,0.08172681],"study_design_scores_gemma":[0.0006401116,0.0001935388,0.05912778,0.00003923703,0.00001771296,0.0000101272,0.0009315816,0.009811055,0.005199682,0.8865722,0.03708075,0.0003762295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3034481,0.0003322753,0.6913423,0.0008139819,0.00001983117,0.0002991708,0.00001654481,0.00004988243,0.00367794],"genre_scores_gemma":[0.9978611,0.00005172401,0.001707686,0.0001891186,0.00002005877,0.0001345549,0.000004045975,0.000002194399,0.00002951031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.694413,"threshold_uncertainty_score":0.1789916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032009701","doi":"10.1016/j.ffa.2008.12.001","title":"On permutation polynomials of prescribed shape","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Permutation (music); Monomial; Combinatorics; Cyclic permutation; Discrete mathematics; Symmetric group","retraction":null,"screen_n_in":null,"score":{"opus":0.01871378267860119,"gpt":0.2215874913020591,"spread":0.2028737086234579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007157842,0.00006126522,0.00007987568,0.00006872501,0.0001449075,0.00001417445,0.000209376,0.00004232545,0.0000246906],"category_scores_gemma":[0.00001211863,0.00005023438,0.00004216301,0.0001933793,0.00004807827,0.0000708748,0.00004449695,0.00005916703,0.000007765191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001773565,"about_ca_system_score_gemma":0.00001247164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000461023,"about_ca_topic_score_gemma":8.979167e-7,"domain_scores_codex":[0.9995964,0.00002161545,0.0001134956,0.0001489978,0.00004637317,0.00007308133],"domain_scores_gemma":[0.999324,0.0002869714,0.00004968118,0.0002763824,0.00003039893,0.00003251401],"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.00000923374,0.0000769522,0.0001289171,0.000008103458,0.00001222929,3.014444e-7,0.001767566,0.00003852202,0.0007813898,0.9547824,0.0002681263,0.04212621],"study_design_scores_gemma":[0.0008128701,0.0006347005,0.01244969,0.00005035047,0.00001531589,0.0000293732,0.0001665791,0.03607255,0.0156809,0.9086536,0.02495302,0.0004810062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.141443,0.0001119233,0.8512573,0.0004946484,0.00003127813,0.0001957411,0.00001610886,0.00006765275,0.00638233],"genre_scores_gemma":[0.9980254,0.00004018856,0.001550836,0.0002281438,0.0000239044,0.00006651537,0.000004817144,0.000002715419,0.00005745422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8565824,"threshold_uncertainty_score":0.2048499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027233581","doi":"10.1016/j.ffa.2013.07.004","title":"Existence and properties of k -normal elements over finite fields","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Element (criminal law); Prime (order theory); Divisor (algebraic geometry); Degree (music); Combinatorics; Basis (linear algebra); Discrete mathematics; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01772885708365074,"gpt":0.2119642068193767,"spread":0.194235349735726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009372693,0.00008892678,0.00009905671,0.00005715309,0.0001363521,0.00007515422,0.0002612973,0.0000595162,0.00004628992],"category_scores_gemma":[0.00001093552,0.00006687252,0.00003333705,0.0001682646,0.00007783787,0.000213017,0.0001775188,0.00009203026,0.000006683289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001385667,"about_ca_system_score_gemma":0.000009499919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003324359,"about_ca_topic_score_gemma":0.000006490259,"domain_scores_codex":[0.9994456,0.00002041063,0.0001651992,0.00018638,0.00005711502,0.0001252831],"domain_scores_gemma":[0.9993939,0.000126677,0.00006125973,0.0003200892,0.00004632599,0.00005170609],"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.00001123475,0.0001470573,0.005028778,0.0001260939,0.00005917885,3.425356e-7,0.004386447,0.00001291331,0.001550735,0.7962997,0.0003431004,0.1920345],"study_design_scores_gemma":[0.001130218,0.0006528894,0.02580505,0.0002233535,0.00003540038,0.00001543202,0.0008252588,0.05930455,0.01488876,0.8445942,0.05157821,0.0009466909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3253419,0.0007052521,0.6671084,0.000967691,0.00004909273,0.0004726403,0.00001267637,0.00007593008,0.005266464],"genre_scores_gemma":[0.9958963,0.000104639,0.003290797,0.0003551802,0.00002394994,0.0001821192,0.000001899033,0.000003165023,0.0001419495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6705545,"threshold_uncertainty_score":0.2726982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061818608","doi":"10.1016/j.ffa.2012.02.001","title":"Dickson polynomials over finite fields","year":2012,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Finite field; Permutation (music); Discrete orthogonal polynomials; Factorization; Difference polynomials; Classical orthogonal polynomials; Orthogonal polynomials; Algebra over a field; Wilson polynomials; Pure mathematics; Discrete mathematics; Combinatorics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01497961908001484,"gpt":0.2371934982047482,"spread":0.2222138791247333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002311901,0.0001307971,0.0001276347,0.00008808033,0.000252307,0.00009547248,0.0003886521,0.0001237959,0.0001042106],"category_scores_gemma":[0.00001891662,0.0001073763,0.00008202582,0.0003035493,0.00004594204,0.000267623,0.0001799885,0.0001671185,0.0000474677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000434706,"about_ca_system_score_gemma":0.00001207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001463615,"about_ca_topic_score_gemma":0.000005169933,"domain_scores_codex":[0.9992508,0.00003903141,0.0001604582,0.0002186309,0.00006674863,0.0002643563],"domain_scores_gemma":[0.9986941,0.0005472975,0.00006008361,0.0005453742,0.00002226499,0.0001308572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006805659,0.0001330592,0.002498247,0.00001561628,0.00003321529,2.801591e-7,0.002438776,0.00001486922,0.0001589924,0.8811672,0.001777674,0.1117553],"study_design_scores_gemma":[0.0005038659,0.0001539218,0.01031001,0.00003370341,0.00002660739,0.00001213201,0.0001592291,0.005172967,0.002047904,0.2535999,0.727326,0.0006538026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01088927,0.0007005053,0.9757537,0.001068601,0.0001566657,0.0001958244,0.00001913692,0.000139415,0.01107689],"genre_scores_gemma":[0.9959759,0.00008936531,0.002017732,0.001249495,0.0002583487,0.0001420098,0.00000822381,0.000006787689,0.0002521367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9850866,"threshold_uncertainty_score":0.4378679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963971814","doi":"10.1016/j.ffa.2014.02.006","title":"On the inverses of some classes of permutations of finite fields","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Class (philosophy); Algebra over a field; Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01510049709283546,"gpt":0.2219501027763184,"spread":0.206849605683483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001744167,0.00006872163,0.0001208606,0.00008227371,0.00009386328,0.00001220302,0.0003541101,0.00005511677,0.00002285718],"category_scores_gemma":[0.00007729868,0.00004599403,0.00007296118,0.0002763638,0.0001070479,0.00006445602,0.00007315515,0.00008818573,0.000002001737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001001295,"about_ca_system_score_gemma":0.00001566272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001104597,"about_ca_topic_score_gemma":0.000006293722,"domain_scores_codex":[0.9995062,0.0000504446,0.0001842859,0.0001217558,0.00006633312,0.00007100243],"domain_scores_gemma":[0.9970853,0.002250753,0.0001260211,0.0004493032,0.00006552857,0.000023084],"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.00000318947,0.00005094599,0.0001152295,0.00002026007,0.0000146057,1.42251e-8,0.0008920131,0.0001705519,0.0002208162,0.9925535,0.000112701,0.005846221],"study_design_scores_gemma":[0.0001337386,0.0002240127,0.0009523924,0.00003972589,0.00001198727,5.256564e-7,0.0002241907,0.01104603,0.007583516,0.9750093,0.004687341,0.00008720951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07145831,0.00007329065,0.9210679,0.001530239,0.0000360518,0.000167831,0.00003372671,0.00002317453,0.005609471],"genre_scores_gemma":[0.9987828,0.00004430858,0.000740072,0.0003335336,0.00001816177,0.00004624851,0.00000321668,0.000002659277,0.00002906049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9273244,"threshold_uncertainty_score":0.1875582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082081063","doi":"10.1016/j.ffa.2014.10.008","title":"A survey of some recent bit-parallel<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">GF</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>multipliers","year":2014,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Finite field; Quadratic equation; Mathematics; Generalization; Polynomial; Multiplication (music); Field (mathematics); Discrete mathematics; Arithmetic; Algorithm; Combinatorics; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01790630992802925,"gpt":0.2311894022526141,"spread":0.2132830923245848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.002905515,0.001246756,0.0005862053,0.0008870377,0.002578641,0.002076454,0.003734244,0.003219816,0.06902523],"category_scores_gemma":[0.001410023,0.002157638,0.002064819,0.002397817,0.002246646,0.001686119,0.002919273,0.002408801,0.001448508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001794152,"about_ca_system_score_gemma":0.001609244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003840072,"about_ca_topic_score_gemma":0.00236635,"domain_scores_codex":[0.9885876,0.0007722696,0.002591721,0.002697307,0.002412601,0.002938522],"domain_scores_gemma":[0.9884145,0.003543654,0.002544217,0.003542913,0.0003982725,0.001556491],"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.001004923,0.0006969356,0.00005884739,0.001143793,0.002040361,0.0003135411,0.003568167,0.002844758,0.0009030791,0.8795236,0.09619875,0.01170327],"study_design_scores_gemma":[0.004044719,0.003343395,0.0006793707,0.001599583,0.001919049,0.001297006,0.002889163,0.2052913,0.7548898,0.005935482,0.01467102,0.003440057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.721612,0.004943013,0.02593763,0.003087326,0.003800459,0.0002498241,0.002214832,0.0006613654,0.2374935],"genre_scores_gemma":[0.9824897,0.004273727,0.005064835,0.001800051,0.001704644,0.002163174,0.001712856,0.0006308245,0.0001602093],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8735881,"threshold_uncertainty_score":0.9998927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2392885651","doi":"10.1016/j.ffa.2017.01.006","title":"A note on inverses of cyclotomic mapping permutation polynomials over finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Finite field; Cyclotomic polynomial; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Polynomial","retraction":null,"screen_n_in":null,"score":{"opus":0.02258834622883974,"gpt":0.2630967104058184,"spread":0.2405083641769787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000163423,0.0001121681,0.0001426896,0.0001161193,0.000447007,0.0001380683,0.0005337365,0.0001028325,0.00002392682],"category_scores_gemma":[0.00005800298,0.00009726705,0.00008329822,0.0001080402,0.00007238279,0.0001884827,0.0001582639,0.0001305666,0.00001153198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000500055,"about_ca_system_score_gemma":0.00002212879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004248244,"about_ca_topic_score_gemma":0.00001746168,"domain_scores_codex":[0.9993486,0.0000287792,0.0001788351,0.0002463251,0.00006847391,0.0001289835],"domain_scores_gemma":[0.9984602,0.0005010633,0.000182021,0.0007701108,0.00003647819,0.00005014534],"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.00004234559,0.0001708671,0.002844627,0.00007715842,0.00007247355,0.000001775015,0.007467441,0.0004430289,0.002004199,0.8125029,0.0005054642,0.1738678],"study_design_scores_gemma":[0.001781772,0.0005447097,0.05740514,0.0003102589,0.00004595802,0.000009608838,0.0003596613,0.1037962,0.01191554,0.7442705,0.07853086,0.001029812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08789494,0.00005518158,0.8997267,0.00146025,0.0001170632,0.0002897726,0.000034541,0.0000681442,0.01035341],"genre_scores_gemma":[0.9977545,0.00005751005,0.001448254,0.0004944872,0.00007275517,0.00008008117,0.000005804106,0.000005245859,0.00008134494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9098596,"threshold_uncertainty_score":0.3966435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000470138","doi":"10.1016/j.ffa.2008.12.003","title":"On inverse permutation polynomials","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Inverse; Finite field; Polynomial; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01837467303147693,"gpt":0.2194095155721322,"spread":0.2010348425406553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006889219,0.0000675249,0.00006288228,0.0000716084,0.0002764469,0.00002882051,0.0001930233,0.0000449755,0.00002126907],"category_scores_gemma":[0.0000101841,0.00005576891,0.00003802399,0.0002065694,0.00004356264,0.00008988328,0.00004481184,0.00007596524,0.00004437924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003132175,"about_ca_system_score_gemma":0.00001281913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004734499,"about_ca_topic_score_gemma":0.00000266387,"domain_scores_codex":[0.999595,0.00002135907,0.00008375862,0.0001720248,0.0000412186,0.000086638],"domain_scores_gemma":[0.9993759,0.000240868,0.00003125215,0.0002853269,0.00001999546,0.00004666985],"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.000004544041,0.00004675043,0.00009901688,0.000003133362,0.000008019653,7.76943e-7,0.001570191,0.00004513995,0.0001570437,0.9713881,0.0009483072,0.02572896],"study_design_scores_gemma":[0.0005071282,0.0002717246,0.003291986,0.00001788447,0.000007099856,0.00003754245,0.0001417327,0.01460306,0.002160445,0.9002213,0.07835282,0.0003872219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05842571,0.00004814897,0.9309022,0.0008913045,0.00004245491,0.0001496498,0.000007877185,0.0001104775,0.009422123],"genre_scores_gemma":[0.9968984,0.00004590153,0.001843334,0.0009330831,0.0000419786,0.00008527242,0.000005482305,0.000003045446,0.0001435668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9384726,"threshold_uncertainty_score":0.227419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992704551","doi":"10.1016/j.ffa.2007.11.001","title":"Near bent functions on a hyperplane","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Hyperplane; Bent molecular geometry; Mathematics; TRACE (psycholinguistics); Combinatorics; Function (biology); Bent function; Boolean function; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01656111413771914,"gpt":0.2023097891208085,"spread":0.1857486749830894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005393752,0.00007675365,0.00006783791,0.00005003036,0.0005162872,0.00004538261,0.0002123427,0.00004524007,0.00003210526],"category_scores_gemma":[0.000004799257,0.00006125931,0.00004329807,0.0002468794,0.00005606952,0.00006003026,0.00005794172,0.0001104198,0.00008674484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002703735,"about_ca_system_score_gemma":0.00001443258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005952551,"about_ca_topic_score_gemma":0.000002787045,"domain_scores_codex":[0.999548,0.00001546815,0.00008471103,0.000196398,0.00004831646,0.0001071707],"domain_scores_gemma":[0.9993244,0.0001865455,0.00002366621,0.0003860495,0.00001994299,0.00005941778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009527332,0.000190144,0.000562017,0.00000604724,0.00002667372,0.000002193427,0.001597603,0.0001514228,0.00007687622,0.9239805,0.002571062,0.07082594],"study_design_scores_gemma":[0.0003620072,0.0003731079,0.00490072,0.00001622425,0.000008780257,0.00007941665,0.0000995982,0.01119561,0.0002979806,0.1098302,0.8724963,0.000340031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03089616,0.0001176846,0.9511971,0.001454069,0.00006447892,0.0001685964,0.00002072795,0.000164607,0.01591651],"genre_scores_gemma":[0.9968411,0.00005468884,0.001899296,0.0006938692,0.00005514717,0.0001278623,0.000009986171,0.000003595235,0.000314425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9659449,"threshold_uncertainty_score":0.3970916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981349468","doi":"10.1016/j.ffa.2005.05.001","title":"Algebraic curves and cryptography","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Cryptography; Mathematics; Elliptic curve cryptography; Hyperelliptic curve cryptography; Elliptic curve; Counting points on elliptic curves; Algebraic number; Post-quantum cryptography; Finite field; Public-key cryptography; Key size; Key (lock); Algebra over a field; Algebraic curve; Logarithm; Discrete mathematics; Theoretical computer science; Computer science; Algorithm; Pure mathematics; Schoof's algorithm; Encryption; Computer security; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.006436452121446332,"gpt":0.2053869388200872,"spread":0.1989504866986408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007648287,0.00008890119,0.00008652679,0.00009338521,0.0001888362,0.0000703897,0.0002108416,0.00005219287,0.00001383997],"category_scores_gemma":[0.000004526706,0.00006853075,0.00004195009,0.0003365244,0.00007311169,0.0001391664,0.00009885097,0.0001006425,0.000008126862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001119188,"about_ca_system_score_gemma":0.000007726264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007609895,"about_ca_topic_score_gemma":0.00001473109,"domain_scores_codex":[0.9994786,0.00001467481,0.0001075609,0.0002245647,0.00004855285,0.0001260452],"domain_scores_gemma":[0.9994132,0.0001577316,0.00003044242,0.0002989891,0.00002373393,0.00007592559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001020846,0.00007186888,0.0007385894,0.00004852391,0.00002782714,3.889937e-7,0.000679483,0.000005342938,0.00008781123,0.6751145,0.001267457,0.3219572],"study_design_scores_gemma":[0.0006034971,0.0001490106,0.02097511,0.0001266052,0.0000288877,0.00006120945,0.0001271897,0.01091925,0.001097472,0.3886649,0.5766162,0.0006306955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004171972,0.009365083,0.9739497,0.008674137,0.00002123717,0.0002301054,0.000009163557,0.0001137489,0.003464872],"genre_scores_gemma":[0.973905,0.003613538,0.02000985,0.002199948,0.00007824081,0.0001434078,0.000005548198,0.000005030913,0.00003942355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9697331,"threshold_uncertainty_score":0.2794603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2794445524","doi":"10.1016/j.ffa.2018.10.002","title":"On isogeny graphs of supersingular elliptic curves over finite fields","year":2018,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Supersingular elliptic curve; Mathematics; Finite field; Elliptic curve; Schoof's algorithm; Invariant (physics); Pure mathematics; Discrete mathematics; Quarter period; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01006695059452305,"gpt":0.2280939819140158,"spread":0.2180270313194928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001111706,0.0001238978,0.0001465758,0.0001405985,0.0001991903,0.00003775235,0.0003871694,0.0001066626,0.00006814997],"category_scores_gemma":[0.00002247836,0.00009712297,0.00009974949,0.0005091663,0.0001640843,0.0000849844,0.00009323961,0.0001396933,0.00001632888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002364833,"about_ca_system_score_gemma":0.00001871137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003170867,"about_ca_topic_score_gemma":0.00001796784,"domain_scores_codex":[0.9992365,0.0000282937,0.0001854263,0.0002780683,0.0001021535,0.000169573],"domain_scores_gemma":[0.9987504,0.0004504128,0.0000610071,0.000596147,0.00007379509,0.00006823784],"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.00001466639,0.000301615,0.00096259,0.0001512016,0.00009729325,0.000001480213,0.002458997,0.00005141239,0.0004929654,0.9633962,0.002766724,0.02930488],"study_design_scores_gemma":[0.001027753,0.001577609,0.01144704,0.0005428561,0.00007686361,0.00001663356,0.0002013969,0.03051353,0.01301617,0.8832954,0.05737894,0.0009058157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04029793,0.001701882,0.9505438,0.001545035,0.0001249782,0.0003390902,0.0000326249,0.0000786137,0.005336049],"genre_scores_gemma":[0.9959096,0.0005605595,0.002131078,0.001202989,0.00005696784,0.00004813274,0.000007524361,0.000006090033,0.00007703539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9556117,"threshold_uncertainty_score":0.396056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169627913","doi":"10.1016/j.ffa.2006.09.004","title":"On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields","year":2006,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Monomial; Mathematics; Reciprocal; Parity (physics); Finite field; Polynomial; Pure mathematics; Irreducible polynomial; Binary number; Discrete mathematics; Combinatorics; Arithmetic; Mathematical analysis; Matrix polynomial","retraction":null,"screen_n_in":null,"score":{"opus":0.01233122792955884,"gpt":0.2302576990481771,"spread":0.2179264711186182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002003184,0.00009709912,0.0001492999,0.00003605821,0.0001322327,0.00001808184,0.0005279577,0.00009169179,0.00005384371],"category_scores_gemma":[0.00002706069,0.00005341357,0.0001298024,0.0003729964,0.0001118415,0.00004854493,0.0001374636,0.0001405081,0.000001439814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002657885,"about_ca_system_score_gemma":0.0000262362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001281757,"about_ca_topic_score_gemma":0.00001771364,"domain_scores_codex":[0.9993284,0.00006165839,0.0002426801,0.0001649409,0.00009767791,0.0001046188],"domain_scores_gemma":[0.9977707,0.00134121,0.0001710489,0.000648509,0.00004808457,0.00002047186],"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.000007134308,0.0001878088,0.006939673,0.00002037692,0.000028577,2.839854e-8,0.0008120844,0.00008673645,0.0002268451,0.9898241,0.0004504716,0.001416225],"study_design_scores_gemma":[0.0003333228,0.0001309447,0.06158879,0.00007076281,0.00003774897,0.000001606772,0.0001648395,0.00277968,0.03909043,0.8871645,0.008395975,0.0002413849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8129916,0.00006842693,0.1736612,0.0009478916,0.00008899298,0.0003484865,0.0000785616,0.00003467155,0.01178023],"genre_scores_gemma":[0.9993934,0.00001262814,0.0003371263,0.000127317,0.00002615017,0.0000357321,0.000002410825,0.000003523124,0.00006170321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1864019,"threshold_uncertainty_score":0.2178142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069444685","doi":"10.1016/s1071-5797(03)00007-8","title":"Homogeneous weights and exponential sums","year":2003,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Sanitarium Association; National Science Foundation","keywords":"Mathematics; Homogeneous; Exponential function; Exponential sum; Algebraic number; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.008421389931006997,"gpt":0.195682882193137,"spread":0.18726149226213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009173313,0.00007891758,0.00007110911,0.0000530557,0.0002384554,0.00008428876,0.0001600974,0.00005154691,0.00002032733],"category_scores_gemma":[0.000005368047,0.00006383878,0.00003141845,0.0001671944,0.00004596345,0.00007209121,0.00005772595,0.00007146583,0.000007819286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001366284,"about_ca_system_score_gemma":0.000008593252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003240846,"about_ca_topic_score_gemma":0.000004145395,"domain_scores_codex":[0.9995285,0.00002904269,0.00008366254,0.0002105164,0.00003561002,0.0001127237],"domain_scores_gemma":[0.9994544,0.0001446066,0.00002479618,0.0002947201,0.00001746559,0.00006405341],"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.000001057165,0.00002455399,0.0001206507,0.000003762792,0.00000824951,4.606068e-7,0.0003862444,9.775613e-7,0.000115181,0.9687496,0.00004517954,0.03054409],"study_design_scores_gemma":[0.0002007866,0.00006480743,0.0004277795,0.000006910546,0.000007049347,0.0000370257,0.00006000162,0.001127543,0.002194573,0.7818564,0.2138208,0.0001964119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03205986,0.0006988699,0.9596441,0.0002762131,0.00005125579,0.0001370248,0.000006011008,0.00007320473,0.00705346],"genre_scores_gemma":[0.993842,0.0001322007,0.005608473,0.0001923342,0.00003236469,0.00007919794,0.00000242024,0.000003571026,0.0001074148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9617822,"threshold_uncertainty_score":0.260327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043992837","doi":"10.1016/j.ffa.2008.01.003","title":"Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Enumeration; Kronecker delta; Finite field; Class (philosophy); Combinatorics; Elliptic curve; Field (mathematics); Pure mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0165081434547319,"gpt":0.2183094235102167,"spread":0.2018012800554848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009828088,0.00008177917,0.0001121347,0.00006418625,0.0001850733,0.00002590203,0.000167799,0.0000288193,0.000007010059],"category_scores_gemma":[0.000006371298,0.00006282337,0.00002169439,0.0002580567,0.00007199591,0.0001205343,0.00005882763,0.00005801773,0.000001677179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001591431,"about_ca_system_score_gemma":0.00001778212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001698928,"about_ca_topic_score_gemma":0.000003752071,"domain_scores_codex":[0.9994833,0.00002573423,0.0001286806,0.0002080127,0.0000592196,0.00009500051],"domain_scores_gemma":[0.9993738,0.0001594781,0.00006289545,0.00031243,0.00004471991,0.00004666352],"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.00007103724,0.0005940189,0.005279608,0.0002543151,0.0001283584,0.000001897124,0.01063167,0.0003818409,0.008680541,0.9005025,0.000993858,0.07248037],"study_design_scores_gemma":[0.0126475,0.005788343,0.06325115,0.002498921,0.0004077195,0.0007561565,0.002091082,0.16485,0.2509455,0.3449304,0.1465167,0.0053166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.125764,0.0009880917,0.8714187,0.0003812933,0.00001740432,0.0002868167,0.00001338576,0.00004472987,0.001085536],"genre_scores_gemma":[0.9969041,0.0003735403,0.002357149,0.0001730003,0.00002041167,0.00009959724,0.000006953359,0.000003782062,0.00006147231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8711401,"threshold_uncertainty_score":0.2561862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571232930","doi":"10.1016/j.ffa.2016.11.015","title":"Lee weights of cyclic self-dual codes over Galois rings of characteristic p2","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; Ministry of Education","keywords":"Mathematics; Dual (grammatical number); Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01056550544855028,"gpt":0.2318493941708268,"spread":0.2212838887222766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000122424,0.00008504396,0.0001501307,0.00006217232,0.0002529436,0.00006104933,0.000494755,0.00005920626,0.00001743207],"category_scores_gemma":[0.00001288397,0.00006915479,0.00006488334,0.00008307664,0.00009495688,0.0001409365,0.0001789126,0.00007957795,0.000003492076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000194983,"about_ca_system_score_gemma":0.00001246397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002635885,"about_ca_topic_score_gemma":0.000006734405,"domain_scores_codex":[0.9994784,0.00001624365,0.0001669157,0.0001789734,0.0000598725,0.00009959543],"domain_scores_gemma":[0.9987954,0.0001960752,0.0001978658,0.0007235219,0.00004566019,0.00004150806],"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.000008237664,0.0001465293,0.005311828,0.00006166263,0.00005663633,4.189623e-7,0.00180422,8.84426e-7,0.002830046,0.9700456,0.00005305667,0.01968087],"study_design_scores_gemma":[0.0008070082,0.0003009779,0.3078094,0.0001441569,0.00006299138,0.0000121981,0.00008251378,0.006559628,0.02412113,0.6217694,0.03780157,0.0005289859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6314146,0.000114894,0.3622257,0.0003540378,0.00006854343,0.0002180442,0.00006523193,0.00007376041,0.005465263],"genre_scores_gemma":[0.9976497,0.00007375857,0.002101316,0.00004698892,0.00003968109,0.00004134303,0.000003848778,0.000003683365,0.00003967735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3662351,"threshold_uncertainty_score":0.282005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028343756","doi":"10.1016/j.ffa.2008.07.002","title":"On ternary Kloosterman sums modulo 12","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Mathematics; Modulo; Ternary operation; Class (philosophy); Combinatorics; Discrete mathematics; Characterization (materials science); Arithmetic; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01683112379226085,"gpt":0.2086362918083391,"spread":0.1918051680160782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005795778,0.00009069381,0.00007755148,0.00006977525,0.0002912404,0.00003592665,0.0003510734,0.00005192494,0.00001926823],"category_scores_gemma":[0.000003672231,0.0000727885,0.00005051167,0.0001525348,0.0000502369,0.0000935304,0.0001024672,0.0001140397,0.00004023372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002539434,"about_ca_system_score_gemma":0.000008141411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004571283,"about_ca_topic_score_gemma":0.000002547055,"domain_scores_codex":[0.9994883,0.00001933085,0.00009335639,0.0002227568,0.00005416361,0.0001221031],"domain_scores_gemma":[0.9992337,0.0001865703,0.00003119832,0.0004725778,0.00001519678,0.00006073217],"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.00000729995,0.0001078529,0.0005452017,0.000006802647,0.00001650817,0.00000351128,0.001333831,0.00003583089,0.000101777,0.9351552,0.00107864,0.06160759],"study_design_scores_gemma":[0.0005320808,0.000394164,0.00949563,0.00003553998,0.000007727823,0.00009092082,0.00005458776,0.01872213,0.001270432,0.8172346,0.1516395,0.0005226848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0424348,0.0001004124,0.9360605,0.0008707801,0.00006010071,0.0001698054,0.00001153807,0.0001509844,0.02014105],"genre_scores_gemma":[0.9972097,0.00006476272,0.001283676,0.0009127927,0.00005892302,0.00009707507,0.000005950821,0.000004618122,0.000362527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9547749,"threshold_uncertainty_score":0.2968229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993819992","doi":"10.1016/j.ffa.2014.10.009","title":"Weakness of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mn>6</mml:mn><mml:mo>⋅</mml:mo><mml:mn>1429</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn><mml:mo>⋅</mml:mo><mml:mn>3041</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math> for discrete logarithm cryptography","year":2014,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems; Consejo Nacional de Ciencia y Tecnología","keywords":"Discrete logarithm; Mathematics; Cryptography; Logarithm; Algorithm; Scroll; Finite field; Discrete mathematics; Bilinear interpolation; Security parameter; Degree (music); Computer science; Statistics; Public-key cryptography; Computer security; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01674343111415439,"gpt":0.235199984674554,"spread":0.2184565535603996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["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.008534542,0.004886013,0.001895256,0.003941927,0.008849794,0.009157203,0.01238584,0.01240709,0.8149587],"category_scores_gemma":[0.005496882,0.009881229,0.009772011,0.00776223,0.01000313,0.007488021,0.01108382,0.00863707,0.005271204],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008519373,"about_ca_system_score_gemma":0.007474287,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008501459,"about_ca_topic_score_gemma":0.007981901,"domain_scores_codex":[0.9581358,0.002553091,0.00885264,0.009179379,0.009952903,0.01132617],"domain_scores_gemma":[0.9621126,0.00907331,0.01013686,0.01113921,0.001289203,0.006248828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.006280922,0.001388063,0.00004422612,0.004403379,0.007105892,0.003335146,0.004970148,0.003339787,0.003809621,0.4590142,0.5006629,0.005645806],"study_design_scores_gemma":[0.009786752,0.006597516,0.000276836,0.004486235,0.007499629,0.008073716,0.00628362,0.06191953,0.8586994,0.0007216061,0.02722718,0.008427965],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1882749,0.006241672,0.01109993,0.003230568,0.009535103,0.0003397439,0.004603816,0.001488095,0.7751861],"genre_scores_gemma":[0.9390538,0.007919399,0.01220385,0.005309429,0.008196598,0.01134047,0.01006306,0.004532986,0.001380453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8548898,"threshold_uncertainty_score":0.9981524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115812217","doi":"10.1016/j.ffa.2005.10.004","title":"Optical orthogonal codes and arcs in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"italic\">PG</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2005,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simple (philosophy); Scroll; Algorithm; Discrete mathematics; Theology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01334859635631097,"gpt":0.222142416080965,"spread":0.208793819724654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.002067258,0.001332794,0.0007283771,0.0006514819,0.001910278,0.001563307,0.001869608,0.003089187,0.003190201],"category_scores_gemma":[0.0006168755,0.002058022,0.001416344,0.001377386,0.001403778,0.001180324,0.001372487,0.002475424,0.001302927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003507044,"about_ca_system_score_gemma":0.0006832489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001139768,"about_ca_topic_score_gemma":0.001471976,"domain_scores_codex":[0.9909474,0.0004064394,0.002415264,0.00219536,0.001560227,0.002475327],"domain_scores_gemma":[0.9928451,0.002271321,0.001264744,0.002122134,0.0002119737,0.001284683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007245786,0.0005696903,0.00006327623,0.001194331,0.001506027,0.0002834113,0.003326465,0.004592795,0.001746251,0.9708098,0.009051058,0.006132306],"study_design_scores_gemma":[0.00795089,0.00429274,0.0005608023,0.004491695,0.003755405,0.004110519,0.01147272,0.4350056,0.3433771,0.1379088,0.03959022,0.007483514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9657664,0.002978296,0.005210732,0.0009784313,0.001222977,0.0002431269,0.001515039,0.0004726259,0.02161239],"genre_scores_gemma":[0.9884972,0.002034941,0.001979516,0.001018135,0.002179748,0.0023242,0.001196813,0.0006389971,0.0001304742],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8329011,"threshold_uncertainty_score":0.9999423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000061862","doi":"10.1016/j.ffa.2011.09.003","title":"A generalization of the Hansen–Mullen conjecture on irreducible polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Conjecture; Finite field; Generalization; Degree (music); Field (mathematics); Combinatorics; TRACE (psycholinguistics); Order (exchange); Pure mathematics; Constant (computer programming); Zero (linguistics); Prime (order theory); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02334978394381537,"gpt":0.2211350390894615,"spread":0.1977852551456461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001276765,0.0001110647,0.0001158773,0.00007276848,0.0001933178,0.00003526819,0.0004649051,0.0001133546,0.00007862436],"category_scores_gemma":[0.00001758932,0.00007370197,0.00008964603,0.0003464662,0.00006388885,0.00007002057,0.00012146,0.0001272551,0.000005014197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003103511,"about_ca_system_score_gemma":0.00002295374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004297691,"about_ca_topic_score_gemma":0.0000200759,"domain_scores_codex":[0.9993557,0.00005454998,0.00016756,0.0002326231,0.00006763486,0.000121961],"domain_scores_gemma":[0.9989293,0.0002388734,0.00009982319,0.0006581274,0.00003398156,0.00003993509],"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.00001695991,0.0001215789,0.0006019831,0.00001910755,0.00003818559,2.108896e-7,0.004777673,0.0002081102,0.0004239315,0.9753504,0.0009699236,0.01747193],"study_design_scores_gemma":[0.001001845,0.0005646596,0.01239966,0.0001362369,0.00005532478,0.00001065945,0.000228556,0.01634878,0.04775205,0.8386531,0.08214315,0.0007059302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03343995,0.0001885156,0.9530397,0.001222458,0.0001709445,0.0003978568,0.00004212748,0.0000715585,0.01142688],"genre_scores_gemma":[0.9975105,0.00004785001,0.001164903,0.0009351682,0.00005917663,0.00008185214,0.000004574596,0.000005714035,0.0001902841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9640705,"threshold_uncertainty_score":0.3005479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962898640","doi":"10.1016/j.ffa.2019.01.003","title":"Further results on complete permutation monomials over finite fields","year":2019,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Monomial; Conjecture; Counterexample; Finite field; Modulo; Combinatorics; Prime (order theory); Permutation (music); Multiplicative function; Prime power; Multiplicative group; Discrete mathematics; Class (philosophy)","retraction":null,"screen_n_in":null,"score":{"opus":0.01851122005568274,"gpt":0.2354273677832029,"spread":0.2169161477275202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000200717,0.0001367003,0.0001401816,0.0001033529,0.0001567274,0.0001174352,0.0003636235,0.0001106459,0.00007938352],"category_scores_gemma":[0.00001794078,0.0001135043,0.00007874327,0.0002481263,0.00003043575,0.0001383695,0.00009878662,0.000170432,0.0001709227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005931085,"about_ca_system_score_gemma":0.00001403835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001366961,"about_ca_topic_score_gemma":0.00000862883,"domain_scores_codex":[0.9991344,0.00004890619,0.0002069453,0.0003668671,0.00007802134,0.000164895],"domain_scores_gemma":[0.9983181,0.0008433553,0.00008965115,0.0006516109,0.00003647617,0.00006078724],"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.00009470054,0.0001437116,0.0004386301,0.00002732171,0.00005597815,8.781657e-7,0.005225862,0.001533384,0.0004553108,0.9002365,0.001132768,0.09065498],"study_design_scores_gemma":[0.00216265,0.0008468218,0.01087359,0.00009747998,0.0000223297,0.000006469046,0.0003538179,0.1058816,0.001086218,0.524185,0.3535671,0.0009170002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06992225,0.00008793593,0.8957518,0.003585964,0.000187755,0.000621661,0.0001238174,0.0001844998,0.0295343],"genre_scores_gemma":[0.9969659,0.00003152353,0.001004845,0.001373585,0.00008298902,0.0001015556,0.00003257564,0.000007551286,0.0003994327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9270437,"threshold_uncertainty_score":0.4628569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969032791","doi":"10.1016/j.ffa.2005.08.004","title":"On Ritt's decomposition theorem in the case of finite fields","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Univariate; Generalization; Decomposition; Polynomial; Finite field; Factor theorem; Pure mathematics; Decomposition theorem; Discrete mathematics; Fundamental theorem; Mathematical analysis; Multivariate statistics; Statistics; Fixed-point theorem","retraction":null,"screen_n_in":null,"score":{"opus":0.01088814306967226,"gpt":0.2522877109278614,"spread":0.2413995678581891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002890322,0.00008540758,0.00008739655,0.00009633612,0.000151149,0.00004833218,0.0003492768,0.00006997657,0.00001973197],"category_scores_gemma":[0.00001312783,0.00005788531,0.00005472691,0.0003351608,0.00004712804,0.00009061648,0.00005495091,0.0001680769,0.000007151809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000319847,"about_ca_system_score_gemma":0.000007532862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000174299,"about_ca_topic_score_gemma":0.00008159952,"domain_scores_codex":[0.9994432,0.000073136,0.0001565669,0.0001747894,0.0000436545,0.0001086626],"domain_scores_gemma":[0.9982647,0.001179205,0.00005171869,0.0004558245,0.00002227922,0.00002626002],"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.000006184594,0.00009517097,0.00001789554,0.000005255195,0.000004861072,0.000003825681,0.001977989,0.0002697688,0.00001484473,0.8887507,0.00008069227,0.1087728],"study_design_scores_gemma":[0.0003451739,0.0002214529,0.0003760853,0.00003377851,0.000008128693,0.0001027537,0.0003685507,0.03364845,0.0007864037,0.9539749,0.009953092,0.0001812053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0795242,0.0001293902,0.907164,0.003342983,0.00002508549,0.0002507012,0.00001556073,0.00003705936,0.009511046],"genre_scores_gemma":[0.9970225,0.00003332122,0.001629652,0.001144664,0.0000462526,0.0001031121,0.000004705455,0.000002848511,0.00001290866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9174984,"threshold_uncertainty_score":0.2360494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004773548","doi":"10.1016/j.ffa.2005.05.008","title":"On the structure of uniform one-factorizations from starters in finite fields","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Factorization; Graph; Complete graph; Integer (computer science); Combinatorics; Construct (python library); Discrete mathematics; Existential quantification; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01245231511982949,"gpt":0.2086547568696053,"spread":0.1962024417497758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000651174,0.00009153534,0.00009735406,0.00008507077,0.0001302568,0.0000440454,0.0004033371,0.00008364088,0.0001061477],"category_scores_gemma":[0.00001839054,0.00006414545,0.00004179519,0.000374424,0.00004374506,0.00009925704,0.00006933926,0.0001898618,0.000004171233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005542337,"about_ca_system_score_gemma":0.00001664098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003356462,"about_ca_topic_score_gemma":0.0002704571,"domain_scores_codex":[0.9994511,0.00003096295,0.0001622461,0.0001794601,0.0000672407,0.0001089772],"domain_scores_gemma":[0.9984394,0.0009686545,0.00006115799,0.0004708257,0.00002655801,0.00003344048],"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.0000058088,0.00006513507,0.0003000475,0.00000360855,0.00001744558,7.519407e-8,0.002693678,0.00101019,0.0002752731,0.9671038,0.00007079527,0.02845418],"study_design_scores_gemma":[0.0002900476,0.0001067739,0.003148319,0.00004834897,0.000008398824,3.989693e-7,0.0002354048,0.02217806,0.00322637,0.9584522,0.01210538,0.0002003204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.112052,0.00005994388,0.8817404,0.003488314,0.00003800641,0.0002231274,0.0001346978,0.00003802071,0.002225475],"genre_scores_gemma":[0.9971621,0.00003665705,0.001932265,0.0007551544,0.00004610613,0.00002410498,0.00001956043,0.000003721831,0.00002030047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8851101,"threshold_uncertainty_score":0.2615775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605666455","doi":"10.1016/j.ffa.2017.03.010","title":"A note on character sums in finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Fondation Mathématique Jacques Hadamard","keywords":"Character (mathematics); Mathematics; Finite field; Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01970817639311891,"gpt":0.257624574949498,"spread":0.2379163985563791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000173371,0.0001136824,0.0001185091,0.00009913643,0.000396093,0.000230328,0.0006991163,0.000111649,0.00002404677],"category_scores_gemma":[0.00003453783,0.00009356029,0.00005873292,0.0001140211,0.00005434351,0.0001843297,0.0001863621,0.0002345999,0.00004159784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000394094,"about_ca_system_score_gemma":0.00001277827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002406299,"about_ca_topic_score_gemma":0.00006167984,"domain_scores_codex":[0.9993277,0.00002347485,0.0001353078,0.0002866542,0.00005641311,0.0001705001],"domain_scores_gemma":[0.9984798,0.000382429,0.00007865245,0.0009798623,0.0000214697,0.00005780655],"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.0000165073,0.0001265681,0.001535792,0.00001382098,0.00001182245,0.000003221119,0.001778664,0.00002769465,0.00007316041,0.7651603,0.0001761112,0.2310763],"study_design_scores_gemma":[0.000988205,0.0003252269,0.05814797,0.0001331923,0.000009763101,0.000006930351,0.00006033084,0.02636088,0.001303272,0.6660635,0.2459114,0.0006893164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02540954,0.00006131891,0.9425239,0.007350082,0.0001644125,0.000325535,0.00002381814,0.00009589797,0.02404551],"genre_scores_gemma":[0.9975498,0.000061274,0.0007958012,0.001132594,0.00009052776,0.0001536801,0.000005109375,0.00000491286,0.0002063571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9721402,"threshold_uncertainty_score":0.3815278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082176354","doi":"10.1016/j.ffa.2005.10.005","title":"On the distribution of irreducible trinomials over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi mathvariant=\"double-struck\">F</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Mathematics; Scroll; Distribution (mathematics); Discrete mathematics; Mathematical analysis; Theology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01850660484441803,"gpt":0.2341683424707793,"spread":0.2156617376263613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007073199,0.0002439606,0.0001463098,0.0001132893,0.0007548421,0.000355283,0.0009231429,0.0004069446,0.001870312],"category_scores_gemma":[0.00009135412,0.0002861705,0.0003728342,0.0005494592,0.0002734507,0.0003746704,0.0004527332,0.0004161959,0.0002172091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005856046,"about_ca_system_score_gemma":0.0001644475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001252743,"about_ca_topic_score_gemma":0.00006772496,"domain_scores_codex":[0.9980108,0.00008604409,0.0005024699,0.0005708695,0.0003575904,0.0004722419],"domain_scores_gemma":[0.9972107,0.0008937196,0.0004176445,0.001250145,0.00005503176,0.0001727931],"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.0001440776,0.0001377785,0.000005223025,0.00005895582,0.0001308853,0.000005527485,0.0007099165,0.0003819503,0.0005150898,0.9835191,0.009734412,0.004657071],"study_design_scores_gemma":[0.002300602,0.001089423,0.0004272732,0.0004511374,0.0003603644,0.0002090021,0.0006705653,0.2935648,0.5743673,0.05730731,0.06801433,0.001237799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8785187,0.0002933932,0.07606547,0.001649005,0.0003801032,0.0001045308,0.0003598613,0.0001562463,0.04247267],"genre_scores_gemma":[0.996779,0.000202623,0.001110852,0.0007010074,0.0003547586,0.0005260333,0.0002061936,0.00004458962,0.00007499673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9262118,"threshold_uncertainty_score":0.9999591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2985590478","doi":"10.1016/j.ffa.2019.101610","title":"Maximal nonassociativity via nearfields","year":2019,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quasigroup; Associative property; Mathematics; Conjecture; Character (mathematics); Quadratic equation; Combinatorics; Range (aeronautics); Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03268825097317535,"gpt":0.2962821853801588,"spread":0.2635939344069835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003919702,0.0001397088,0.000206573,0.00006452162,0.0001487337,0.00004917377,0.0002142028,0.0001896317,0.0006968279],"category_scores_gemma":[0.00008523511,0.0001155311,0.00007156224,0.0002127575,0.00005357358,0.00008051812,0.0001402547,0.0003501827,0.0003452849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001650226,"about_ca_system_score_gemma":0.00002365099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001783109,"about_ca_topic_score_gemma":0.00002128608,"domain_scores_codex":[0.9990996,0.00006353761,0.0001876613,0.0002616481,0.0001275635,0.0002599843],"domain_scores_gemma":[0.9975992,0.001685246,0.00007204855,0.0004905204,0.00007008433,0.00008283157],"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.0000478676,0.000355664,0.007227526,0.0001961717,0.0001169074,0.000001431363,0.002089853,0.000004682254,0.001441851,0.94497,0.00177168,0.0417764],"study_design_scores_gemma":[0.0004164781,0.0001265293,0.00178307,0.00001676107,0.00001290893,0.000006502621,0.0002689292,0.002591701,0.0006851968,0.9589591,0.03487173,0.0002611062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.423787,0.0001712677,0.4463159,0.002625428,0.000128099,0.001930248,0.0001724619,0.0002907695,0.1245788],"genre_scores_gemma":[0.9943933,0.00002044476,0.001752574,0.0002288618,0.00009819502,0.0002140327,0.00001917424,0.0000224115,0.003250959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5706064,"threshold_uncertainty_score":0.7629777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967990110","doi":"10.1016/s1071-5797(03)00040-6","title":"Low complexity normal bases in F2n","year":2003,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.02155343808712097,"gpt":0.2275598749627338,"spread":0.2060064368756128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001489394,0.00007129907,0.00007503105,0.00006979018,0.0001295641,0.00005002383,0.0002220216,0.00004113201,0.00004560941],"category_scores_gemma":[0.00001115862,0.00006158584,0.00003239729,0.0003385771,0.00004975196,0.0001008109,0.00005271905,0.0001016586,0.00001222395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000281048,"about_ca_system_score_gemma":0.00001323941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001035639,"about_ca_topic_score_gemma":0.00004011363,"domain_scores_codex":[0.9995178,0.00004060966,0.0001031212,0.0001765089,0.00003515719,0.0001267817],"domain_scores_gemma":[0.9994099,0.0001967612,0.00002468991,0.0003072589,0.00001648663,0.00004493347],"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.000001230328,0.00006083606,0.0007707459,0.000006255376,0.000002181813,3.501402e-7,0.0002956317,0.00001360854,0.00003098681,0.9833758,0.00006283345,0.01537956],"study_design_scores_gemma":[0.0002600656,0.00005610691,0.004229925,0.00001507854,0.000002136142,0.000005689996,0.00009251245,0.003351234,0.001657719,0.9372507,0.05287638,0.00020239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0164948,0.00009784173,0.9649175,0.0004770241,0.00003233512,0.0001400598,0.000009139319,0.00005991596,0.01777141],"genre_scores_gemma":[0.9945236,0.00002229962,0.004754268,0.0005511199,0.00001561244,0.00008458383,0.000003408697,0.000002493818,0.00004260249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9780288,"threshold_uncertainty_score":0.2511397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963897853","doi":"10.1016/j.ffa.2005.06.002","title":"Congruences for Brewer sums","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Congruence relation; Mathematics; Arithmetic; Algebra over a field; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04628615749235079,"gpt":0.3279544215340539,"spread":0.2816682640417031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008978369,0.00008984632,0.0001333429,0.00002778406,0.0001389676,0.00003552891,0.0001049031,0.0000631862,0.0001030674],"category_scores_gemma":[0.0001170196,0.00006863164,0.00004567758,0.000054936,0.00006672482,0.00009281943,0.00003228165,0.00006482452,0.00002360425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006249705,"about_ca_system_score_gemma":0.000009002964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002742429,"about_ca_topic_score_gemma":0.00004590763,"domain_scores_codex":[0.9995055,0.000005806457,0.0001738598,0.0001386081,0.00004461987,0.0001316721],"domain_scores_gemma":[0.9984229,0.001210351,0.00005470174,0.0002077464,0.00005828319,0.00004603514],"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.000002604042,0.0000561423,0.0000113791,0.000071111,0.00001585767,3.616394e-8,0.0004859208,0.000004941817,0.00005851646,0.9890489,0.002647328,0.007597271],"study_design_scores_gemma":[0.0001209471,0.00001701265,0.000008371596,0.00001188518,0.00001148529,0.00000179779,0.000255379,0.0008130054,0.000721968,0.8810359,0.1169158,0.00008646918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004079103,0.0002332829,0.9788375,0.00190564,0.0000272138,0.0006837967,0.00008190023,0.000107185,0.01404432],"genre_scores_gemma":[0.8917009,0.00009871575,0.09424029,0.0004343918,0.0003627599,0.001605226,0.00002086407,0.00002816638,0.01150873],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8876218,"threshold_uncertainty_score":0.2798717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2753771241","doi":"10.1016/j.ffa.2017.08.012","title":"A strongly regular decomposition of the complete graph and its association scheme","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Association scheme; Mathematics; Scheme (mathematics); Decomposition; Graph; Regular graph; Combinatorics; Association (psychology); Strongly regular graph; Discrete mathematics; Voltage graph; Line graph; Graph power; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05837739689131383,"gpt":0.3306328660866852,"spread":0.2722554691953714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805871,0.00008525702,0.0001390379,0.00003763615,0.0005749724,0.00006804575,0.0002659558,0.0001014749,0.00002125378],"category_scores_gemma":[0.0002431864,0.00006109782,0.00005041546,0.000064662,0.00008122267,0.00008179289,0.0001742514,0.000168123,0.000003541574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000127069,"about_ca_system_score_gemma":0.00001285041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001071647,"about_ca_topic_score_gemma":0.00002733832,"domain_scores_codex":[0.9993815,0.00005815208,0.0001674513,0.0001464048,0.0001174334,0.0001290631],"domain_scores_gemma":[0.9984508,0.0006313694,0.0002446283,0.0005220619,0.0001123805,0.00003873658],"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.00001861333,0.00009438198,0.005085778,0.000130214,0.00008961983,1.310371e-7,0.0006605513,0.000001804156,0.007433217,0.9842262,0.0003232228,0.001936271],"study_design_scores_gemma":[0.0006278684,0.00007125775,0.02593633,0.00008296305,0.00004250308,0.000004214097,0.0001981214,0.00391912,0.004099946,0.9603837,0.004456098,0.000177948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9644253,0.0002502144,0.02343662,0.003615256,0.00004667681,0.001114403,0.0003240746,0.00004227824,0.00674519],"genre_scores_gemma":[0.9984444,0.00004761501,0.0009360728,0.0000285566,0.00004157527,0.0001104132,0.000009504039,0.000009729742,0.0003721216],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03401912,"threshold_uncertainty_score":0.4422281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4315880697","doi":"10.1016/j.ffa.2022.102150","title":"On eigenfunctions and maximal cliques of generalised Paley graphs of square order","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Eigenfunction; Cardinality (data modeling); Eigenvalues and eigenvectors; Square (algebra); Finite field; Graph; Order (exchange); Discrete mathematics; Upper and lower bounds; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06146125525131579,"gpt":0.3233821245151931,"spread":0.2619208692638773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002582091,0.0001049943,0.0001902767,0.0001998232,0.0001120773,0.00001194592,0.0001069407,0.0001050085,0.0001069119],"category_scores_gemma":[0.0001439665,0.00008401673,0.00005097411,0.0005383124,0.0001364116,0.00003091653,0.00007356261,0.0001370275,0.000008156837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003163939,"about_ca_system_score_gemma":0.00001916922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000204787,"about_ca_topic_score_gemma":0.00002543034,"domain_scores_codex":[0.9992822,0.00005256129,0.0002423882,0.0001787651,0.000101252,0.0001428635],"domain_scores_gemma":[0.9979946,0.00138458,0.00008267062,0.0003520432,0.0001333259,0.00005278709],"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.00004025712,0.0001215554,0.0008531365,0.0002136451,0.0000667787,3.601438e-7,0.001060583,0.00001463162,0.001127762,0.9914889,0.0009809214,0.004031488],"study_design_scores_gemma":[0.000317211,0.0002265541,0.001860968,0.00004275978,0.00002047872,0.000001653401,0.0005106987,0.001017385,0.001916993,0.9920912,0.001877095,0.0001169516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9582769,0.0001737636,0.0317467,0.0006805583,0.00003171186,0.0008290873,0.0005233613,0.0001286538,0.007609243],"genre_scores_gemma":[0.9977872,0.0002480834,0.001227746,0.00004799146,0.00002359247,0.000242737,0.00005496841,0.00001808653,0.0003495521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03951032,"threshold_uncertainty_score":0.3426103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963692803","doi":"10.1016/j.ffa.2012.02.004","title":"On a conjecture of polynomials with prescribed range","year":2012,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Multiset; Finite field; Conjecture; Multiplicity (mathematics); Combinatorics; Integer (computer science); Discrete mathematics; Polynomial; Field (mathematics); Degree (music); Range (aeronautics); Pure mathematics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01038097727233855,"gpt":0.2090904849054679,"spread":0.1987095076331293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001001891,0.00006868166,0.00008775431,0.00004929158,0.0000744072,0.00001857836,0.0001847324,0.00004383902,0.00001774112],"category_scores_gemma":[0.000005130311,0.00004516207,0.0000295266,0.000175162,0.00003911409,0.00007701686,0.0000400865,0.00006981946,0.000003901635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001372713,"about_ca_system_score_gemma":0.000007295246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004596464,"about_ca_topic_score_gemma":0.000001958774,"domain_scores_codex":[0.9996465,0.0000218903,0.00007628153,0.0001077628,0.00004021367,0.0001072829],"domain_scores_gemma":[0.9992999,0.0002762077,0.0000443814,0.0003128759,0.00001687636,0.00004971757],"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.0000146778,0.00006929526,0.0004797115,0.000009044715,0.0000166128,5.291411e-8,0.001452028,0.000005308172,0.0001330129,0.9842353,0.0001461127,0.01343881],"study_design_scores_gemma":[0.002671832,0.001831369,0.01932793,0.0001888109,0.00008021,0.00003951377,0.000407087,0.002035638,0.02215794,0.7186483,0.2314684,0.001143032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03298262,0.0003954281,0.9582075,0.0005412353,0.00002926762,0.0002491165,0.00002029934,0.0000552175,0.007519314],"genre_scores_gemma":[0.9977571,0.00001039019,0.001797978,0.0002669155,0.00003991067,0.00008660043,0.000002203632,0.000003126177,0.00003581199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9647744,"threshold_uncertainty_score":0.1841656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2541979517","doi":"10.1016/j.ffa.2017.04.007","title":"Matroidal structure of skew polynomial rings with application to network coding","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Matroid; Mathematics; Discrete mathematics; Combinatorics; Finite field; Matroid partitioning; Vector space; Pure mathematics; Graphic matroid","retraction":null,"screen_n_in":null,"score":{"opus":0.01373798569526206,"gpt":0.249331339490127,"spread":0.2355933537948649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000845286,0.0001054517,0.0001382547,0.00003808605,0.0006979561,0.0001665071,0.0008739082,0.00005439853,0.000008013231],"category_scores_gemma":[0.00001144534,0.0000833314,0.00002398372,0.0001492789,0.00005866298,0.000154171,0.0003936201,0.000128826,0.000004163133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000806864,"about_ca_system_score_gemma":0.0000240781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001708222,"about_ca_topic_score_gemma":0.0001293503,"domain_scores_codex":[0.9993894,0.00001828537,0.0001534046,0.0002344002,0.00006279239,0.0001417531],"domain_scores_gemma":[0.9984897,0.0001032975,0.0001536976,0.001089098,0.00008853185,0.00007570727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002464269,0.0000458232,0.00344984,0.00002783019,0.0000461458,2.233202e-7,0.001757199,0.0008899,0.007626379,0.6802773,0.001045324,0.3048094],"study_design_scores_gemma":[0.002616369,0.0007750519,0.1147032,0.0004468368,0.00006983485,0.00004904067,0.0002087072,0.1937757,0.01886606,0.0707856,0.5956723,0.002031284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00810649,0.0001190168,0.9873439,0.002117503,0.00002719817,0.0003606066,0.00001441412,0.00004258753,0.00186829],"genre_scores_gemma":[0.9766753,0.0000979973,0.02265802,0.0002812104,0.0001199013,0.00008569193,0.000008673625,0.000006415689,0.00006674789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9685689,"threshold_uncertainty_score":0.5368184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403537073","doi":"10.1016/j.ffa.2024.102520","title":"Stable binomials over finite fields","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01466790902814683,"gpt":0.2384795716512006,"spread":0.2238116626230538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001935801,0.000123438,0.0001146587,0.0001249589,0.0002042868,0.0003205497,0.000372661,0.0001072794,0.0001459795],"category_scores_gemma":[0.00001173425,0.00009930574,0.00008464268,0.0004906831,0.00004028491,0.0002139924,0.0001629845,0.0001904548,0.00006678249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004881219,"about_ca_system_score_gemma":0.00002951669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000161702,"about_ca_topic_score_gemma":0.000009644186,"domain_scores_codex":[0.9992389,0.0000276154,0.0001558825,0.0003311616,0.00006282052,0.0001836184],"domain_scores_gemma":[0.9987047,0.0006883657,0.00002552385,0.0004858858,0.00002319698,0.00007235775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002530864,0.00002910739,0.00005543684,0.0000327719,0.00002969158,0.000001681612,0.0008698676,0.00005223753,0.0001094996,0.917572,0.002396685,0.07884849],"study_design_scores_gemma":[0.00009906266,0.00006143136,0.0001870709,0.00003699128,0.00001003571,0.000004794821,0.00003825047,0.02663424,0.0005895545,0.425203,0.546923,0.0002125144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002789947,0.001228569,0.9814044,0.00157565,0.0001732834,0.0001844433,0.00003653014,0.0002771924,0.01232999],"genre_scores_gemma":[0.9960184,0.0002013327,0.001832384,0.00077642,0.0001537884,0.0001779351,0.00001074,0.000008424236,0.0008206074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9932284,"threshold_uncertainty_score":0.4049571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963687249","doi":"10.1016/j.ffa.2018.03.007","title":"Non-commutative association schemes and their fusion association schemes","year":2018,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Association scheme; Commutative property; Association (psychology); Mathematics; Algebra over a field; Pure mathematics; Discrete mathematics; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.00568083153776056,"gpt":0.2003904576498935,"spread":0.1947096261121329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002815248,0.0001447326,0.0001640227,0.00006265956,0.0002799116,0.00006432048,0.00008263527,0.0002042267,0.00003698135],"category_scores_gemma":[0.00003375476,0.0001190886,0.00004083532,0.0001865938,0.00003004028,0.0001128157,0.0000363867,0.0001762259,0.00003265266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004363093,"about_ca_system_score_gemma":0.000006858029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009806278,"about_ca_topic_score_gemma":0.00002429231,"domain_scores_codex":[0.9993987,0.00003015871,0.0001773254,0.000156781,0.00006360018,0.0001734535],"domain_scores_gemma":[0.9992469,0.0003437543,0.00008994688,0.0001722564,0.00009447907,0.00005268324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001828275,0.0007331779,0.146758,0.001227064,0.003683303,0.000001651757,0.120094,0.000389584,0.1095938,0.2554221,0.03096782,0.3309467],"study_design_scores_gemma":[0.001753239,0.0003867659,0.01728815,0.0002317603,0.0001097266,0.000007701302,0.00683465,0.06403915,0.08390854,0.1143072,0.7097645,0.001368659],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8302726,0.00102742,0.1446664,0.0006791499,0.0002598503,0.0007488776,0.0001813844,0.0003619879,0.02180236],"genre_scores_gemma":[0.9987016,0.0001904984,0.0001305423,0.00009002746,0.0002087211,0.0001806456,0.00004254263,0.00001598538,0.0004394467],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6787966,"threshold_uncertainty_score":0.485629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2736709020","doi":"10.1016/j.ffa.2017.06.003","title":"Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Carleton University","keywords":"Mathematics; Permutation (music); Spectrum (functional analysis); Ambiguity; Degree (music); Finite field; Differential (mechanical device); Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0144624140567298,"gpt":0.2490156941270244,"spread":0.2345532800702946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001399011,0.0001145069,0.0001581556,0.0000827733,0.0005309258,0.000214404,0.0004744923,0.00009462467,0.00004363853],"category_scores_gemma":[0.00003094069,0.00009649072,0.00006601721,0.00008885852,0.0001383046,0.0002116577,0.0002944872,0.0001124474,0.000002538388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002525723,"about_ca_system_score_gemma":0.00001546099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007141126,"about_ca_topic_score_gemma":0.00003503924,"domain_scores_codex":[0.9993105,0.00002925526,0.0001889442,0.0002511847,0.00007382149,0.0001463001],"domain_scores_gemma":[0.9988804,0.0002441719,0.0001640319,0.0006234625,0.0000291482,0.00005882704],"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.00003436358,0.0001657072,0.005182921,0.00006935109,0.0000398965,8.8121e-7,0.002785233,0.00002278742,0.001655752,0.8965649,0.00009993282,0.09337825],"study_design_scores_gemma":[0.001376031,0.0003402881,0.1380029,0.00005933239,0.00004990093,0.00001147573,0.0001186485,0.0232609,0.006617056,0.8262148,0.003407009,0.0005415946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2584863,0.0001286682,0.7368945,0.0008353477,0.00007883017,0.0001852979,0.00003086431,0.0000374087,0.003322756],"genre_scores_gemma":[0.9989496,0.0001209363,0.0006420115,0.00009254253,0.00005814472,0.0000460685,0.000006587984,0.000004357125,0.00007977062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7404633,"threshold_uncertainty_score":0.4083506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032962521","doi":"10.1016/j.ffa.2011.06.003","title":"A note on multiple exponential sums in function fields","year":2011,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Monic polynomial; Mathematics; Exponential function; Finite field; Polynomial; Combinatorics; Field (mathematics); Homogeneous; Degree (music); Polynomial ring; Discrete mathematics; Ring (chemistry); Formal power series; Homogeneous polynomial; Minimal polynomial (linear algebra); Function field; Character (mathematics); Power series; Pure mathematics; Matrix polynomial; Mathematical analysis; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.08230369811034384,"gpt":0.3109999092726298,"spread":0.2286962111622859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002154111,0.0001034826,0.0001302667,0.0000957169,0.00009360521,0.00001556086,0.0001262119,0.0001355242,0.0003889172],"category_scores_gemma":[0.0001161218,0.00008393733,0.00004696155,0.0001558279,0.00004522274,0.00004487382,0.00005532257,0.0002530694,0.00007072233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000113707,"about_ca_system_score_gemma":0.00001449078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000103716,"about_ca_topic_score_gemma":0.0003289262,"domain_scores_codex":[0.9993168,0.00004107416,0.0001837117,0.000204943,0.00008025366,0.000173289],"domain_scores_gemma":[0.9986133,0.0009098702,0.00004385305,0.0003429616,0.00003116311,0.00005885681],"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.0004691939,0.001184345,0.006491812,0.0001291571,0.00009532527,0.000005786348,0.01031792,0.00001356553,0.0003723354,0.9315493,0.001843472,0.04752778],"study_design_scores_gemma":[0.0007641993,0.0001987994,0.003331031,0.00003843079,0.00002024602,0.000003254236,0.0006325077,0.004429138,0.001223757,0.9816084,0.007523159,0.0002270987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1767028,0.0000406098,0.771091,0.000412884,0.00007505345,0.0008411211,0.00003488985,0.00009972074,0.05070191],"genre_scores_gemma":[0.9978681,0.00001750612,0.0007594988,0.0001328183,0.00007359569,0.0002704626,0.00001076433,0.00001314918,0.0008541064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8211653,"threshold_uncertainty_score":0.4258371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963590413","doi":"10.1016/j.ffa.2019.03.007","title":"Uniqueness of certain Fourier-Jacobi models over finite fields","year":2019,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China; Purdue University; Pacific Institute for the Mathematical Sciences; National Science Foundation","keywords":"Uniqueness; Mathematics; Finite field; Fourier transform; Pure mathematics; Fourier series; Fourier analysis; Mathematical analysis; Algebra over a field; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02653378148374149,"gpt":0.2806470890669893,"spread":0.2541133075832478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001217474,0.0001578545,0.0002634435,0.00009169573,0.00009012272,0.00001612491,0.000182455,0.0001960143,0.0002519212],"category_scores_gemma":[0.00004406811,0.0001289549,0.00008541805,0.0002574806,0.00004262026,0.0001147703,0.00008849155,0.0002018333,0.0000153643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006822245,"about_ca_system_score_gemma":0.00002506185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001403326,"about_ca_topic_score_gemma":0.00001604904,"domain_scores_codex":[0.9991814,0.00002356274,0.0002798698,0.0002365536,0.00009464259,0.0001839947],"domain_scores_gemma":[0.9980143,0.001155764,0.0001324066,0.0005573361,0.00007422964,0.00006594678],"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.00002134714,0.0001470368,0.0007574884,0.0002336547,0.00006292578,4.842577e-7,0.001335235,0.001263724,0.0001876555,0.9831695,0.0003165169,0.01250442],"study_design_scores_gemma":[0.0003178186,0.0000626804,0.0001193385,0.0000419551,0.00001834405,0.000001630662,0.0002032637,0.01194418,0.001040204,0.977067,0.008993309,0.0001902787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1977771,0.0001491868,0.7916991,0.000282362,0.00004629037,0.0005104291,0.0001010049,0.00005816736,0.009376427],"genre_scores_gemma":[0.9935485,0.00009816938,0.003794446,0.0002712293,0.00005686227,0.0001336463,0.00002743189,0.0000205764,0.002049137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7957714,"threshold_uncertainty_score":0.5258626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386179316","doi":"10.1016/j.ffa.2023.102283","title":"Existence of pencils with nonblocking hypersurfaces","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pencil (optics); Mathematics; Finite field; Pure mathematics; Blocking (statistics); Field (mathematics); Discrete mathematics; Algebra over a field; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04516818810621517,"gpt":0.2780125608051152,"spread":0.2328443726989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791638,0.0000767407,0.00012595,0.00005147943,0.0001070364,0.00000978802,0.0001088373,0.00005146075,0.00005377012],"category_scores_gemma":[0.00004093226,0.00005398029,0.00002527282,0.0003663594,0.00007110424,0.00003562856,0.00004313239,0.00007898691,0.00001934363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002179087,"about_ca_system_score_gemma":0.00001275172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006878349,"about_ca_topic_score_gemma":0.000005783454,"domain_scores_codex":[0.9995564,0.00001399132,0.0001255151,0.0001293459,0.00006550455,0.0001092362],"domain_scores_gemma":[0.9988109,0.0008122498,0.00006655136,0.0002351335,0.00004214387,0.00003300423],"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.00003502563,0.000127041,0.002285529,0.0003412412,0.0001162118,0.000002064404,0.006852163,0.00003599685,0.001042477,0.9715897,0.0004655797,0.01710694],"study_design_scores_gemma":[0.0002818601,0.0001070506,0.001091096,0.00008171508,0.00003411961,0.000009536856,0.004833073,0.0004876773,0.005961949,0.980247,0.006653797,0.0002111201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9296966,0.0001059532,0.05027935,0.0003432508,0.00001822451,0.0002989176,0.00003771287,0.0001245572,0.01909541],"genre_scores_gemma":[0.9969428,0.00004231537,0.002168886,0.00003489511,0.00002443935,0.00008017963,0.000007137627,0.000008409237,0.0006909177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06724619,"threshold_uncertainty_score":0.2201253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401421447","doi":"10.1016/j.ffa.2024.102474","title":"On the stable polynomials of degrees 2,3,4","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics; Algebra over a field; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.06740493582419127,"gpt":0.3319059122330857,"spread":0.2645009764088945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003662642,0.00006890363,0.0001041332,0.00004565719,0.00009210008,0.00003728717,0.0001506232,0.00004893688,0.0004850731],"category_scores_gemma":[0.0001099319,0.00003782608,0.00004711481,0.0001687122,0.00008035776,0.0000225353,0.00005073205,0.0001444432,0.00005080447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005850251,"about_ca_system_score_gemma":0.00002667351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001546474,"about_ca_topic_score_gemma":0.00001025345,"domain_scores_codex":[0.9995248,0.00003545538,0.0001388889,0.0001208233,0.00007565883,0.000104316],"domain_scores_gemma":[0.9955558,0.004038854,0.00002525459,0.0003216909,0.00002893657,0.00002943316],"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.000004054601,0.00002697924,0.00001040956,0.0000509246,0.00003952544,2.031364e-7,0.0004051966,0.000003418641,0.0001280422,0.991599,0.004607258,0.003124948],"study_design_scores_gemma":[0.00003706313,0.00002842762,0.00001242899,0.00004575591,0.00001358869,0.000001667408,0.0003328668,0.002376757,0.001289392,0.9730199,0.02278928,0.0000528845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1224549,0.002035764,0.6039794,0.0138799,0.0001065638,0.002033246,0.0004762743,0.0002666513,0.2547673],"genre_scores_gemma":[0.9954023,0.00005068273,0.000343553,0.00007390595,0.00005256713,0.000144947,0.000003237038,0.00001145634,0.003917313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8729475,"threshold_uncertainty_score":0.531121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4324056828","doi":"10.1016/j.ffa.2023.102180","title":"On the functional graph of f(X)=c(Xq+1 + aX2) over quadratic extensions of finite fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Quadratic equation; Graph; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02433315670021801,"gpt":0.2291957025513351,"spread":0.2048625458511171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002417737,0.00009998261,0.000129484,0.0001581455,0.0002198298,0.00002426287,0.0003383999,0.00007529347,0.00008767365],"category_scores_gemma":[0.00005705788,0.0000661216,0.0001173473,0.0009080734,0.0001032838,0.00005871682,0.0001249321,0.000154316,0.00001568584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001501331,"about_ca_system_score_gemma":0.00001964544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009685164,"about_ca_topic_score_gemma":0.000008483752,"domain_scores_codex":[0.9993025,0.00004871786,0.0002077087,0.0002021021,0.0001132416,0.0001257211],"domain_scores_gemma":[0.9968617,0.002348044,0.00009514014,0.0005928878,0.00006334054,0.00003890862],"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.000007695382,0.00005652284,0.0001207384,0.00001393648,0.00002690667,2.227155e-7,0.0005751777,0.0004191928,0.0002404,0.9923546,0.001540637,0.004643945],"study_design_scores_gemma":[0.0001763657,0.0001547687,0.007530937,0.00004427133,0.00001315927,0.000001328455,0.0001707892,0.01581142,0.0008657787,0.9710439,0.004053533,0.0001336759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0804367,0.00009111832,0.9124086,0.002814154,0.0001151783,0.0002836547,0.0000521318,0.00009744518,0.003700959],"genre_scores_gemma":[0.9988327,0.00006575047,0.000269005,0.0005311213,0.00002936589,0.000120696,0.00001062955,0.000004673183,0.0001360601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.918396,"threshold_uncertainty_score":0.2696361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4319302498","doi":"10.1016/j.ffa.2023.102169","title":"Linear families of smooth hypersurfaces over finitely generated fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Counterexample; Mathematics; Finitely-generated abelian group; Construct (python library); Finite field; Combinatorics; Field (mathematics); Degree (music); Pure mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03999686515164369,"gpt":0.2859015908493733,"spread":0.2459047256977296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002096522,0.000131315,0.0002061035,0.0001121601,0.0001381166,0.00001375652,0.0001500562,0.0001629562,0.0002161952],"category_scores_gemma":[0.0001030334,0.0001048401,0.00006574082,0.0005505469,0.00008195441,0.00004649551,0.00007906077,0.0001531733,0.00004538873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002899489,"about_ca_system_score_gemma":0.00001777544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002661097,"about_ca_topic_score_gemma":0.00001442704,"domain_scores_codex":[0.999292,0.00003283836,0.0002441461,0.0001870712,0.0000817398,0.0001621809],"domain_scores_gemma":[0.998307,0.001168719,0.00008742713,0.0003295016,0.00005702705,0.00005029141],"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.0001460464,0.0006925853,0.004824175,0.00101468,0.000620796,0.000006624507,0.01639027,0.0007822466,0.005015151,0.8856419,0.0265171,0.05834845],"study_design_scores_gemma":[0.0007304157,0.0001684468,0.002535475,0.00006427618,0.00007208063,0.000004086672,0.003084722,0.006600078,0.01213291,0.9000957,0.07401936,0.0004924621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9573786,0.000202009,0.03223071,0.0005519164,0.00007034416,0.0003166893,0.0001566255,0.0001924918,0.008900649],"genre_scores_gemma":[0.9966919,0.0002988638,0.001025974,0.0001507619,0.00008398917,0.0000905758,0.00005349563,0.00001646444,0.001587979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05785599,"threshold_uncertainty_score":0.4275255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052167619","doi":"10.1016/j.ffa.2011.04.002","title":"On coefficients of polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Polynomial; Permutation (music); Finite field; Recurrence relation; Upper and lower bounds; Field (mathematics); Combinatorics; Reciprocal polynomial; Relation (database); Matrix polynomial; Discrete mathematics; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0221049132910189,"gpt":0.2290918561809303,"spread":0.2069869428899114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001364581,0.000100438,0.0001225259,0.0001039995,0.0001199624,0.00002504957,0.0004071892,0.00008953039,0.0001069725],"category_scores_gemma":[0.00001876253,0.00008136086,0.00007058879,0.0002796684,0.00005762155,0.00006703578,0.0001153125,0.0001102783,0.00001629664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002129554,"about_ca_system_score_gemma":0.00001223978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000183905,"about_ca_topic_score_gemma":0.000004438858,"domain_scores_codex":[0.9993877,0.000028369,0.0001684294,0.0002215833,0.00006301414,0.0001309342],"domain_scores_gemma":[0.9988821,0.0004379366,0.00007630014,0.0005146109,0.00003257818,0.00005644426],"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.00001728558,0.0001781245,0.0002501575,0.00001155843,0.00002168783,3.549373e-7,0.002063981,0.00003000342,0.00008543337,0.9600319,0.0003220878,0.03698748],"study_design_scores_gemma":[0.0008586945,0.0008312311,0.00652516,0.00008336067,0.00002550937,0.000004166482,0.0001462725,0.009976349,0.01131279,0.9351642,0.03450141,0.0005708353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02755233,0.0000716201,0.9528566,0.00012803,0.00007507153,0.0001776424,0.0000265226,0.00005872268,0.01905347],"genre_scores_gemma":[0.9978312,0.00002508149,0.001419592,0.0005288463,0.00002571957,0.00005855602,0.00000367988,0.000004489217,0.0001028262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9702789,"threshold_uncertainty_score":0.3317799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137465039","doi":"10.1016/j.ffa.2007.03.002","title":"Polynomial approximation of bilinear Diffie–Hellman maps","year":2007,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bilinear interpolation; Diagonal; Degree (music); Polynomial; Bilinear map; Interpolation (computer graphics); Discrete mathematics; Set (abstract data type); Matrix polynomial; Combinatorics; Image (mathematics); Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008432818511571577,"gpt":0.2184335882776669,"spread":0.2100007697660953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001796266,0.0000722176,0.00009072372,0.0001118991,0.0001062657,0.00002622618,0.0002341351,0.00007361503,0.000005216461],"category_scores_gemma":[0.000007280558,0.00005621513,0.00004960431,0.0003358701,0.00005809325,0.00007365008,0.00007376375,0.00008782122,0.000004699138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002556674,"about_ca_system_score_gemma":0.00001159253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001798816,"about_ca_topic_score_gemma":0.00001226365,"domain_scores_codex":[0.9994588,0.00001082605,0.0001809528,0.0001691789,0.00005972055,0.0001204988],"domain_scores_gemma":[0.999316,0.0002072285,0.00006588308,0.0003223867,0.00003748136,0.00005101023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002163162,0.0004299079,0.001529003,0.0001078914,0.00005939422,0.000001269176,0.004685854,0.00006979475,0.005899766,0.3549545,0.0008744522,0.6313666],"study_design_scores_gemma":[0.003689472,0.001035615,0.06288254,0.0001569393,0.00009051855,0.00007808211,0.002299936,0.1167426,0.1613726,0.2872711,0.362413,0.001967566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01699331,0.0002224009,0.9793292,0.0004051574,0.00003853367,0.0001939051,0.00001126701,0.00004580968,0.002760359],"genre_scores_gemma":[0.9837407,0.0000471906,0.01597481,0.00009417698,0.00006069976,0.00001970636,0.0000110635,0.000003560831,0.00004802876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9667475,"threshold_uncertainty_score":0.2292386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4307815954","doi":"10.1016/j.ffa.2022.102114","title":"Two-weight or three-weight binary linear codes from cyclotomic mappings","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Construct (python library); Linear code; Binary number; Weight distribution; Discrete mathematics; Secret sharing; Block code; Cryptography; Algorithm; Arithmetic; Computer science; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.01586123951908379,"gpt":0.2287484881883779,"spread":0.2128872486692941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718983,0.0001493229,0.0001563009,0.0001166302,0.0007439042,0.00007309897,0.0007704109,0.00004896597,0.0003574774],"category_scores_gemma":[0.000005651315,0.0001187119,0.00008285797,0.000553413,0.00006172877,0.0001197239,0.0005762913,0.0002702638,0.00002556433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001055439,"about_ca_system_score_gemma":0.00003586735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006289707,"about_ca_topic_score_gemma":0.00002863778,"domain_scores_codex":[0.9990486,0.00005924156,0.000186033,0.0004069706,0.0001056307,0.0001935484],"domain_scores_gemma":[0.9986898,0.0004856559,0.00007837309,0.0006405594,0.00002614345,0.00007951786],"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.00008165405,0.0003226268,0.001487677,0.0000173162,0.0001206023,0.00001086141,0.002724336,0.0002671237,0.001447895,0.9322208,0.002000733,0.05929833],"study_design_scores_gemma":[0.0006079656,0.0002172405,0.001108907,0.00001532261,0.00002082026,0.00001919506,0.0002029411,0.05753228,0.0005798109,0.5074009,0.4318686,0.0004259837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04696575,0.0006142099,0.9459894,0.002157882,0.0001660805,0.0003977055,0.000207419,0.000289186,0.003212394],"genre_scores_gemma":[0.987794,0.0000882977,0.009811233,0.001123031,0.000187068,0.0006961292,0.00006656068,0.00001265741,0.0002210619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9408282,"threshold_uncertainty_score":0.5721585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393305872","doi":"10.1016/j.ffa.2024.102415","title":"Constructing permutation polynomials from permutation polynomials of subfields","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Pró-Reitoria de Pesquisa, Universidade Federal de Minas Gerais; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Permutation (music); Finite field; Combinatorics; Discrete mathematics; Polynomial; Field (mathematics); Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01088568074094826,"gpt":0.2338781478576524,"spread":0.2229924671167041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001951252,0.0001115155,0.0001493552,0.0001410327,0.0001334426,0.0001587378,0.0002420515,0.0001064558,0.00008614255],"category_scores_gemma":[0.00002182703,0.00009798867,0.00008296439,0.0003538418,0.00006922,0.0002267802,0.00007561065,0.0001304482,0.00001099474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008375072,"about_ca_system_score_gemma":0.00003999567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004687845,"about_ca_topic_score_gemma":0.00002129503,"domain_scores_codex":[0.9992115,0.00004890432,0.0002592579,0.0002930506,0.00006895917,0.0001183237],"domain_scores_gemma":[0.9986354,0.0008982399,0.00007733302,0.0002953556,0.00004571497,0.00004793212],"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.000005963286,0.00002200147,0.0002905357,0.00004089342,0.00004898649,7.173779e-7,0.003467756,0.00001277771,0.004474009,0.7580687,0.0001393345,0.2334283],"study_design_scores_gemma":[0.000455908,0.0001869975,0.002008571,0.0002005192,0.00006864213,0.00002687938,0.002495957,0.04700802,0.04387685,0.8825883,0.02048518,0.0005982144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09997293,0.0008505319,0.8939076,0.0009550425,0.0001638503,0.0002025107,0.000113345,0.0001467394,0.003687449],"genre_scores_gemma":[0.9948229,0.0000404169,0.004703444,0.000121257,0.0001314491,0.00007347862,0.00004069239,0.000006986587,0.00005938142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.89485,"threshold_uncertainty_score":0.3995862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4365506139","doi":"10.1016/j.ffa.2023.102207","title":"Generalized Lucas polynomials over finite fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Finite field; Permutation (music); Prime (order theory); Lucas sequence; Combinatorics; Field (mathematics); Difference polynomials; Discrete mathematics; Pure mathematics; Algebra over a field; Orthogonal polynomials; Fibonacci polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.02085775382021079,"gpt":0.2535855874173851,"spread":0.2327278335971743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002317623,0.000139562,0.0001511858,0.0001635162,0.0003075175,0.000145345,0.0004802512,0.000127108,0.0000965307],"category_scores_gemma":[0.0000231761,0.0001180091,0.0001031489,0.0007674939,0.00004691583,0.0001331512,0.0002396641,0.0001530333,0.0001055681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000383184,"about_ca_system_score_gemma":0.0000210153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002265263,"about_ca_topic_score_gemma":0.00001331601,"domain_scores_codex":[0.9991181,0.00004645375,0.000188811,0.0003303895,0.00007724781,0.0002390361],"domain_scores_gemma":[0.9985896,0.0006100452,0.0000579632,0.0006194309,0.00003019528,0.00009271388],"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.000009424034,0.00004931025,0.0003086472,0.00001821475,0.00004485451,0.000002417671,0.001542752,0.0001769725,0.0003447011,0.9221196,0.006792836,0.06859022],"study_design_scores_gemma":[0.000574975,0.0001079617,0.002578606,0.00002278037,0.00001552994,0.000006414792,0.00009219105,0.03398161,0.001173081,0.5512019,0.4097767,0.0004682197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03492894,0.0002569116,0.9536173,0.003465179,0.0002009265,0.0003252546,0.00004824265,0.0005154192,0.006641853],"genre_scores_gemma":[0.9948682,0.0002388082,0.00180967,0.001589148,0.0001860388,0.0002837446,0.00003004646,0.00001039773,0.0009839085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9599393,"threshold_uncertainty_score":0.4812272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070033202","doi":"10.1016/j.ffa.2014.12.003","title":"A probabilistic approach to value sets of polynomials over finite fields","year":2015,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Coset; Polynomial; Discrete mathematics; Distribution (mathematics); Combinatorics; Random variable; Infinity; Expected value; Value (mathematics); Random field; Finite set; Order (exchange); Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03058453526743701,"gpt":0.252485138880437,"spread":0.221900603613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003178016,0.0001249112,0.0001756945,0.0001125558,0.00009341517,0.00006226247,0.0004891242,0.0001019756,0.000007217818],"category_scores_gemma":[0.00006895393,0.0001026459,0.0000673007,0.0004808264,0.00005074972,0.00009679569,0.0002174493,0.0001187724,0.00000998347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006228103,"about_ca_system_score_gemma":0.00004574045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002872695,"about_ca_topic_score_gemma":0.000004548159,"domain_scores_codex":[0.9991652,0.00005279088,0.00021403,0.0003045842,0.00009669882,0.0001666319],"domain_scores_gemma":[0.9986914,0.0003925848,0.00007062518,0.0006180308,0.00007127324,0.0001561143],"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.00001760927,0.0002030398,0.0001476943,0.00004033008,0.00002899518,2.335656e-7,0.004320553,0.001529063,0.00005490523,0.9712572,0.001286011,0.02111441],"study_design_scores_gemma":[0.0006944914,0.0004492628,0.001227307,0.00004931292,0.0000289746,0.00001022822,0.0002917547,0.06512024,0.0007276367,0.8722389,0.05863139,0.0005304479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234325,0.000121292,0.9711136,0.0006297334,0.00005749625,0.0004443281,0.00003318731,0.00007362466,0.01518351],"genre_scores_gemma":[0.9862151,0.000007572084,0.01272868,0.000632229,0.00005319351,0.0002544363,0.000008729155,0.000006265925,0.00009379377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9738718,"threshold_uncertainty_score":0.4185778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210620791","doi":"10.1016/j.ffa.2022.102002","title":"The additive index of polynomials over finite fields","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Multiplicative function; Permutation (music); Combinatorics; Polynomial; Degree (music); Character (mathematics); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009206383225221415,"gpt":0.2201745957569976,"spread":0.2109682125317762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687133,0.00008549987,0.0001011172,0.00006414318,0.0006996641,0.0000548189,0.0005949294,0.00004349292,0.0001115833],"category_scores_gemma":[0.00002064385,0.00006301792,0.00007917279,0.000390335,0.00007814497,0.00006725125,0.000402657,0.0002106975,0.000002651504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004831249,"about_ca_system_score_gemma":0.00002837478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002099654,"about_ca_topic_score_gemma":0.00001317252,"domain_scores_codex":[0.9993324,0.00007551992,0.0001692215,0.0001933042,0.00009221458,0.0001373167],"domain_scores_gemma":[0.997939,0.001398357,0.00009923337,0.000493701,0.00003117406,0.00003854265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002013043,0.00006918849,0.0002788942,0.000005213233,0.00004383593,4.105223e-7,0.001846011,0.0001969971,0.00004945916,0.8632082,0.002097539,0.1321841],"study_design_scores_gemma":[0.0003115768,0.00021204,0.002319125,0.000007443337,0.000009949694,0.000004977623,0.0005821257,0.01145424,0.0005718179,0.4371991,0.5471068,0.0002207366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007544436,0.0005176003,0.9798112,0.002251866,0.000147277,0.0003515737,0.0001797192,0.00007108979,0.00912526],"genre_scores_gemma":[0.9984286,0.00008445951,0.0002117494,0.0006035921,0.00004932887,0.0003689392,0.000008884232,0.000004208165,0.0002401808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9908842,"threshold_uncertainty_score":0.5381321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3200192232","doi":"10.1016/j.ffa.2022.102083","title":"Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Carleton University","keywords":"Monic polynomial; Mathematics; Reciprocal; Irreducible polynomial; Finite field; Polynomial; Sequence (biology); Field (mathematics); Degree (music); Palindrome; Pure mathematics; Bell polynomials; Combinatorics; Matrix polynomial; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009924961351266281,"gpt":0.2229511590024387,"spread":0.2130261976511724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002026877,0.0001044129,0.0001351414,0.0001221254,0.0003873352,0.00006032357,0.0003627649,0.00004255278,0.00005984903],"category_scores_gemma":[0.00001177435,0.00008999806,0.00005081406,0.0005188676,0.00002747153,0.0001219123,0.000204659,0.0001693567,0.000002456872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009419859,"about_ca_system_score_gemma":0.00004149591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002118708,"about_ca_topic_score_gemma":0.000005367291,"domain_scores_codex":[0.9992116,0.0000580505,0.0001787982,0.0002850621,0.0001156806,0.0001507869],"domain_scores_gemma":[0.9989625,0.0004411098,0.00009986473,0.0004136651,0.00003573804,0.00004712732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002440132,0.001377019,0.003484625,0.0001406956,0.0002878547,0.000003854376,0.02292783,0.0110395,0.004863117,0.8201181,0.001800082,0.1337133],"study_design_scores_gemma":[0.004820829,0.005946661,0.004439861,0.0001951197,0.000214899,0.00007177726,0.001857229,0.4020069,0.04911533,0.1502803,0.3787282,0.002322973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05883568,0.000209879,0.938339,0.0004260161,0.00006046037,0.0003605156,0.00003132365,0.0000978033,0.001639312],"genre_scores_gemma":[0.9969167,0.00001591863,0.002276742,0.0003090553,0.00002867746,0.0003344625,0.00001216673,0.000006381924,0.00009990108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.938081,"threshold_uncertainty_score":0.3670014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}