{"meta":{"query_hash":"ec2f5dae5580","filters":{"venue":"Finite Fields and Their Applications"},"cohort_total":81,"direct_labels_cover":0,"predictions_cover":81,"exported":81,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ec2f5dae5580","api":"https://metacan.xera.ac/api/v1/cohort?venue=Finite+Fields+and+Their+Applications"},"results":[{"id":"W1776326016","doi":"10.1016/j.ffa.2015.09.003","title":"Symmetric Bush-type generalized Hadamard matrices and association schemes","year":2015,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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":"Mathematics; Hadamard transform; Association scheme; Hadamard three-lines theorem; Hadamard's inequality; Prime power; Hadamard matrix; Hadamard product; Type (biology); Complex Hadamard matrix; Prime (order theory); Finite field; Combinatorics; Abelian group; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.014241497948721274,"score_gpt":0.2065913276532174,"score_spread":0.1923498297044961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1776326016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8787139,0.021293567,0.06559362,0.00066379266,0.00052129634,0.00082964293,0.00010153357,0.00064252387,0.031640097],"genre_scores_gemma":[0.9984871,0.0005708181,0.00029802092,0.000053604406,0.00010044437,0.00008236879,0.000022032398,0.000010645112,0.00037496001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995888,0.000019846371,0.00012160835,0.0001041147,0.000057030546,0.00010864086],"domain_scores_gemma":[0.99957246,0.00014262462,0.000033815602,0.00012470079,0.000052508454,0.00007388722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018036565,0.00008817026,0.0001144612,0.00008603726,0.00007314216,0.000051578885,0.00005827975,0.00011260127,0.000009655768],"category_scores_gemma":[0.00002897661,0.000075329684,0.00001997236,0.00033077996,0.000011361372,0.00006399785,0.000018323723,0.00009141113,0.000017917813],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009313887,0.00019713554,0.038531482,0.0006812058,0.0009215967,0.0000026463279,0.0069003506,0.002797299,0.0031484202,0.8058741,0.035479534,0.1053731],"study_design_scores_gemma":[0.0010046624,0.00011323201,0.0020746891,0.000033666558,0.0000699696,0.000010815235,0.00076591194,0.028297234,0.001634028,0.07103525,0.8944067,0.00055387896],"about_ca_topic_score_codex":0.000014534578,"about_ca_topic_score_gemma":0.000005899129,"teacher_disagreement_score":0.85892713,"about_ca_system_score_codex":0.000014103988,"about_ca_system_score_gemma":0.000006703312,"threshold_uncertainty_score":0.30718553},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Congruence relation; Mathematics; Arithmetic; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.04628615749235079,"score_gpt":0.3279544215340539,"score_spread":0.2816682640417031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963897853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040791035,0.00023328286,0.97883755,0.00190564,0.000027213797,0.00068379665,0.00008190023,0.000107185035,0.014044319],"genre_scores_gemma":[0.89170086,0.000098715755,0.09424029,0.0004343918,0.00036275992,0.0016052264,0.00002086407,0.00002816638,0.011508735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950546,0.0000058064566,0.00017385976,0.00013860813,0.000044619872,0.00013167213],"domain_scores_gemma":[0.99842286,0.001210351,0.000054701737,0.00020774639,0.000058283193,0.000046035144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008978369,0.00008984632,0.0001333429,0.00002778406,0.00013896765,0.00003552891,0.000104903054,0.0000631862,0.00010306738],"category_scores_gemma":[0.00011701964,0.00006863164,0.000045677578,0.000054935997,0.00006672482,0.000092819435,0.000032281652,0.00006482452,0.00002360425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002604042,0.000056142297,0.000011379101,0.000071111,0.000015857671,3.6163936e-8,0.00048592075,0.000004941817,0.000058516463,0.9890489,0.0026473282,0.007597271],"study_design_scores_gemma":[0.00012094714,0.000017012646,0.000008371596,0.000011885179,0.000011485291,0.0000017977898,0.000255379,0.0008130054,0.00072196795,0.8810359,0.11691576,0.000086469176],"about_ca_topic_score_codex":0.000002742429,"about_ca_topic_score_gemma":0.000045907625,"teacher_disagreement_score":0.88762176,"about_ca_system_score_codex":0.000006249705,"about_ca_system_score_gemma":0.000009002964,"threshold_uncertainty_score":0.2798717},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Arithmetic","score_opus":0.02155343808712097,"score_gpt":0.2275598749627338,"score_spread":0.20600643687561282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967990110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016494798,0.00009784173,0.9649175,0.00047702412,0.000032335116,0.00014005983,0.000009139319,0.000059915958,0.017771408],"genre_scores_gemma":[0.9945236,0.000022299619,0.004754268,0.00055111985,0.000015612442,0.00008458383,0.000003408697,0.0000024938176,0.00004260249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.00004060966,0.00010312119,0.00017650891,0.000035157187,0.00012678171],"domain_scores_gemma":[0.99940985,0.00019676119,0.000024689913,0.00030725895,0.000016486627,0.000044933466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014893942,0.000071299066,0.00007503105,0.00006979018,0.00012956411,0.000050023827,0.00022202157,0.000041132007,0.000045609406],"category_scores_gemma":[0.00001115862,0.00006158584,0.000032397293,0.0003385771,0.000049751965,0.00010081089,0.000052719053,0.00010165858,0.000012223953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001230328,0.000060836064,0.00077074586,0.0000062553763,0.0000021818125,3.5014017e-7,0.0002956317,0.000013608544,0.000030986812,0.9833758,0.00006283345,0.015379556],"study_design_scores_gemma":[0.00026006557,0.00005610691,0.0042299246,0.000015078538,0.000002136142,0.0000056899958,0.00009251245,0.0033512341,0.001657719,0.93725073,0.052876383,0.00020238997],"about_ca_topic_score_codex":0.000010356388,"about_ca_topic_score_gemma":0.00004011363,"teacher_disagreement_score":0.97802883,"about_ca_system_score_codex":0.00000281048,"about_ca_system_score_gemma":0.000013239408,"threshold_uncertainty_score":0.25113973},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010888143069672264,"score_gpt":0.2522877109278614,"score_spread":0.24139956785818914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969032791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0795242,0.00012939016,0.907164,0.0033429828,0.000025085488,0.0002507012,0.00001556073,0.00003705936,0.009511046],"genre_scores_gemma":[0.9970225,0.000033321216,0.0016296515,0.001144664,0.000046252597,0.00010311207,0.0000047054555,0.0000028485106,0.000012908661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994432,0.000073136,0.0001565669,0.00017478938,0.0000436545,0.00010866256],"domain_scores_gemma":[0.99826473,0.0011792047,0.000051718693,0.00045582445,0.000022279217,0.000026260017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002890322,0.00008540758,0.00008739655,0.00009633612,0.000151149,0.00004833218,0.00034927684,0.00006997657,0.000019731968],"category_scores_gemma":[0.00001312783,0.00005788531,0.00005472691,0.00033516082,0.00004712804,0.00009061648,0.00005495091,0.00016807692,0.000007151809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061845935,0.00009517097,0.00001789554,0.000005255195,0.000004861072,0.000003825681,0.0019779888,0.00026976882,0.0000148447325,0.8887507,0.00008069227,0.10877282],"study_design_scores_gemma":[0.00034517387,0.00022145292,0.00037608534,0.000033778513,0.000008128693,0.0001027537,0.0003685507,0.033648454,0.0007864037,0.9539749,0.009953092,0.00018120531],"about_ca_topic_score_codex":0.000017429902,"about_ca_topic_score_gemma":0.000081599515,"teacher_disagreement_score":0.91749835,"about_ca_system_score_codex":0.00000319847,"about_ca_system_score_gemma":0.000007532862,"threshold_uncertainty_score":0.23604944},"labels":[],"label_agreement":null},{"id":"W1978641196","doi":"10.1016/j.ffa.2013.10.003","title":"On traces of Frobenius endomorphisms","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Endomorphism; Variety (cybernetics); Projective variety; Finite field; Field (mathematics); Projective test; Algebra over a field","score_opus":0.040679750090507796,"score_gpt":0.2900569685996359,"score_spread":0.24937721850912814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978641196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7281848,0.00030637157,0.18652898,0.0019288034,0.00005574894,0.0024167704,0.00022049734,0.00016413242,0.08019387],"genre_scores_gemma":[0.9964639,0.000031346994,0.0018966047,0.00009353675,0.00003832514,0.00052430725,0.000010965605,0.000014947264,0.0009260856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993542,0.000038478498,0.00020457788,0.00016002555,0.000093973176,0.0001487688],"domain_scores_gemma":[0.99701625,0.0023905786,0.000073178526,0.00038305935,0.00007418429,0.000062747575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015935449,0.00010348086,0.00016985947,0.00007960629,0.00008708868,0.00002408915,0.0001783134,0.00009199773,0.0008862109],"category_scores_gemma":[0.00012442753,0.000076301025,0.000050069408,0.0001410747,0.00009514423,0.0000491705,0.00004903448,0.00016826691,0.00011740922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011827694,0.0001703537,0.00005450494,0.000057726378,0.00002849201,1.8972581e-7,0.000651299,0.000003443957,0.0014817152,0.98213834,0.001932223,0.013469892],"study_design_scores_gemma":[0.00024944977,0.000113261594,0.00019027787,0.000019462139,0.000006760504,0.0000021263031,0.00022928046,0.0005155499,0.0037720848,0.9918092,0.0029988906,0.00009366689],"about_ca_topic_score_codex":0.00002865811,"about_ca_topic_score_gemma":0.0000071332615,"teacher_disagreement_score":0.26827905,"about_ca_system_score_codex":0.000004828625,"about_ca_system_score_gemma":0.000011057048,"threshold_uncertainty_score":0.97033876},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006436452121446332,"score_gpt":0.20538693882008718,"score_spread":0.19895048669864085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981349468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041719717,0.009365083,0.9739497,0.008674137,0.000021237172,0.00023010542,0.0000091635575,0.00011374889,0.0034648718],"genre_scores_gemma":[0.973905,0.0036135383,0.020009845,0.0021999476,0.00007824081,0.00014340784,0.000005548198,0.0000050309127,0.000039423547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994786,0.000014674805,0.00010756089,0.00022456475,0.000048552847,0.00012604524],"domain_scores_gemma":[0.9994132,0.00015773157,0.00003044242,0.00029898906,0.000023733928,0.000075925585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076482866,0.000088901186,0.00008652679,0.00009338521,0.00018883619,0.0000703897,0.00021084162,0.00005219287,0.000013839967],"category_scores_gemma":[0.000004526706,0.00006853075,0.00004195009,0.00033652445,0.00007311169,0.0001391664,0.00009885097,0.000100642486,0.000008126862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001020846,0.00007186888,0.00073858944,0.000048523907,0.000027827144,3.8899367e-7,0.000679483,0.0000053429376,0.000087811226,0.67511445,0.001267457,0.32195723],"study_design_scores_gemma":[0.0006034971,0.00014901061,0.020975115,0.00012660515,0.000028887702,0.00006120945,0.00012718975,0.010919246,0.0010974718,0.3886649,0.57661617,0.0006306955],"about_ca_topic_score_codex":0.0000076098954,"about_ca_topic_score_gemma":0.000014731094,"teacher_disagreement_score":0.96973306,"about_ca_system_score_codex":0.0000011191877,"about_ca_system_score_gemma":0.000007726264,"threshold_uncertainty_score":0.2794603},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016561114137719136,"score_gpt":0.20230978912080855,"score_spread":0.18574867498308942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992704551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030896157,0.00011768459,0.95119715,0.001454069,0.00006447892,0.00016859635,0.000020727946,0.00016460702,0.01591651],"genre_scores_gemma":[0.99684113,0.00005468884,0.0018992964,0.0006938692,0.000055147175,0.00012786234,0.000009986171,0.000003595235,0.000314425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954796,0.00001546815,0.00008471103,0.000196398,0.000048316462,0.000107170745],"domain_scores_gemma":[0.9993244,0.00018654548,0.000023666207,0.00038604953,0.000019942992,0.00005941778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053937518,0.000076753655,0.000067837915,0.000050030365,0.0005162872,0.000045382614,0.00021234267,0.000045240067,0.000032105265],"category_scores_gemma":[0.000004799257,0.000061259314,0.000043298074,0.0002468794,0.00005606952,0.000060030256,0.00005794172,0.00011041975,0.00008674484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009527332,0.00019014404,0.000562017,0.0000060472403,0.00002667372,0.0000021934275,0.001597603,0.00015142284,0.00007687622,0.9239805,0.0025710617,0.07082594],"study_design_scores_gemma":[0.0003620072,0.00037310793,0.00490072,0.00001622425,0.000008780257,0.00007941665,0.0000995982,0.011195609,0.0002979806,0.10983022,0.8724963,0.00034003097],"about_ca_topic_score_codex":0.0000059525505,"about_ca_topic_score_gemma":0.0000027870449,"teacher_disagreement_score":0.96594495,"about_ca_system_score_codex":0.0000027037347,"about_ca_system_score_gemma":0.000014432577,"threshold_uncertainty_score":0.3970916},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01674343111415439,"score_gpt":0.23519998467455402,"score_spread":0.21845655356039964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993819992","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18827495,0.0062416717,0.01109993,0.003230568,0.009535103,0.00033974386,0.004603816,0.0014880947,0.7751861],"genre_scores_gemma":[0.9390538,0.007919399,0.0122038545,0.0053094286,0.008196598,0.011340469,0.010063057,0.0045329863,0.0013804534],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.95813584,0.0025530914,0.00885264,0.009179379,0.009952903,0.011326172],"domain_scores_gemma":[0.9621126,0.00907331,0.010136862,0.011139214,0.001289203,0.0062488285],"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.0048860135,0.0018952561,0.003941927,0.008849794,0.009157203,0.01238584,0.012407088,0.8149587],"category_scores_gemma":[0.005496882,0.009881229,0.009772011,0.00776223,0.010003133,0.0074880207,0.011083824,0.00863707,0.0052712043],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062809223,0.0013880627,0.000044226123,0.0044033793,0.007105892,0.0033351458,0.004970148,0.0033397875,0.0038096209,0.45901418,0.50066286,0.0056458064],"study_design_scores_gemma":[0.009786752,0.0065975157,0.00027683604,0.004486235,0.0074996287,0.008073716,0.00628362,0.06191953,0.85869944,0.0007216061,0.027227182,0.0084279645],"about_ca_topic_score_codex":0.008501459,"about_ca_topic_score_gemma":0.007981901,"teacher_disagreement_score":0.8548898,"about_ca_system_score_codex":0.00008519373,"about_ca_system_score_gemma":0.007474287,"threshold_uncertainty_score":0.99815243},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02334978394381537,"score_gpt":0.22113503908946147,"score_spread":0.1977852551456461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000061862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343995,0.00018851564,0.9530397,0.0012224579,0.00017094454,0.00039785678,0.000042127478,0.0000715585,0.011426885],"genre_scores_gemma":[0.9975105,0.000047850008,0.0011649033,0.00093516824,0.000059176633,0.00008185214,0.0000045745965,0.0000057140346,0.00019028407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993557,0.000054549982,0.00016755996,0.00023262315,0.000067634865,0.00012196097],"domain_scores_gemma":[0.99892926,0.00023887343,0.00009982319,0.0006581274,0.00003398156,0.000039935087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012767651,0.0001110647,0.00011587733,0.00007276848,0.00019331777,0.000035268185,0.0004649051,0.00011335463,0.00007862436],"category_scores_gemma":[0.00001758932,0.00007370197,0.000089646026,0.0003464662,0.000063888845,0.00007002057,0.00012145998,0.00012725515,0.000005014197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016959906,0.00012157885,0.0006019831,0.000019107545,0.000038185586,2.1088955e-7,0.004777673,0.00020811017,0.00042393146,0.9753504,0.00096992357,0.017471934],"study_design_scores_gemma":[0.0010018445,0.0005646596,0.012399664,0.00013623686,0.000055324785,0.00001065945,0.00022855597,0.016348777,0.04775205,0.83865315,0.08214315,0.00070593023],"about_ca_topic_score_codex":0.000042976906,"about_ca_topic_score_gemma":0.0000200759,"teacher_disagreement_score":0.9640705,"about_ca_system_score_codex":0.0000031035106,"about_ca_system_score_gemma":0.000022953736,"threshold_uncertainty_score":0.30054793},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01837467303147693,"score_gpt":0.2194095155721322,"score_spread":0.20103484254065526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000470138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05842571,0.000048148966,0.93090224,0.0008913045,0.000042454914,0.00014964976,0.000007877185,0.00011047747,0.009422123],"genre_scores_gemma":[0.99689835,0.00004590153,0.0018433342,0.00093308307,0.0000419786,0.00008527242,0.000005482305,0.0000030454464,0.00014356677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999595,0.000021359068,0.00008375862,0.00017202484,0.0000412186,0.000086638],"domain_scores_gemma":[0.9993759,0.00024086796,0.00003125215,0.00028532685,0.000019995456,0.000046669855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068892194,0.000067524896,0.00006288228,0.0000716084,0.00027644687,0.00002882051,0.00019302327,0.000044975503,0.000021269074],"category_scores_gemma":[0.0000101841,0.000055768905,0.000038023987,0.00020656943,0.000043562643,0.00008988328,0.000044811844,0.00007596524,0.00004437924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045440406,0.000046750432,0.000099016885,0.000003133362,0.000008019653,7.7694295e-7,0.0015701907,0.00004513995,0.00015704366,0.9713881,0.00094830716,0.025728956],"study_design_scores_gemma":[0.0005071282,0.00027172462,0.0032919864,0.000017884473,0.0000070998562,0.000037542446,0.0001417327,0.01460306,0.002160445,0.90022135,0.07835282,0.00038722187],"about_ca_topic_score_codex":0.0000047344993,"about_ca_topic_score_gemma":0.0000026638695,"teacher_disagreement_score":0.9384726,"about_ca_system_score_codex":0.0000031321754,"about_ca_system_score_gemma":0.000012819128,"threshold_uncertainty_score":0.22741899},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012452315119829494,"score_gpt":0.20865475686960527,"score_spread":0.19620244174977577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004773548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11205203,0.00005994388,0.8817404,0.0034883143,0.00003800641,0.0002231274,0.00013469784,0.000038020706,0.0022254754],"genre_scores_gemma":[0.9971621,0.00003665705,0.001932265,0.00075515435,0.000046106128,0.000024104978,0.000019560432,0.0000037218308,0.000020300467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994511,0.000030962954,0.00016224607,0.00017946011,0.0000672407,0.0001089772],"domain_scores_gemma":[0.9984394,0.00096865447,0.00006115799,0.00047082567,0.000026558015,0.000033440483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000651174,0.000091535345,0.00009735406,0.00008507077,0.00013025675,0.000044045402,0.00040333706,0.00008364088,0.000106147665],"category_scores_gemma":[0.000018390541,0.00006414545,0.00004179519,0.000374424,0.00004374506,0.00009925704,0.000069339265,0.00018986182,0.000004171233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058088,0.00006513507,0.0003000475,0.00000360855,0.00001744558,7.5194066e-8,0.0026936778,0.0010101905,0.00027527314,0.9671038,0.00007079527,0.028454175],"study_design_scores_gemma":[0.00029004764,0.00010677391,0.0031483194,0.000048348975,0.000008398824,3.9896926e-7,0.00023540482,0.022178056,0.0032263699,0.95845217,0.012105379,0.00020032036],"about_ca_topic_score_codex":0.000033564622,"about_ca_topic_score_gemma":0.00027045707,"teacher_disagreement_score":0.8851101,"about_ca_system_score_codex":0.000005542337,"about_ca_system_score_gemma":0.000016640983,"threshold_uncertainty_score":0.26157755},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009731903311448296,"score_gpt":0.19865844804746582,"score_spread":0.18892654473601753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011798878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05296427,0.0005041505,0.941877,0.00043342618,0.000022845517,0.000108941946,0.000021055494,0.00003509803,0.0040332205],"genre_scores_gemma":[0.99749,0.000090678106,0.0021516136,0.00004978143,0.000014892202,0.000033745164,0.0000118952075,0.0000021713913,0.00015522978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995179,0.000023759052,0.00015075899,0.00017822151,0.0000456544,0.0000836691],"domain_scores_gemma":[0.99938476,0.00015937716,0.000062303625,0.00032967853,0.000024419222,0.000039457344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010913985,0.000066620196,0.00011509131,0.00020211967,0.00017518831,0.000034920577,0.0001296196,0.000044280143,0.000058837606],"category_scores_gemma":[0.000004762575,0.000057378784,0.0000729831,0.0008324415,0.000055847762,0.00007969611,0.000055427543,0.000077298806,0.000003944412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005740765,0.00009970424,0.0023135287,0.00000886617,0.00024023387,2.28793e-7,0.002953699,0.0007254466,0.00039310864,0.94243884,0.0001439845,0.05067663],"study_design_scores_gemma":[0.00067464064,0.0003569606,0.089083575,0.000029246534,0.00043303805,0.000010687954,0.00093768875,0.5286103,0.0004999823,0.33980894,0.03902097,0.00053401024],"about_ca_topic_score_codex":0.00001027422,"about_ca_topic_score_gemma":0.000014279552,"teacher_disagreement_score":0.9445257,"about_ca_system_score_codex":0.0000036400543,"about_ca_system_score_gemma":0.000002936461,"threshold_uncertainty_score":0.23398389},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017728857083650736,"score_gpt":0.21196420681937672,"score_spread":0.19423534973572598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027233581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32534185,0.0007052521,0.6671084,0.000967691,0.000049092727,0.00047264033,0.000012676371,0.00007593008,0.005266464],"genre_scores_gemma":[0.9958963,0.00010463896,0.0032907971,0.00035518018,0.00002394994,0.00018211923,0.0000018990328,0.0000031650231,0.00014194951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994456,0.00002041063,0.00016519919,0.00018638003,0.00005711502,0.00012528311],"domain_scores_gemma":[0.99939394,0.00012667703,0.00006125973,0.0003200892,0.000046325986,0.00005170609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009372693,0.000088926776,0.00009905671,0.00005715309,0.00013635207,0.000075154225,0.00026129727,0.0000595162,0.00004628992],"category_scores_gemma":[0.000010935523,0.00006687252,0.000033337048,0.00016826463,0.000077837874,0.00021301697,0.00017751877,0.000092030255,0.0000066832895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011234749,0.00014705732,0.0050287778,0.00012609395,0.00005917885,3.4253557e-7,0.0043864474,0.000012913306,0.0015507354,0.7962997,0.00034310043,0.19203445],"study_design_scores_gemma":[0.001130218,0.0006528894,0.02580505,0.00022335346,0.000035400382,0.000015432022,0.0008252588,0.059304554,0.0148887625,0.8445942,0.05157821,0.00094669085],"about_ca_topic_score_codex":0.000033243592,"about_ca_topic_score_gemma":0.000006490259,"teacher_disagreement_score":0.67055446,"about_ca_system_score_codex":0.0000013856667,"about_ca_system_score_gemma":0.000009499919,"threshold_uncertainty_score":0.27269822},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01683112379226085,"score_gpt":0.2086362918083391,"score_spread":0.19180516801607825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028343756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042434804,0.000100412435,0.93606055,0.00087078015,0.000060100712,0.00016980535,0.000011538066,0.00015098436,0.020141054],"genre_scores_gemma":[0.99720967,0.000064762724,0.0012836765,0.0009127927,0.00005892302,0.00009707507,0.0000059508207,0.000004618122,0.00036252697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994883,0.000019330848,0.000093356386,0.0002227568,0.000054163607,0.00012210305],"domain_scores_gemma":[0.9992337,0.00018657034,0.000031198324,0.00047257784,0.000015196776,0.00006073217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057957783,0.000090693815,0.00007755148,0.000069775255,0.0002912404,0.00003592665,0.00035107342,0.00005192494,0.00001926823],"category_scores_gemma":[0.0000036722306,0.0000727885,0.00005051167,0.0001525348,0.000050236904,0.0000935304,0.0001024672,0.0001140397,0.00004023372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072999496,0.000107852924,0.0005452017,0.0000068026466,0.000016508173,0.0000035112798,0.0013338308,0.000035830893,0.000101777005,0.93515515,0.0010786405,0.06160759],"study_design_scores_gemma":[0.0005320808,0.00039416397,0.00949563,0.000035539975,0.000007727823,0.000090920825,0.000054587763,0.018722132,0.0012704325,0.81723464,0.15163949,0.0005226848],"about_ca_topic_score_codex":0.0000045712827,"about_ca_topic_score_gemma":0.000002547055,"teacher_disagreement_score":0.95477486,"about_ca_system_score_codex":0.0000025394345,"about_ca_system_score_gemma":0.000008141411,"threshold_uncertainty_score":0.29682288},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Permutation (music); Monomial; Combinatorics; Cyclic permutation; Discrete mathematics; Symmetric group","score_opus":0.01871378267860119,"score_gpt":0.22158749130205907,"score_spread":0.20287370862345788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032009701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14144301,0.00011192329,0.8512573,0.00049464835,0.00003127813,0.00019574109,0.000016108856,0.00006765275,0.0063823303],"genre_scores_gemma":[0.9980254,0.00004018856,0.0015508357,0.00022814379,0.000023904402,0.00006651537,0.0000048171437,0.0000027154185,0.000057454225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.000021615451,0.00011349555,0.00014899785,0.00004637317,0.000073081326],"domain_scores_gemma":[0.999324,0.00028697136,0.00004968118,0.00027638243,0.000030398925,0.000032514014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007157842,0.00006126522,0.00007987568,0.000068725014,0.0001449075,0.000014174455,0.00020937603,0.000042325446,0.0000246906],"category_scores_gemma":[0.000012118629,0.00005023438,0.000042163014,0.00019337934,0.000048078266,0.000070874805,0.00004449695,0.00005916703,0.000007765191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000923374,0.0000769522,0.0001289171,0.000008103458,0.000012229287,3.014444e-7,0.0017675662,0.000038522023,0.0007813898,0.9547824,0.0002681263,0.04212621],"study_design_scores_gemma":[0.0008128701,0.00063470047,0.012449691,0.000050350467,0.000015315894,0.000029373203,0.0001665791,0.036072552,0.015680896,0.9086536,0.024953023,0.0004810062],"about_ca_topic_score_codex":0.00000461023,"about_ca_topic_score_gemma":8.9791666e-7,"teacher_disagreement_score":0.8565824,"about_ca_system_score_codex":0.0000017735648,"about_ca_system_score_gemma":0.00001247164,"threshold_uncertainty_score":0.20484985},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08230369811034384,"score_gpt":0.31099990927262977,"score_spread":0.22869621116228595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032962521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17670278,0.000040609804,0.77109104,0.00041288402,0.00007505345,0.0008411211,0.00003488985,0.00009972074,0.050701912],"genre_scores_gemma":[0.9978681,0.000017506121,0.0007594988,0.0001328183,0.000073595686,0.00027046262,0.00001076433,0.000013149177,0.00085410645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931675,0.00004107416,0.00018371167,0.00020494305,0.00008025366,0.00017328897],"domain_scores_gemma":[0.9986133,0.0009098702,0.000043853048,0.0003429616,0.00003116311,0.000058856815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021541106,0.000103482635,0.00013026668,0.0000957169,0.00009360521,0.000015560863,0.00012621186,0.00013552418,0.00038891722],"category_scores_gemma":[0.00011612181,0.00008393733,0.000046961548,0.00015582792,0.00004522274,0.00004487382,0.000055322565,0.00025306945,0.00007072233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046919388,0.0011843449,0.0064918124,0.00012915708,0.000095325275,0.0000057863476,0.010317923,0.000013565526,0.00037233537,0.9315493,0.0018434718,0.047527775],"study_design_scores_gemma":[0.0007641993,0.00019879943,0.0033310307,0.000038430793,0.000020246021,0.0000032542362,0.0006325077,0.0044291383,0.0012237574,0.9816084,0.0075231595,0.00022709866],"about_ca_topic_score_codex":0.000103715975,"about_ca_topic_score_gemma":0.00032892622,"teacher_disagreement_score":0.8211653,"about_ca_system_score_codex":0.000011370705,"about_ca_system_score_gemma":0.000014490778,"threshold_uncertainty_score":0.4258371},"labels":[],"label_agreement":null},{"id":"W2042316519","doi":"10.1006/ffta.2000.0294","title":"Intersections of Hyperconics in Projective Planes of Even Order","year":2001,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Projective plane; Projective test; Lift (data mining); Equivalence relation; Pure mathematics; Finite field; Order (exchange); Equivalence (formal languages); Intersection (aeronautics); Complete intersection; Combinatorics; Discrete mathematics; Geometry; Computer science","score_opus":0.012984920197248366,"score_gpt":0.22919723159603048,"score_spread":0.2162123113987821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042316519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15326534,0.00012512966,0.8401434,0.00027474717,0.000027331427,0.00020681633,0.000014214134,0.000024456996,0.0059185917],"genre_scores_gemma":[0.99825275,0.000070023256,0.0015390639,0.000035050703,0.0000089662135,0.00006436969,0.0000023909183,0.0000018199272,0.000025561096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996576,0.0000189048,0.00012325619,0.00011104675,0.000027329892,0.00006188138],"domain_scores_gemma":[0.99951136,0.00018372304,0.00004529925,0.000203353,0.000041331343,0.000014934294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082956205,0.00004731445,0.00008481713,0.00011211989,0.000036207595,0.0000070552337,0.00017215333,0.00003976935,0.000009056088],"category_scores_gemma":[0.000010243772,0.00003948739,0.000026114334,0.0005143807,0.000041565756,0.000064083695,0.00005428071,0.0000698573,8.525421e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002238244,0.00029234117,0.009089455,0.00003399525,0.00003966947,5.327555e-7,0.009019471,0.00016550605,0.000815902,0.8973416,0.00003922057,0.08313992],"study_design_scores_gemma":[0.0011219785,0.0006836226,0.02836381,0.0001690573,0.000024903971,0.000053976586,0.00451755,0.026599513,0.0057459446,0.89115775,0.04103865,0.0005232505],"about_ca_topic_score_codex":0.000055849086,"about_ca_topic_score_gemma":0.00010788929,"teacher_disagreement_score":0.8449874,"about_ca_system_score_codex":0.0000022610545,"about_ca_system_score_gemma":0.000016052125,"threshold_uncertainty_score":0.16102491},"labels":[],"label_agreement":null},{"id":"W2043437898","doi":"10.1016/j.ffa.2013.09.005","title":"A note on the real densities of homogeneous systems in function fields","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; National Natural Science Foundation of China","keywords":"Mathematics; Homogeneous; Formal power series; Series (stratigraphy); Power series; Field (mathematics); Finite field; Homogeneous function; Function (biology); Pure mathematics; Discrete mathematics; Mathematical analysis; Combinatorics","score_opus":0.021416204091962262,"score_gpt":0.24281830313070668,"score_spread":0.22140209903874442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043437898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9424942,0.0002483302,0.036420677,0.00077332184,0.00014082479,0.0010163836,0.000037408776,0.000042968564,0.018825892],"genre_scores_gemma":[0.99901736,0.000082784594,0.000114228664,0.0001598097,0.00006705236,0.00030369588,0.0000033320298,0.0000073534616,0.0002444035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995132,0.00004217298,0.0001857289,0.000108178276,0.000056286393,0.00009443843],"domain_scores_gemma":[0.9983921,0.0011584421,0.00007062319,0.00031430207,0.000044176653,0.000020366973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012420968,0.00008541995,0.00012746631,0.000050457365,0.00013481617,0.000020987658,0.000101745536,0.00011101843,0.00004756685],"category_scores_gemma":[0.000033598957,0.000049283353,0.000038904815,0.00009248674,0.0000586919,0.000023042505,0.00003848105,0.00014188452,0.0000039891206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009733665,0.000029457038,0.00012655911,0.000045049896,0.000018189126,1.5713118e-7,0.0019682983,0.000052279185,0.00009687549,0.99245346,0.0005080602,0.004691866],"study_design_scores_gemma":[0.00011983402,0.00009146157,0.0013538476,0.000040668674,0.000013522933,0.0000035901237,0.0011712282,0.0021899077,0.00029385884,0.9926134,0.0020083818,0.00010030055],"about_ca_topic_score_codex":0.00021818238,"about_ca_topic_score_gemma":0.00006434548,"teacher_disagreement_score":0.056523144,"about_ca_system_score_codex":0.0000048578922,"about_ca_system_score_gemma":0.0000072645335,"threshold_uncertainty_score":0.20097168},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016508143454731904,"score_gpt":0.21830942351021673,"score_spread":0.20180128005548484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043992837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12576401,0.0009880917,0.8714187,0.00038129327,0.000017404323,0.00028681668,0.000013385756,0.000044729873,0.0010855357],"genre_scores_gemma":[0.9969041,0.0003735403,0.0023571488,0.00017300033,0.000020411675,0.000099597244,0.000006953359,0.000003782062,0.00006147231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948335,0.000025734234,0.00012868058,0.00020801269,0.000059219605,0.00009500051],"domain_scores_gemma":[0.9993738,0.0001594781,0.00006289545,0.00031243003,0.000044719905,0.00004666352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009828088,0.000081779166,0.00011213471,0.00006418625,0.00018507334,0.000025902025,0.00016779901,0.000028819304,0.000007010059],"category_scores_gemma":[0.0000063712982,0.00006282337,0.000021694394,0.0002580567,0.000071995906,0.000120534285,0.000058827634,0.00005801773,0.0000016771788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007103724,0.0005940189,0.0052796076,0.0002543151,0.00012835841,0.000001897124,0.01063167,0.00038184092,0.008680541,0.9005025,0.000993858,0.07248037],"study_design_scores_gemma":[0.0126475,0.0057883426,0.06325115,0.0024989215,0.00040771952,0.00075615646,0.0020910816,0.16484997,0.2509455,0.34493038,0.1465167,0.0053165997],"about_ca_topic_score_codex":0.000016989285,"about_ca_topic_score_gemma":0.0000037520713,"teacher_disagreement_score":0.87114006,"about_ca_system_score_codex":0.0000015914309,"about_ca_system_score_gemma":0.00001778212,"threshold_uncertainty_score":0.25618625},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022104913291018904,"score_gpt":0.22909185618093028,"score_spread":0.20698694288991137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052167619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027552327,0.000071620096,0.9528566,0.00012803005,0.00007507153,0.0001776424,0.0000265226,0.00005872268,0.019053467],"genre_scores_gemma":[0.9978312,0.000025081494,0.0014195918,0.0005288463,0.00002571957,0.000058556016,0.0000036798801,0.0000044892167,0.00010282624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993877,0.000028368997,0.00016842941,0.00022158334,0.00006301414,0.0001309342],"domain_scores_gemma":[0.9988821,0.0004379366,0.000076300144,0.0005146109,0.000032578184,0.000056444256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013645805,0.00010043805,0.0001225259,0.00010399955,0.00011996238,0.000025049565,0.00040718916,0.00008953039,0.00010697249],"category_scores_gemma":[0.00001876253,0.00008136086,0.000070588794,0.00027966837,0.00005762155,0.00006703578,0.00011531255,0.000110278335,0.00001629664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017285576,0.00017812451,0.00025015746,0.000011558431,0.000021687827,3.549373e-7,0.0020639806,0.000030003424,0.00008543337,0.96003187,0.00032208778,0.03698748],"study_design_scores_gemma":[0.00085869455,0.0008312311,0.0065251603,0.00008336067,0.000025509373,0.000004166482,0.00014627253,0.009976349,0.011312791,0.9351642,0.03450141,0.0005708353],"about_ca_topic_score_codex":0.0000183905,"about_ca_topic_score_gemma":0.0000044388576,"teacher_disagreement_score":0.97027886,"about_ca_system_score_codex":0.0000021295536,"about_ca_system_score_gemma":0.0000122397805,"threshold_uncertainty_score":0.33177993},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014979619080014842,"score_gpt":0.23719349820474817,"score_spread":0.22221387912473334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061818608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010889271,0.00070050533,0.97575366,0.0010686009,0.00015666572,0.00019582435,0.000019136916,0.00013941502,0.011076886],"genre_scores_gemma":[0.9959759,0.00008936531,0.002017732,0.0012494952,0.00025834868,0.0001420098,0.00000822381,0.0000067876886,0.00025213673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925077,0.000039031405,0.00016045822,0.0002186309,0.00006674863,0.00026435635],"domain_scores_gemma":[0.9986941,0.0005472975,0.000060083614,0.0005453742,0.00002226499,0.00013085722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023119015,0.00013079714,0.00012763469,0.00008808033,0.000252307,0.00009547248,0.0003886521,0.00012379588,0.00010421064],"category_scores_gemma":[0.000018916622,0.00010737631,0.00008202582,0.00030354934,0.00004594204,0.00026762302,0.00017998846,0.00016711846,0.000047467696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068056593,0.00013305925,0.0024982472,0.000015616277,0.00003321529,2.8015907e-7,0.0024387762,0.00001486922,0.00015899244,0.8811672,0.0017776744,0.11175527],"study_design_scores_gemma":[0.00050386594,0.00015392179,0.010310006,0.00003370341,0.000026607391,0.000012132009,0.00015922912,0.005172967,0.0020479036,0.25359988,0.727326,0.0006538026],"about_ca_topic_score_codex":0.000014636153,"about_ca_topic_score_gemma":0.0000051699326,"teacher_disagreement_score":0.9850866,"about_ca_system_score_codex":0.0000043470595,"about_ca_system_score_gemma":0.000012070002,"threshold_uncertainty_score":0.4378679},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008421389931006997,"score_gpt":0.19568288219313698,"score_spread":0.18726149226212999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069444685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032059856,0.00069886993,0.9596441,0.00027621308,0.00005125579,0.00013702478,0.0000060110083,0.00007320473,0.00705346],"genre_scores_gemma":[0.993842,0.00013220072,0.005608473,0.00019233419,0.00003236469,0.00007919794,0.0000024202404,0.000003571026,0.00010741482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952847,0.000029042687,0.00008366254,0.00021051643,0.000035610017,0.00011272369],"domain_scores_gemma":[0.9994544,0.00014460665,0.000024796182,0.00029472006,0.000017465587,0.000064053405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091733134,0.000078917576,0.000071109105,0.000053055697,0.00023845537,0.00008428876,0.0001600974,0.00005154691,0.000020327334],"category_scores_gemma":[0.000005368047,0.00006383878,0.000031418447,0.00016719445,0.000045963454,0.000072091214,0.000057725945,0.00007146583,0.000007819286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010571646,0.00002455399,0.000120650686,0.0000037627917,0.00000824951,4.606068e-7,0.00038624444,9.775613e-7,0.000115181036,0.9687496,0.000045179542,0.030544095],"study_design_scores_gemma":[0.00020078657,0.000064807435,0.00042777954,0.000006910546,0.0000070493466,0.000037025704,0.000060001625,0.0011275429,0.0021945732,0.78185636,0.21382076,0.00019641193],"about_ca_topic_score_codex":0.0000032408464,"about_ca_topic_score_gemma":0.0000041453945,"teacher_disagreement_score":0.96178216,"about_ca_system_score_codex":0.0000013662835,"about_ca_system_score_gemma":0.000008593252,"threshold_uncertainty_score":0.26032698},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030584535267437006,"score_gpt":0.252485138880437,"score_spread":0.22190060361299999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070033202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012343255,0.00012129198,0.97111356,0.00062973343,0.00005749625,0.00044432812,0.00003318731,0.00007362466,0.015183512],"genre_scores_gemma":[0.9862151,0.0000075720836,0.012728676,0.000632229,0.000053193507,0.00025443625,0.000008729155,0.000006265925,0.00009379377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916524,0.00005279088,0.00021403003,0.00030458416,0.00009669882,0.00016663187],"domain_scores_gemma":[0.9986914,0.0003925848,0.00007062518,0.0006180308,0.000071273236,0.00015611433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031780163,0.00012491118,0.00017569451,0.00011255583,0.00009341517,0.00006226247,0.0004891242,0.00010197561,0.000007217818],"category_scores_gemma":[0.00006895393,0.000102645885,0.0000673007,0.00048082642,0.000050749724,0.000096795695,0.00021744931,0.00011877239,0.00000998347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001760927,0.00020303979,0.00014769431,0.000040330084,0.000028995184,2.3356563e-7,0.004320553,0.0015290625,0.000054905227,0.97125715,0.0012860114,0.02111441],"study_design_scores_gemma":[0.00069449143,0.0004492628,0.0012273075,0.00004931292,0.000028974602,0.000010228216,0.00029175467,0.06512024,0.0007276367,0.87223893,0.05863139,0.0005304479],"about_ca_topic_score_codex":0.000028726952,"about_ca_topic_score_gemma":0.000004548159,"teacher_disagreement_score":0.9738718,"about_ca_system_score_codex":0.000006228103,"about_ca_system_score_gemma":0.000045740446,"threshold_uncertainty_score":0.4185778},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01790630992802925,"score_gpt":0.23118940225261408,"score_spread":0.21328309232458484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082081063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72161204,0.004943013,0.025937632,0.0030873257,0.0038004592,0.00024982405,0.0022148325,0.0006613654,0.23749352],"genre_scores_gemma":[0.9824897,0.0042737266,0.0050648353,0.001800051,0.0017046441,0.0021631743,0.0017128563,0.0006308245,0.00016020927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98858756,0.0007722696,0.0025917205,0.0026973074,0.0024126014,0.0029385216],"domain_scores_gemma":[0.98841447,0.0035436545,0.0025442173,0.0035429127,0.00039827253,0.0015564905],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0029055153,0.0012467556,0.00058620534,0.0008870377,0.0025786408,0.0020764535,0.003734244,0.0032198157,0.06902523],"category_scores_gemma":[0.0014100228,0.0021576378,0.0020648194,0.0023978169,0.0022466455,0.0016861185,0.0029192735,0.0024088006,0.001448508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010049231,0.0006969356,0.000058847392,0.0011437925,0.002040361,0.0003135411,0.0035681669,0.0028447583,0.0009030791,0.8795236,0.096198745,0.011703266],"study_design_scores_gemma":[0.004044719,0.0033433954,0.0006793707,0.0015995826,0.0019190491,0.001297006,0.002889163,0.20529129,0.75488985,0.0059354817,0.014671021,0.0034400567],"about_ca_topic_score_codex":0.0038400716,"about_ca_topic_score_gemma":0.0023663498,"teacher_disagreement_score":0.8735881,"about_ca_system_score_codex":0.000017941516,"about_ca_system_score_gemma":0.0016092439,"threshold_uncertainty_score":0.9998927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Mathematics; Scroll; Distribution (mathematics); Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.018506604844418028,"score_gpt":0.23416834247077928,"score_spread":0.21566173762636126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082176354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8785187,0.00029339318,0.076065466,0.0016490045,0.0003801032,0.00010453084,0.00035986127,0.00015624633,0.04247267],"genre_scores_gemma":[0.99677896,0.00020262302,0.0011108523,0.0007010074,0.00035475858,0.0005260333,0.00020619364,0.00004458962,0.00007499673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801075,0.00008604409,0.0005024699,0.00057086954,0.0003575904,0.0004722419],"domain_scores_gemma":[0.9972107,0.0008937196,0.00041764448,0.0012501448,0.00005503176,0.00017279314],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070731994,0.00024396057,0.00014630977,0.0001132893,0.00075484207,0.000355283,0.0009231429,0.00040694457,0.0018703116],"category_scores_gemma":[0.000091354115,0.00028617046,0.00037283415,0.00054945925,0.00027345074,0.00037467043,0.00045273322,0.0004161959,0.0002172091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014407764,0.00013777848,0.000005223025,0.00005895582,0.00013088525,0.0000055274845,0.0007099165,0.0003819503,0.00051508984,0.98351914,0.009734412,0.0046570706],"study_design_scores_gemma":[0.0023006022,0.0010894226,0.00042727322,0.00045113737,0.00036036444,0.00020900207,0.0006705653,0.29356483,0.57436734,0.05730731,0.06801433,0.0012377991],"about_ca_topic_score_codex":0.0001252743,"about_ca_topic_score_gemma":0.00006772496,"teacher_disagreement_score":0.9262118,"about_ca_system_score_codex":0.000005856046,"about_ca_system_score_gemma":0.00016444747,"threshold_uncertainty_score":0.99995905},"labels":[],"label_agreement":null},{"id":"W2091235660","doi":"10.1016/j.ffa.2014.09.011","title":"A finite embedding theorem for partial Steiner 3-designs","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Victoria","keywords":"Steiner system; Mathematics; Combinatorics; Embedding; Steiner tree problem; Prime (order theory); Finite field; Discrete mathematics; Block (permutation group theory); Set (abstract data type); Prime power; Field (mathematics); Pure mathematics; Computer science","score_opus":0.015769703959811483,"score_gpt":0.2272848047400897,"score_spread":0.21151510078027821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091235660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054451213,0.00014999694,0.9858282,0.000086610744,0.00009692054,0.00040226494,0.00006119556,0.0001868462,0.007742826],"genre_scores_gemma":[0.9979257,0.000020130881,0.00058336393,0.00009741882,0.0002682817,0.00084023055,0.00003300016,0.000023503431,0.00020838987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994483,0.000024015646,0.00016485968,0.00015043805,0.000033408513,0.00017897831],"domain_scores_gemma":[0.99904436,0.0005964307,0.000025845393,0.00024649492,0.000023354258,0.000063533014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020380453,0.00012780908,0.00014145268,0.000047821388,0.00015687228,0.000042477055,0.00010790461,0.0001013341,0.000031383635],"category_scores_gemma":[0.00002030769,0.00010441683,0.00006628038,0.00009824819,0.000030882744,0.00004748904,0.000014706832,0.00009386343,0.000019045334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025420437,0.000036304922,0.00006170747,0.0001753815,0.00008830142,1.3148063e-7,0.0015815627,0.01743155,0.0019687628,0.9421729,0.00097251363,0.035485506],"study_design_scores_gemma":[0.00044603655,0.00010776176,0.00002935533,0.000036791807,0.000027098491,0.0000029781986,0.0002933492,0.48497942,0.0030097084,0.14714324,0.36360097,0.00032325686],"about_ca_topic_score_codex":0.0000017510923,"about_ca_topic_score_gemma":0.0000034920877,"teacher_disagreement_score":0.9924806,"about_ca_system_score_codex":0.0000037568648,"about_ca_system_score_gemma":0.0000034416569,"threshold_uncertainty_score":0.42579946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006411509416715652,"score_gpt":0.2189252886992095,"score_spread":0.21251377928249385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096776883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30344808,0.00033227535,0.6913423,0.00081398187,0.000019831172,0.00029917082,0.00001654481,0.000049882427,0.0036779405],"genre_scores_gemma":[0.9978611,0.000051724008,0.0017076859,0.00018911863,0.00002005877,0.00013455494,0.0000040459754,0.0000021943993,0.000029510315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996376,0.000018685509,0.00010298085,0.00013080196,0.000030969175,0.000078970326],"domain_scores_gemma":[0.99950916,0.00018818515,0.00005480753,0.00018184565,0.000028946723,0.00003706996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009509184,0.000055003955,0.00007404885,0.0000643265,0.00011006408,0.000053798016,0.00014507605,0.000042441807,0.000027669894],"category_scores_gemma":[0.000005922989,0.000043893284,0.000021583048,0.00014999033,0.000036660505,0.00015375167,0.00007656468,0.000048166246,0.000006211509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017466687,0.00005826169,0.0022178502,0.000027044534,0.000019371473,7.220126e-8,0.003325196,0.0000022258605,0.0014555313,0.91102314,0.00014275433,0.08172681],"study_design_scores_gemma":[0.00064011157,0.00019353883,0.059127778,0.00003923703,0.000017712957,0.000010127204,0.0009315816,0.009811055,0.005199682,0.8865722,0.037080754,0.0003762295],"about_ca_topic_score_codex":0.000016614998,"about_ca_topic_score_gemma":0.000004351785,"teacher_disagreement_score":0.694413,"about_ca_system_score_codex":9.1918827e-7,"about_ca_system_score_gemma":0.0000062239883,"threshold_uncertainty_score":0.17899162},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013348596356310975,"score_gpt":0.222142416080965,"score_spread":0.20879381972465402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115812217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9657664,0.0029782963,0.0052107316,0.0009784313,0.0012229766,0.0002431269,0.0015150394,0.00047262592,0.021612395],"genre_scores_gemma":[0.9884972,0.0020349412,0.0019795164,0.0010181349,0.0021797477,0.0023242,0.0011968131,0.00063899707,0.00013047423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99094737,0.00040643942,0.0024152645,0.0021953597,0.0015602269,0.0024753269],"domain_scores_gemma":[0.9928451,0.0022713211,0.0012647441,0.0021221337,0.00021197372,0.0012846832],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0020672577,0.0013327936,0.0007283771,0.0006514819,0.0019102783,0.0015633071,0.0018696077,0.003089187,0.0031902005],"category_scores_gemma":[0.0006168755,0.002058022,0.0014163438,0.0013773858,0.0014037781,0.0011803239,0.0013724873,0.0024754244,0.0013029272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007245786,0.0005696903,0.00006327623,0.0011943307,0.0015060272,0.00028341133,0.003326465,0.004592795,0.0017462511,0.9708098,0.0090510575,0.0061323056],"study_design_scores_gemma":[0.00795089,0.0042927396,0.0005608023,0.0044916947,0.0037554048,0.004110519,0.011472718,0.4350056,0.34337714,0.13790876,0.03959022,0.0074835136],"about_ca_topic_score_codex":0.001139768,"about_ca_topic_score_gemma":0.0014719763,"teacher_disagreement_score":0.83290106,"about_ca_system_score_codex":0.000035070436,"about_ca_system_score_gemma":0.0006832489,"threshold_uncertainty_score":0.9999423},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009601733691645173,"score_gpt":0.22736804589570872,"score_spread":0.21776631220406356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119936466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061159395,0.00002215776,0.9239047,0.00071844534,0.00010552697,0.00014181701,0.000022862163,0.00007003347,0.013855029],"genre_scores_gemma":[0.9921511,0.000009421061,0.0073861945,0.00029154654,0.00004346643,0.000066517896,0.000005679522,0.0000038695916,0.000042241685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946505,0.000018686344,0.00015509083,0.00019638572,0.000054681208,0.00011008041],"domain_scores_gemma":[0.99833983,0.0010453542,0.0000732276,0.00043554898,0.00005430419,0.00005176253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012546596,0.00008714108,0.0000993393,0.00009886639,0.00019223108,0.000048317866,0.0003073532,0.00009109172,0.000054728083],"category_scores_gemma":[0.000054094067,0.00007392836,0.000059623995,0.00028512522,0.0000904302,0.000082177066,0.00007580768,0.00025258027,0.000008626822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001923079,0.00003187843,0.00017654171,0.000006939439,0.0000089259975,1.514912e-7,0.0007394163,0.000035517158,0.00044393662,0.9582627,0.000037544174,0.040254556],"study_design_scores_gemma":[0.00024783,0.00013142926,0.0006528342,0.000021935792,0.000009411666,0.00001064473,0.00025666892,0.00949751,0.0034528824,0.9741365,0.011369315,0.00021305645],"about_ca_topic_score_codex":0.0000058849378,"about_ca_topic_score_gemma":0.000015502295,"teacher_disagreement_score":0.93099165,"about_ca_system_score_codex":0.0000010808294,"about_ca_system_score_gemma":0.000019033674,"threshold_uncertainty_score":0.30147108},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008432818511571577,"score_gpt":0.21843358827766687,"score_spread":0.2100007697660953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137465039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016993314,0.00022240092,0.9793292,0.00040515736,0.00003853367,0.00019390511,0.000011267011,0.000045809677,0.0027603589],"genre_scores_gemma":[0.98374075,0.000047190595,0.01597481,0.000094176976,0.000060699756,0.000019706362,0.000011063503,0.0000035608307,0.000048028764],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945885,0.000010826046,0.00018095277,0.00016917886,0.000059720554,0.000120498844],"domain_scores_gemma":[0.99931604,0.00020722846,0.000065883076,0.00032238674,0.000037481357,0.00005101023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017962657,0.0000722176,0.00009072372,0.00011189906,0.0001062657,0.00002622618,0.00023413506,0.00007361503,0.0000052164614],"category_scores_gemma":[0.0000072805583,0.000056215125,0.000049604314,0.00033587014,0.000058093254,0.00007365008,0.00007376375,0.00008782122,0.0000046991377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021631624,0.00042990793,0.0015290035,0.00010789139,0.00005939422,0.0000012691756,0.004685854,0.00006979475,0.005899766,0.35495448,0.00087445223,0.63136655],"study_design_scores_gemma":[0.003689472,0.0010356155,0.06288254,0.00015693929,0.00009051855,0.000078082114,0.0022999363,0.1167426,0.16137257,0.28727114,0.36241302,0.001967566],"about_ca_topic_score_codex":0.000017988163,"about_ca_topic_score_gemma":0.000012263647,"teacher_disagreement_score":0.96674746,"about_ca_system_score_codex":0.0000025566737,"about_ca_system_score_gemma":0.000011592527,"threshold_uncertainty_score":0.22923863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012331227929558845,"score_gpt":0.23025769904817706,"score_spread":0.2179264711186182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169627913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81299156,0.00006842693,0.1736612,0.0009478916,0.00008899298,0.0003484865,0.0000785616,0.00003467155,0.01178023],"genre_scores_gemma":[0.9993934,0.000012628138,0.00033712634,0.000127317,0.000026150166,0.000035732104,0.0000024108247,0.0000035231244,0.000061703206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932843,0.00006165839,0.00024268012,0.00016494094,0.00009767791,0.00010461881],"domain_scores_gemma":[0.99777067,0.0013412097,0.0001710489,0.000648509,0.00004808457,0.00002047186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020031843,0.000097099124,0.00014929993,0.000036058205,0.0001322327,0.000018081835,0.0005279577,0.00009169179,0.000053843713],"category_scores_gemma":[0.000027060689,0.00005341357,0.0001298024,0.00037299644,0.00011184147,0.000048544927,0.0001374636,0.00014050814,0.0000014398144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071343084,0.00018780876,0.006939673,0.00002037692,0.000028577002,2.8398535e-8,0.0008120844,0.00008673645,0.00022684515,0.98982406,0.00045047162,0.001416225],"study_design_scores_gemma":[0.00033332277,0.00013094471,0.061588787,0.000070762806,0.00003774897,0.0000016067721,0.00016483945,0.0027796803,0.039090432,0.88716453,0.0083959745,0.00024138487],"about_ca_topic_score_codex":0.00012817567,"about_ca_topic_score_gemma":0.000017713644,"teacher_disagreement_score":0.18640187,"about_ca_system_score_codex":0.000002657885,"about_ca_system_score_gemma":0.000026236201,"threshold_uncertainty_score":0.21781422},"labels":[],"label_agreement":null},{"id":"W2172054125","doi":"10.1016/j.ffa.2012.09.003","title":"MDS and self-dual codes over rings","year":2012,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dual (grammatical number); Ideal (ethics); Principal ideal; Principal (computer security); Chain (unit); Mathematics; Ring (chemistry); Series (stratigraphy); Power (physics); Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Combinatorics; Physics; Law; Chemistry; Prime (order theory)","score_opus":0.013861690699695112,"score_gpt":0.23410461596485257,"score_spread":0.22024292526515746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172054125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029831128,0.002029268,0.9598468,0.0007113634,0.00016458704,0.0004216426,0.00008003508,0.00035446964,0.0065607065],"genre_scores_gemma":[0.99049646,0.0005151848,0.008071296,0.00034093304,0.00019233576,0.00028488188,0.000020877342,0.000009780569,0.00006823084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991371,0.00003622335,0.00015925575,0.00040331236,0.00006915797,0.00019493054],"domain_scores_gemma":[0.9988354,0.0002793644,0.000091699774,0.0006476946,0.000034054447,0.000111800866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022073228,0.00019635857,0.00018521557,0.00009425982,0.00022552948,0.00021230555,0.00038327157,0.00022952323,0.000020274585],"category_scores_gemma":[0.000005149286,0.00016781632,0.00007094434,0.00014179948,0.00006547198,0.000109195964,0.0010561683,0.0003773717,0.0000077129125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029120015,0.00012604904,0.00081945164,0.00010108381,0.00008209513,4.3481467e-7,0.003439461,0.000009042956,0.000038409686,0.95447063,0.0003324133,0.040577997],"study_design_scores_gemma":[0.00025588777,0.00005838595,0.007318944,0.000076362565,0.00005936717,0.000019248928,0.00007284228,0.008156847,0.00026781918,0.8079646,0.17507827,0.0006713767],"about_ca_topic_score_codex":0.000019090925,"about_ca_topic_score_gemma":0.0000055530286,"teacher_disagreement_score":0.96066535,"about_ca_system_score_codex":0.000005196562,"about_ca_system_score_gemma":0.00002211026,"threshold_uncertainty_score":0.6843351},"labels":[],"label_agreement":null},{"id":"W2275630553","doi":"10.1016/j.ffa.2014.04.002","title":"Roots and coefficients of polynomials over finite fields","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Finite field; Polynomial; Field (mathematics); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.00916860328750755,"score_gpt":0.22305209950568508,"score_spread":0.21388349621817754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275630553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044879206,0.00016090696,0.9505426,0.00041316586,0.000048412243,0.00013944582,0.000015651898,0.000043853,0.003756727],"genre_scores_gemma":[0.9980145,0.000045633362,0.0013392905,0.00043235355,0.00004402987,0.000039498114,0.000003995369,0.0000040121895,0.00007667072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.000037349106,0.00015949263,0.00022420881,0.000056611112,0.00012350094],"domain_scores_gemma":[0.99881583,0.00061641616,0.000070044734,0.00040304515,0.00003134322,0.00006332887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002024686,0.00009514295,0.00013517696,0.000082185274,0.00014160112,0.00005377557,0.00027091635,0.00008632258,0.000019321966],"category_scores_gemma":[0.000027722781,0.000078905316,0.000044576973,0.00022203001,0.00006876804,0.00007624869,0.00015542636,0.00009264883,0.0000038167395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010466598,0.000101824415,0.0015668846,0.000037722457,0.000027474776,1.5686247e-7,0.001191556,0.000100844874,0.00043714631,0.8083384,0.00033481294,0.1878527],"study_design_scores_gemma":[0.0015341537,0.0006717708,0.02597272,0.00011767043,0.000044622288,0.000010937722,0.00014641618,0.09757826,0.0053062197,0.62109697,0.24667771,0.00084255723],"about_ca_topic_score_codex":0.0000130270955,"about_ca_topic_score_gemma":0.000007683088,"teacher_disagreement_score":0.9531353,"about_ca_system_score_codex":0.0000014191148,"about_ca_system_score_gemma":0.000008402735,"threshold_uncertainty_score":0.32176653},"labels":[],"label_agreement":null},{"id":"W2276785395","doi":"10.1016/j.ffa.2015.08.006","title":"On coefficients of Carlitz cyclotomic polynomials","year":2015,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Development Research Centre","keywords":"Mathematics; Cyclotomic polynomial; Polynomial; Reciprocal polynomial; Finite field; Combinatorics; Field (mathematics); Function (biology); Function field; Discrete mathematics; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.07218421197441277,"score_gpt":0.3419888466403706,"score_spread":0.26980463466595783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276785395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55210245,0.00016244128,0.3528501,0.000767161,0.000061669685,0.0012002407,0.00022698252,0.00009383498,0.09253508],"genre_scores_gemma":[0.99813396,0.0000073513525,0.0004318242,0.00007836861,0.00003990743,0.00008624481,0.000008282887,0.000011701458,0.0012023617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939036,0.000040630643,0.00018703057,0.00014307426,0.000111454436,0.00012745366],"domain_scores_gemma":[0.99846995,0.0009114789,0.00006766815,0.00036627456,0.00008445469,0.000100197976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032993435,0.000083015606,0.00016612682,0.000064272026,0.000052564337,0.000012716769,0.00015815368,0.000071818955,0.00005752894],"category_scores_gemma":[0.0001867412,0.00006332242,0.00004003108,0.00013480254,0.00007988848,0.000018548513,0.00006197362,0.000107197586,0.000044809465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051693478,0.00028485944,0.0003018752,0.000050189963,0.000056610017,4.5724346e-7,0.0015358638,0.00003487779,0.00018935934,0.9872887,0.00482926,0.005376247],"study_design_scores_gemma":[0.00053869624,0.00012441653,0.00006503512,0.00002738926,0.000019321818,0.0000031867787,0.00064198213,0.0015331781,0.001960015,0.9845393,0.010416397,0.00013108441],"about_ca_topic_score_codex":0.000026512791,"about_ca_topic_score_gemma":0.0000067925994,"teacher_disagreement_score":0.44603148,"about_ca_system_score_codex":0.000013778323,"about_ca_system_score_gemma":0.00004152459,"threshold_uncertainty_score":0.25822133},"labels":[],"label_agreement":null},{"id":"W2336406799","doi":"10.1016/j.ffa.2016.11.014","title":"On the Poncelet triangle condition over finite fields","year":2016,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Conic section; Projective plane; Combinatorics; Inscribed figure; Invertible matrix; Mathematics; Conjecture; Plane (geometry); Finite field; Incircle and excircles of a triangle; Field (mathematics); Geometry; Pure mathematics","score_opus":0.05243648414017626,"score_gpt":0.31156267990679165,"score_spread":0.2591261957666154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336406799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100487415,0.00021163034,0.8951991,0.017830024,0.00018438358,0.0034303705,0.0023533413,0.00025065546,0.07049174],"genre_scores_gemma":[0.9863119,0.00026268113,0.0013506988,0.0016211194,0.0005159373,0.0051292996,0.00023358774,0.00006303829,0.0045117135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984982,0.00007243194,0.0005083831,0.00048463992,0.00017789933,0.0002584413],"domain_scores_gemma":[0.9919628,0.0060476987,0.00039643128,0.0013986,0.00009820934,0.000096261414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038571583,0.00036044596,0.00041800627,0.00009572708,0.0004032153,0.00013811761,0.00050013076,0.00049169053,0.0010410531],"category_scores_gemma":[0.00028171064,0.00021114049,0.00022361004,0.00013484996,0.000114873335,0.00003283322,0.00033384655,0.0006692997,0.00011168001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007836834,0.00016983722,0.0000034811515,0.00014821936,0.00008519967,3.554022e-7,0.0005505554,0.00001191777,0.000026684947,0.922489,0.07404907,0.0024578415],"study_design_scores_gemma":[0.00023680132,0.000035502173,0.00001507726,0.00018731004,0.00005084769,0.0000015516752,0.000071520895,0.0015588801,0.00021523869,0.91574436,0.081615016,0.00026787553],"about_ca_topic_score_codex":0.000011094169,"about_ca_topic_score_gemma":0.000018806182,"teacher_disagreement_score":0.97626317,"about_ca_system_score_codex":0.000024084064,"about_ca_system_score_gemma":0.000059156107,"threshold_uncertainty_score":0.99987215},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02258834622883974,"score_gpt":0.2630967104058184,"score_spread":0.24050836417697866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392885651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08789494,0.00005518158,0.8997267,0.00146025,0.00011706316,0.00028977258,0.000034541004,0.0000681442,0.010353412],"genre_scores_gemma":[0.9977545,0.000057510046,0.0014482543,0.0004944872,0.000072755174,0.00008008117,0.000005804106,0.0000052458586,0.00008134494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993486,0.0000287792,0.00017883506,0.00024632513,0.00006847391,0.00012898348],"domain_scores_gemma":[0.9984602,0.0005010633,0.00018202102,0.00077011075,0.00003647819,0.00005014534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016342304,0.000112168134,0.00014268958,0.000116119256,0.00044700698,0.00013806832,0.0005337365,0.00010283255,0.00002392682],"category_scores_gemma":[0.000058002977,0.00009726705,0.00008329822,0.00010804017,0.00007238279,0.00018848272,0.0001582639,0.0001305666,0.000011531976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042345586,0.00017086715,0.002844627,0.00007715842,0.00007247355,0.0000017750153,0.007467441,0.00044302887,0.0020041987,0.81250286,0.0005054642,0.17386776],"study_design_scores_gemma":[0.0017817721,0.00054470974,0.057405137,0.0003102589,0.000045958015,0.000009608838,0.00035966132,0.10379616,0.011915545,0.7442705,0.078530855,0.001029812],"about_ca_topic_score_codex":0.000042482443,"about_ca_topic_score_gemma":0.000017461683,"teacher_disagreement_score":0.9098596,"about_ca_system_score_codex":0.00000500055,"about_ca_system_score_gemma":0.000022128794,"threshold_uncertainty_score":0.39664352},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013737985695262056,"score_gpt":0.24933133949012695,"score_spread":0.2355933537948649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541979517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00810649,0.00011901678,0.9873439,0.0021175027,0.000027198168,0.0003606066,0.0000144141195,0.000042587526,0.00186829],"genre_scores_gemma":[0.97667533,0.000097997305,0.022658024,0.0002812104,0.00011990132,0.00008569193,0.0000086736245,0.0000064156893,0.00006674789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938935,0.00001828537,0.0001534046,0.00023440016,0.00006279239,0.0001417531],"domain_scores_gemma":[0.9984897,0.00010329747,0.00015369756,0.0010890977,0.00008853185,0.00007570727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084528605,0.00010545167,0.00013825469,0.000038086047,0.0006979561,0.00016650706,0.0008739082,0.000054398533,0.000008013231],"category_scores_gemma":[0.000011445341,0.0000833314,0.000023983719,0.00014927886,0.000058662976,0.00015417098,0.00039362008,0.00012882601,0.000004163133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002464269,0.000045823195,0.0034498405,0.000027830187,0.0000461458,2.2332021e-7,0.0017571994,0.00088989997,0.0076263794,0.68027735,0.0010453244,0.30480936],"study_design_scores_gemma":[0.002616369,0.00077505194,0.11470324,0.00044683678,0.00006983485,0.00004904067,0.00020870718,0.1937757,0.018866057,0.0707856,0.5956723,0.0020312837],"about_ca_topic_score_codex":0.000017082217,"about_ca_topic_score_gemma":0.00012935032,"teacher_disagreement_score":0.96856886,"about_ca_system_score_codex":0.0000080686395,"about_ca_system_score_gemma":0.000024078105,"threshold_uncertainty_score":0.53681844},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010565505448550283,"score_gpt":0.23184939417082684,"score_spread":0.22128388872227656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571232930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6314146,0.000114894014,0.36222565,0.00035403782,0.00006854343,0.00021804424,0.00006523193,0.000073760406,0.005465263],"genre_scores_gemma":[0.9976497,0.00007375857,0.0021013161,0.000046988924,0.00003968109,0.00004134303,0.000003848778,0.000003683365,0.00003967735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.000016243652,0.00016691569,0.0001789734,0.000059872502,0.00009959543],"domain_scores_gemma":[0.9987954,0.00019607517,0.0001978658,0.0007235219,0.00004566019,0.00004150806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012242401,0.00008504396,0.0001501307,0.00006217232,0.00025294363,0.00006104933,0.00049475505,0.000059206257,0.000017432074],"category_scores_gemma":[0.000012883968,0.00006915479,0.00006488334,0.00008307664,0.00009495688,0.00014093652,0.00017891258,0.00007957795,0.0000034920758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008237664,0.00014652926,0.0053118276,0.00006166263,0.00005663633,4.189623e-7,0.0018042198,8.84426e-7,0.0028300465,0.9700456,0.00005305667,0.019680869],"study_design_scores_gemma":[0.00080700824,0.0003009779,0.30780938,0.00014415686,0.00006299138,0.000012198104,0.00008251378,0.006559628,0.02412113,0.6217694,0.03780157,0.0005289859],"about_ca_topic_score_codex":0.000026358852,"about_ca_topic_score_gemma":0.0000067344054,"teacher_disagreement_score":0.36623514,"about_ca_system_score_codex":0.00000194983,"about_ca_system_score_gemma":0.000012463973,"threshold_uncertainty_score":0.28200504},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01970817639311891,"score_gpt":0.257624574949498,"score_spread":0.23791639855637906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605666455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025409536,0.00006131891,0.9425239,0.007350082,0.00016441254,0.000325535,0.000023818138,0.000095897965,0.024045508],"genre_scores_gemma":[0.9975498,0.000061274,0.0007958012,0.0011325943,0.000090527756,0.00015368014,0.000005109375,0.00000491286,0.00020635706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.000023474848,0.00013530784,0.00028665425,0.000056413108,0.00017050009],"domain_scores_gemma":[0.9984798,0.00038242902,0.000078652454,0.0009798623,0.000021469696,0.00005780655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017337102,0.0001136824,0.000118509124,0.00009913643,0.000396093,0.00023032798,0.00069911627,0.00011164896,0.00002404677],"category_scores_gemma":[0.00003453783,0.000093560295,0.00005873292,0.00011402112,0.000054343505,0.00018432968,0.00018636213,0.00023459988,0.00004159784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000165073,0.00012656806,0.0015357917,0.000013820976,0.00001182245,0.000003221119,0.0017786643,0.000027694652,0.00007316041,0.7651603,0.00017611118,0.23107632],"study_design_scores_gemma":[0.000988205,0.00032522687,0.05814797,0.00013319228,0.000009763101,0.0000069303505,0.00006033084,0.026360877,0.0013032717,0.6660635,0.24591143,0.0006893164],"about_ca_topic_score_codex":0.000024062994,"about_ca_topic_score_gemma":0.000061679835,"teacher_disagreement_score":0.9721402,"about_ca_system_score_codex":0.00000394094,"about_ca_system_score_gemma":0.000012778273,"threshold_uncertainty_score":0.38152778},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014462414056729801,"score_gpt":0.24901569412702437,"score_spread":0.23455328007029458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736709020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25848627,0.00012866815,0.73689455,0.0008353477,0.00007883017,0.00018529792,0.00003086431,0.000037408696,0.0033227564],"genre_scores_gemma":[0.9989496,0.000120936296,0.0006420115,0.00009254253,0.000058144724,0.000046068497,0.0000065879835,0.000004357125,0.00007977062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.000029255258,0.00018894424,0.00025118465,0.00007382149,0.00014630005],"domain_scores_gemma":[0.9988804,0.00024417188,0.00016403185,0.0006234625,0.000029148201,0.00005882704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013990111,0.00011450693,0.0001581556,0.0000827733,0.0005309258,0.00021440396,0.00047449235,0.000094624666,0.000043638527],"category_scores_gemma":[0.000030940686,0.000096490716,0.00006601721,0.00008885852,0.0001383046,0.00021165774,0.00029448717,0.00011244743,0.0000025383881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034363584,0.00016570723,0.0051829214,0.00006935109,0.0000398965,8.8121004e-7,0.002785233,0.000022787415,0.0016557518,0.8965649,0.00009993282,0.093378246],"study_design_scores_gemma":[0.0013760313,0.00034028807,0.13800295,0.000059332393,0.000049900933,0.000011475732,0.00011864846,0.023260895,0.0066170557,0.8262148,0.0034070094,0.0005415946],"about_ca_topic_score_codex":0.00007141126,"about_ca_topic_score_gemma":0.00003503924,"teacher_disagreement_score":0.7404633,"about_ca_system_score_codex":0.0000025257227,"about_ca_system_score_gemma":0.000015460988,"threshold_uncertainty_score":0.40835056},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05837739689131383,"score_gpt":0.3306328660866852,"score_spread":0.27225546919537136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753771241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96442527,0.00025021442,0.023436615,0.0036152562,0.00004667681,0.0011144031,0.00032407462,0.000042278236,0.00674519],"genre_scores_gemma":[0.99844444,0.000047615005,0.0009360728,0.0000285566,0.00004157527,0.00011041318,0.000009504039,0.0000097297425,0.0003721216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993815,0.000058152076,0.00016745133,0.00014640477,0.00011743341,0.0001290631],"domain_scores_gemma":[0.9984508,0.00063136936,0.0002446283,0.00052206195,0.00011238052,0.000038736584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805871,0.00008525702,0.00013903793,0.000037636153,0.0005749724,0.00006804575,0.00026595578,0.0001014749,0.000021253782],"category_scores_gemma":[0.00024318635,0.000061097824,0.00005041546,0.000064662,0.00008122267,0.00008179289,0.00017425137,0.00016812298,0.000003541574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018613335,0.000094381976,0.005085778,0.000130214,0.000089619825,1.3103714e-7,0.0006605513,0.0000018041563,0.007433217,0.98422617,0.00032322283,0.0019362707],"study_design_scores_gemma":[0.0006278684,0.000071257746,0.025936328,0.00008296305,0.00004250308,0.000004214097,0.00019812137,0.0039191204,0.0040999465,0.96038365,0.0044560977,0.000177948],"about_ca_topic_score_codex":0.0000107164715,"about_ca_topic_score_gemma":0.000027338325,"teacher_disagreement_score":0.03401912,"about_ca_system_score_codex":0.0000127069,"about_ca_system_score_gemma":0.000012850413,"threshold_uncertainty_score":0.44222814},"labels":[],"label_agreement":null},{"id":"W2756157712","doi":"10.1016/j.ffa.2018.01.011","title":"A group action on multivariate polynomials over finite fields","year":2018,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Invariant (physics); Combinatorics; Prime power; Polynomial ring; Prime (order theory); Polynomial; Group ring; Invariant theory; Group (periodic table); Action (physics); Finite group; Algebraic number; Discrete mathematics; Pure mathematics; Algebra over a field; Physics; Mathematical physics; Mathematical analysis; Quantum mechanics","score_opus":0.034434389097119385,"score_gpt":0.2819874740633739,"score_spread":0.2475530849662545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756157712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009646717,0.00013154137,0.9830859,0.0010368193,0.00054601155,0.0005950224,0.00011434092,0.00026167478,0.0045820135],"genre_scores_gemma":[0.99275565,0.000191557,0.0041890815,0.0012904446,0.0006312504,0.00063058,0.00007443474,0.000019343353,0.00021765285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842227,0.00010707744,0.00031312197,0.0007643866,0.00012453915,0.0002686277],"domain_scores_gemma":[0.99745744,0.00083820504,0.0002255433,0.0012977953,0.000064053704,0.000116971685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003191303,0.00032767866,0.00029255755,0.00023003618,0.0003716336,0.000300939,0.00083885057,0.00052330294,0.00009629052],"category_scores_gemma":[0.000036018555,0.0002822124,0.00020386782,0.00027684952,0.00008442305,0.00012550682,0.00081601733,0.0006767129,0.000057399466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011243845,0.00050622056,0.00017214459,0.00018615743,0.00028634316,0.0000026465577,0.003483073,0.00043166574,0.00036727148,0.7804618,0.0037239278,0.21026629],"study_design_scores_gemma":[0.00058127247,0.00039266088,0.0022279061,0.00022393542,0.000048008467,0.0000044431904,0.0000525861,0.031607203,0.0009269014,0.84620404,0.116849884,0.0008811762],"about_ca_topic_score_codex":0.000082406776,"about_ca_topic_score_gemma":0.000035687524,"teacher_disagreement_score":0.98310894,"about_ca_system_score_codex":0.000016752687,"about_ca_system_score_gemma":0.0000383656,"threshold_uncertainty_score":0.999963},"labels":[],"label_agreement":null},{"id":"W2766579298","doi":"10.1016/j.ffa.2018.02.002","title":"Existence of primitive 1-normal elements in finite fields","year":2018,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Dimension (graph theory); Primitive element; Normal basis; Prime (order theory); Linear subspace; Mathematics; Subspace topology; Space (punctuation); Vector space; Physics; Finite field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.022613683833424547,"score_gpt":0.25630218835844,"score_spread":0.23368850452501544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766579298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023036905,0.0002762477,0.96212566,0.0004179093,0.00014878093,0.00054658373,0.00010673636,0.00006581514,0.013275389],"genre_scores_gemma":[0.9871552,0.00022062272,0.011736101,0.00028775452,0.00008898732,0.0003847746,0.00003680154,0.000007803029,0.00008194891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870867,0.000067504014,0.00040570958,0.000490773,0.00010840672,0.00021894752],"domain_scores_gemma":[0.9982658,0.0004624375,0.00023282395,0.0008714972,0.00010350179,0.00006394004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033279383,0.00020748566,0.00026694578,0.00021058977,0.00010773336,0.00007175301,0.0009318076,0.0002777597,0.000039428818],"category_scores_gemma":[0.000031522894,0.00019029301,0.000113267444,0.00034827317,0.00012750897,0.000099258454,0.0010730636,0.00045061557,0.000007648288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004651913,0.00047223276,0.005020967,0.0003888408,0.00014727657,0.0000036090214,0.009916935,0.00027539863,0.000057329406,0.85640943,0.00034741324,0.12691407],"study_design_scores_gemma":[0.0004764176,0.00029066196,0.006933183,0.0003827455,0.000024481116,0.0000035809067,0.00021304133,0.021199523,0.0015489244,0.95431405,0.013993726,0.00061967655],"about_ca_topic_score_codex":0.000032666565,"about_ca_topic_score_gemma":0.000041828655,"teacher_disagreement_score":0.9641183,"about_ca_system_score_codex":0.0000087946655,"about_ca_system_score_gemma":0.00006256217,"threshold_uncertainty_score":0.77599233},"labels":[],"label_agreement":null},{"id":"W2792649475","doi":"10.1016/j.ffa.2018.01.010","title":"On Kassel–Reutenauer q-analog of the sum of divisors and the ring <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:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">[</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy=\"false\">]</mml:mo><mml:mo stretchy=\"false\">/</mml:mo><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">[</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy=\"false\">]</mml:mo></mml:math>","year":2018,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Modulo; Combinatorics; Ideal (ethics); Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.019204811637206273,"score_gpt":0.23950862681162424,"score_spread":0.22030381517441797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792649475","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36342117,0.004578489,0.0031023214,0.0028269812,0.0066972617,0.0002866132,0.0037820127,0.0010103729,0.61429477],"genre_scores_gemma":[0.9598454,0.00562852,0.0045624287,0.004147713,0.0070885746,0.007641246,0.0060574743,0.004141905,0.0008867281],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96246755,0.0028202834,0.008434645,0.007518195,0.009172461,0.009586861],"domain_scores_gemma":[0.96372914,0.01014747,0.010399099,0.009515555,0.0011786503,0.0050300625],"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.008961865,0.004225381,0.001722103,0.0030844703,0.007681879,0.006435873,0.011081129,0.011251291,0.79147583],"category_scores_gemma":[0.0067103007,0.008289819,0.008197543,0.0065549,0.009972243,0.005269265,0.00982758,0.008337848,0.0047108172],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006935307,0.0014229814,0.00006425753,0.003990476,0.008331268,0.0021374389,0.0061118104,0.0031549535,0.002776526,0.45293307,0.50705016,0.0050917366],"study_design_scores_gemma":[0.009709313,0.005674311,0.00017194604,0.0046482733,0.008534983,0.0055703223,0.010394943,0.00960298,0.92189264,0.0073196753,0.009076302,0.007404293],"about_ca_topic_score_codex":0.008775235,"about_ca_topic_score_gemma":0.0086669335,"teacher_disagreement_score":0.91911614,"about_ca_system_score_codex":0.000083111976,"about_ca_system_score_gemma":0.006054267,"threshold_uncertainty_score":0.9995805},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010066950594523047,"score_gpt":0.22809398191401584,"score_spread":0.2180270313194928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794445524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040297925,0.0017018823,0.9505438,0.0015450354,0.00012497816,0.00033909024,0.000032624903,0.0000786137,0.0053360495],"genre_scores_gemma":[0.99590963,0.0005605595,0.002131078,0.0012029888,0.000056967838,0.00004813274,0.0000075243606,0.0000060900334,0.000077035394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923646,0.000028293698,0.00018542631,0.0002780683,0.00010215355,0.00016957303],"domain_scores_gemma":[0.9987504,0.00045041283,0.0000610071,0.000596147,0.00007379509,0.000068237845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011117056,0.00012389784,0.00014657584,0.00014059848,0.00019919033,0.000037752354,0.0003871694,0.00010666258,0.00006814997],"category_scores_gemma":[0.000022478358,0.000097122975,0.00009974949,0.00050916633,0.00016408433,0.0000849844,0.000093239614,0.00013969332,0.000016328875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014666387,0.00030161496,0.00096259,0.00015120162,0.00009729325,0.0000014802126,0.0024589973,0.000051412386,0.0004929654,0.9633962,0.0027667237,0.029304884],"study_design_scores_gemma":[0.0010277526,0.0015776086,0.011447041,0.0005428561,0.00007686361,0.00001663356,0.00020139695,0.030513529,0.013016165,0.8832954,0.05737894,0.00090581574],"about_ca_topic_score_codex":0.000031708674,"about_ca_topic_score_gemma":0.000017967837,"teacher_disagreement_score":0.9556117,"about_ca_system_score_codex":0.0000023648333,"about_ca_system_score_gemma":0.000018711367,"threshold_uncertainty_score":0.396056},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.018511220055682745,"score_gpt":0.23542736778320295,"score_spread":0.21691614772752021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962898640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069922246,0.00008793593,0.89575183,0.003585964,0.00018775501,0.00062166096,0.0001238174,0.00018449976,0.029534299],"genre_scores_gemma":[0.99696594,0.000031523527,0.0010048448,0.0013735846,0.00008298902,0.00010155562,0.00003257564,0.0000075512858,0.00039943273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913436,0.000048906186,0.00020694527,0.00036686714,0.00007802134,0.00016489503],"domain_scores_gemma":[0.99831814,0.00084335526,0.00008965115,0.0006516109,0.000036476173,0.000060787243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020071704,0.00013670026,0.00014018155,0.00010335293,0.00015672743,0.00011743521,0.00036362352,0.000110645866,0.00007938352],"category_scores_gemma":[0.00001794078,0.000113504255,0.000078743265,0.00024812628,0.000030435755,0.0001383695,0.000098786615,0.00017043196,0.00017092274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009470054,0.0001437116,0.00043863006,0.000027321707,0.000055978155,8.781657e-7,0.005225862,0.0015333837,0.00045531077,0.9002365,0.0011327683,0.090654984],"study_design_scores_gemma":[0.0021626495,0.00084682176,0.010873586,0.000097479984,0.0000223297,0.000006469046,0.00035381792,0.10588157,0.0010862179,0.524185,0.35356706,0.0009170002],"about_ca_topic_score_codex":0.000013669605,"about_ca_topic_score_gemma":0.00000862883,"teacher_disagreement_score":0.9270437,"about_ca_system_score_codex":0.0000059310846,"about_ca_system_score_gemma":0.000014038352,"threshold_uncertainty_score":0.46285692},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02653378148374149,"score_gpt":0.28064708906698926,"score_spread":0.2541133075832478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963590413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19777709,0.00014918682,0.79169905,0.00028236205,0.000046290374,0.00051042915,0.00010100487,0.00005816736,0.009376427],"genre_scores_gemma":[0.9935485,0.00009816938,0.0037944457,0.00027122934,0.000056862275,0.00013364632,0.000027431894,0.000020576403,0.002049137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991814,0.000023562736,0.0002798698,0.00023655365,0.00009464259,0.00018399468],"domain_scores_gemma":[0.99801433,0.0011557635,0.00013240657,0.00055733614,0.00007422964,0.000065946784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121747406,0.00015785446,0.00026344354,0.00009169573,0.00009012272,0.00001612491,0.00018245495,0.00019601427,0.00025192118],"category_scores_gemma":[0.000044068114,0.00012895485,0.000085418054,0.0002574806,0.00004262026,0.000114770315,0.00008849155,0.00020183327,0.000015364298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021347141,0.0001470368,0.00075748836,0.00023365472,0.00006292578,4.842577e-7,0.0013352347,0.0012637237,0.00018765549,0.9831695,0.00031651693,0.012504423],"study_design_scores_gemma":[0.00031781863,0.0000626804,0.00011933855,0.0000419551,0.000018344052,0.000001630662,0.00020326371,0.011944181,0.0010402038,0.977067,0.008993309,0.00019027866],"about_ca_topic_score_codex":0.0000140332595,"about_ca_topic_score_gemma":0.000016049038,"teacher_disagreement_score":0.7957714,"about_ca_system_score_codex":0.000006822245,"about_ca_system_score_gemma":0.000025061847,"threshold_uncertainty_score":0.52586263},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.00568083153776056,"score_gpt":0.2003904576498935,"score_spread":0.19470962611213294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963687249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83027256,0.0010274197,0.14466643,0.00067914993,0.00025985035,0.0007488776,0.00018138436,0.00036198786,0.021802364],"genre_scores_gemma":[0.9987016,0.00019049844,0.00013054234,0.00009002746,0.00020872112,0.00018064564,0.00004254263,0.000015985375,0.00043944665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993987,0.000030158706,0.00017732538,0.00015678097,0.00006360018,0.00017345347],"domain_scores_gemma":[0.9992469,0.0003437543,0.00008994688,0.00017225636,0.00009447907,0.000052683245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002815248,0.00014473256,0.00016402273,0.000062659565,0.00027991165,0.000064320484,0.00008263527,0.00020422672,0.00003698135],"category_scores_gemma":[0.000033754764,0.00011908855,0.00004083532,0.00018659384,0.000030040275,0.00011281566,0.0000363867,0.0001762259,0.00003265266],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018282748,0.0007331779,0.14675799,0.0012270643,0.0036833035,0.0000016517574,0.120094046,0.000389584,0.10959379,0.25542212,0.030967824,0.33094665],"study_design_scores_gemma":[0.0017532388,0.00038676593,0.017288152,0.00023176032,0.00010972657,0.000007701302,0.0068346504,0.06403915,0.083908536,0.11430718,0.7097645,0.0013686592],"about_ca_topic_score_codex":0.000009806278,"about_ca_topic_score_gemma":0.000024292307,"teacher_disagreement_score":0.67879665,"about_ca_system_score_codex":0.00004363093,"about_ca_system_score_gemma":0.0000068580293,"threshold_uncertainty_score":0.48562902},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010380977272338545,"score_gpt":0.20909048490546786,"score_spread":0.1987095076331293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963692803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032982618,0.00039542813,0.9582075,0.0005412353,0.000029267623,0.00024911648,0.00002029934,0.000055217504,0.0075193136],"genre_scores_gemma":[0.9977571,0.0000103901875,0.0017979777,0.00026691548,0.000039910672,0.000086600434,0.0000022036322,0.0000031261768,0.000035811987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964654,0.000021890304,0.000076281525,0.00010776278,0.00004021367,0.00010728289],"domain_scores_gemma":[0.99929994,0.00027620766,0.0000443814,0.00031287593,0.000016876362,0.00004971757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010018914,0.000068681664,0.00008775431,0.000049291575,0.0000744072,0.000018578363,0.00018473236,0.000043839023,0.000017741118],"category_scores_gemma":[0.000005130311,0.000045162073,0.000029526602,0.00017516199,0.000039114093,0.000077016855,0.000040086503,0.000069819456,0.0000039016354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014677796,0.00006929526,0.00047971145,0.000009044715,0.000016612797,5.291411e-8,0.0014520282,0.000005308172,0.00013301293,0.98423535,0.00014611265,0.013438814],"study_design_scores_gemma":[0.0026718322,0.0018313687,0.019327931,0.00018881085,0.00008021,0.000039513772,0.00040708703,0.0020356376,0.022157935,0.71864825,0.2314684,0.001143032],"about_ca_topic_score_codex":0.000004596464,"about_ca_topic_score_gemma":0.000001958774,"teacher_disagreement_score":0.9647744,"about_ca_system_score_codex":0.0000013727125,"about_ca_system_score_gemma":0.0000072952457,"threshold_uncertainty_score":0.18416558},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015100497092835462,"score_gpt":0.22195010277631844,"score_spread":0.20684960568348298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963971814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07145831,0.00007329065,0.9210679,0.0015302392,0.000036051802,0.00016783096,0.00003372671,0.000023174527,0.005609471],"genre_scores_gemma":[0.99878275,0.000044308585,0.000740072,0.00033353362,0.000018161767,0.000046248508,0.0000032166804,0.000002659277,0.000029060486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995062,0.0000504446,0.00018428593,0.00012175579,0.000066333116,0.000071002425],"domain_scores_gemma":[0.99708533,0.002250753,0.00012602106,0.00044930316,0.00006552857,0.000023083998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017441674,0.00006872163,0.00012086058,0.000082273706,0.00009386328,0.000012203015,0.00035411012,0.000055116772,0.000022857179],"category_scores_gemma":[0.000077298675,0.00004599403,0.00007296118,0.00027636383,0.00010704788,0.00006445602,0.00007315515,0.000088185734,0.0000020017367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000318947,0.000050945986,0.000115229515,0.000020260068,0.000014605699,1.4225102e-8,0.0008920131,0.00017055188,0.00022081625,0.9925535,0.000112701,0.0058462215],"study_design_scores_gemma":[0.00013373856,0.00022401272,0.0009523924,0.00003972589,0.000011987273,5.256564e-7,0.00022419069,0.0110460315,0.007583516,0.9750093,0.004687341,0.00008720951],"about_ca_topic_score_codex":0.000011045971,"about_ca_topic_score_gemma":0.0000062937224,"teacher_disagreement_score":0.9273244,"about_ca_system_score_codex":0.0000010012949,"about_ca_system_score_gemma":0.000015662725,"threshold_uncertainty_score":0.18755822},"labels":[],"label_agreement":null},{"id":"W2967737995","doi":"10.1016/j.ffa.2020.101687","title":"Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables","year":2020,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond","keywords":"Mathematics; Polynomial ring; Ring (chemistry); Skew; Polynomial; Automorphism; Diagonal; Finite field; Pure mathematics; Field (mathematics); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.021477965358708686,"score_gpt":0.24511429906311336,"score_spread":0.22363633370440467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967737995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002948682,0.0001663421,0.99073654,0.0015908632,0.000119217846,0.00054250995,0.00026402975,0.00009631334,0.0035354977],"genre_scores_gemma":[0.9863568,0.00017030307,0.012782096,0.00015170165,0.00010037367,0.0002610257,0.00012789785,0.000012063045,0.00003771972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986003,0.000070113776,0.0005941424,0.00043793747,0.00012840224,0.00016911712],"domain_scores_gemma":[0.99792784,0.0006567756,0.00040571115,0.0007979512,0.0001233405,0.00008836196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023272222,0.0002454423,0.00038686438,0.00020126079,0.0001495681,0.00006751397,0.0008012107,0.00035840325,0.00004772872],"category_scores_gemma":[0.000033982316,0.00022713256,0.00021133678,0.00045171307,0.000098003766,0.00015243416,0.00041087277,0.00046955983,0.000003090881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006493873,0.00039074532,0.00020665862,0.00073848147,0.00028801494,3.970012e-7,0.00923062,0.0017556621,0.00530805,0.9074941,0.0004198268,0.07410246],"study_design_scores_gemma":[0.0009488296,0.00024558682,0.005896609,0.00029776286,0.0001496864,0.0000032721132,0.00010490028,0.33967695,0.0048880232,0.6171929,0.029832425,0.0007630724],"about_ca_topic_score_codex":0.00010988447,"about_ca_topic_score_gemma":0.000020198553,"teacher_disagreement_score":0.98340815,"about_ca_system_score_codex":0.000008401676,"about_ca_system_score_gemma":0.00008051037,"threshold_uncertainty_score":0.92621976},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.032688250973175355,"score_gpt":0.2962821853801588,"score_spread":0.2635939344069835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985590478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.423787,0.0001712677,0.4463159,0.002625428,0.00012809897,0.0019302479,0.0001724619,0.0002907695,0.124578804],"genre_scores_gemma":[0.99439335,0.000020444764,0.0017525739,0.00022886178,0.00009819502,0.00021403273,0.000019174242,0.000022411501,0.0032509586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990996,0.00006353761,0.00018766125,0.0002616481,0.00012756347,0.00025998426],"domain_scores_gemma":[0.99759924,0.0016852464,0.00007204855,0.0004905204,0.00007008433,0.00008283157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003919702,0.00013970879,0.00020657296,0.00006452162,0.00014873367,0.000049173774,0.00021420278,0.00018963167,0.00069682795],"category_scores_gemma":[0.000085235115,0.00011553112,0.00007156224,0.00021275748,0.00005357358,0.00008051812,0.00014025474,0.00035018267,0.0003452849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000478676,0.000355664,0.007227526,0.00019617174,0.00011690739,0.0000014313634,0.0020898532,0.000004682254,0.0014418508,0.94496995,0.0017716802,0.041776396],"study_design_scores_gemma":[0.00041647805,0.00012652928,0.00178307,0.000016761069,0.000012908935,0.000006502621,0.00026892923,0.0025917015,0.00068519684,0.9589591,0.03487173,0.0002611062],"about_ca_topic_score_codex":0.000017831086,"about_ca_topic_score_gemma":0.000021286081,"teacher_disagreement_score":0.57060635,"about_ca_system_score_codex":0.000016502261,"about_ca_system_score_gemma":0.000023650986,"threshold_uncertainty_score":0.7629777},"labels":[],"label_agreement":null},{"id":"W3015616116","doi":"10.1016/j.ffa.2021.101936","title":"A Bertini type theorem for pencils over finite fields","year":2021,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Type (biology); Mathematics; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics; Geology","score_opus":0.043471680164715094,"score_gpt":0.30190738431159386,"score_spread":0.2584357041468788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015616116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09065495,0.0015579181,0.88267034,0.001530007,0.000537353,0.0023521632,0.000608324,0.00023141626,0.019857548],"genre_scores_gemma":[0.9869648,0.00033535046,0.0059937662,0.00086611544,0.0005233288,0.0013605583,0.00046879315,0.00005872958,0.003428557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841946,0.0000734778,0.00046633926,0.0005988489,0.00012476121,0.00031707957],"domain_scores_gemma":[0.99458283,0.0037749824,0.0002565088,0.0010420023,0.00022418663,0.00011950306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004617008,0.00036929175,0.0005108708,0.00009593063,0.00026617182,0.00013633615,0.00040005537,0.00074148504,0.00079413666],"category_scores_gemma":[0.00056787615,0.00031546995,0.0002682734,0.00022228342,0.0000897843,0.00005459318,0.0005229866,0.0007182953,0.000018246934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013974262,0.00055674004,0.00019559331,0.0018262912,0.0006876649,0.000004051906,0.008591908,0.00010994474,0.000085476124,0.9575555,0.007968831,0.02227829],"study_design_scores_gemma":[0.00030066504,0.000067148874,0.000082849365,0.0001485867,0.00012332198,0.0000045915767,0.00064554985,0.0010988418,0.00047039497,0.9652013,0.031436663,0.00042007328],"about_ca_topic_score_codex":0.00002270984,"about_ca_topic_score_gemma":0.000036835492,"teacher_disagreement_score":0.89630985,"about_ca_system_score_codex":0.000017144683,"about_ca_system_score_gemma":0.00012717709,"threshold_uncertainty_score":0.9999297},"labels":[],"label_agreement":null},{"id":"W3060607878","doi":"10.1016/j.ffa.2021.101866","title":"A lower bound on HMOLS with equal sized holes","year":2021,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Equipartition theorem; Order (exchange); Product (mathematics); Orthogonal array; Matrix (chemical analysis); Finite field; Discrete mathematics; Physics; Statistics; Geometry; Mathematical analysis; Quantum mechanics","score_opus":0.012524983623596338,"score_gpt":0.21026574907780426,"score_spread":0.19774076545420793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3060607878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37194386,0.0027999072,0.57901734,0.00034197452,0.00055025285,0.0016378555,0.0005332267,0.0006440742,0.042531494],"genre_scores_gemma":[0.9980458,0.00015765557,0.00016291275,0.00010248962,0.00015873573,0.0009625209,0.000165382,0.000035394438,0.00020913176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992412,0.000028813887,0.00019128826,0.00029794252,0.00007356661,0.00016723653],"domain_scores_gemma":[0.9990717,0.00020102688,0.000046352154,0.000570492,0.000039219514,0.00007120415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000873815,0.0002511188,0.00027766093,0.0000651503,0.00011015021,0.00015441488,0.0001664406,0.00028682203,0.0000679816],"category_scores_gemma":[0.0000049188357,0.00019715342,0.00008565133,0.00011794303,0.00006300873,0.000027641972,0.000079292164,0.0005045076,0.000016898162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005730262,0.0013373722,0.0005208552,0.0054367604,0.003936555,0.00009077928,0.02070685,0.12406445,0.0039508822,0.7533225,0.004361075,0.08169894],"study_design_scores_gemma":[0.004934608,0.001450819,0.0018268545,0.005522685,0.0006460009,0.00014577564,0.008042322,0.044030562,0.0123003535,0.45583954,0.45794815,0.007312329],"about_ca_topic_score_codex":0.000009344372,"about_ca_topic_score_gemma":0.00002758849,"teacher_disagreement_score":0.6261019,"about_ca_system_score_codex":0.00001035534,"about_ca_system_score_gemma":0.000027191058,"threshold_uncertainty_score":0.8039683},"labels":[],"label_agreement":null},{"id":"W3090820254","doi":"10.1016/j.ffa.2020.101756","title":"Orchards in elliptic curves over finite fields","year":2020,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Elliptic curve; Line (geometry); Finite field; Plane (geometry); Finite set; Point (geometry); Schoof's algorithm; Plane curve; Supersingular elliptic curve; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Quarter period","score_opus":0.07438725129718662,"score_gpt":0.3235188237041549,"score_spread":0.2491315724069683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090820254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16259459,0.005925869,0.7019187,0.04816653,0.00021223888,0.005436117,0.00067556126,0.0007598151,0.07431057],"genre_scores_gemma":[0.99370074,0.0008746951,0.00091237767,0.0030259842,0.00018329555,0.00047328175,0.00004635589,0.000035075318,0.0007482088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987514,0.00008751982,0.00034249463,0.00035277955,0.00015947371,0.00030634168],"domain_scores_gemma":[0.99711764,0.0021502716,0.00007211502,0.00044385763,0.000055629822,0.00016050847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032343445,0.00019319609,0.00028554918,0.00009467808,0.0001112611,0.00004574556,0.00032391373,0.00018481744,0.000718698],"category_scores_gemma":[0.00045369248,0.00016472954,0.000078357414,0.0004953677,0.00008632504,0.00009217766,0.00017979996,0.00052682054,0.00010423734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018362758,0.0006837281,0.0047390405,0.0028834138,0.00018621307,0.000023507431,0.013252061,0.0001456324,0.00055775186,0.92231786,0.029603468,0.025423685],"study_design_scores_gemma":[0.0014964449,0.00040592081,0.0015579347,0.0004069654,0.000051031748,0.000008071621,0.0008364559,0.02676773,0.0007273766,0.81888944,0.1479899,0.000862704],"about_ca_topic_score_codex":0.000021031243,"about_ca_topic_score_gemma":0.000045650148,"teacher_disagreement_score":0.8311061,"about_ca_system_score_codex":0.000012616934,"about_ca_system_score_gemma":0.000039070987,"threshold_uncertainty_score":0.78692394},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009924961351266281,"score_gpt":0.22295115900243867,"score_spread":0.2130261976511724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200192232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05883568,0.00020987904,0.938339,0.00042601608,0.00006046037,0.00036051564,0.000031323645,0.0000978033,0.0016393122],"genre_scores_gemma":[0.9969167,0.000015918635,0.0022767417,0.00030905526,0.000028677465,0.00033446247,0.000012166732,0.0000063819243,0.00009990108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992116,0.000058050497,0.00017879822,0.00028506212,0.00011568061,0.00015078693],"domain_scores_gemma":[0.9989625,0.00044110982,0.00009986473,0.00041366508,0.000035738045,0.000047127316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020268772,0.000104412866,0.00013514144,0.00012212539,0.00038733523,0.00006032357,0.00036276487,0.000042552776,0.000059849033],"category_scores_gemma":[0.000011774346,0.00008999806,0.000050814062,0.00051886763,0.000027471526,0.0001219123,0.00020465902,0.00016935669,0.0000024568722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024401321,0.0013770189,0.0034846251,0.00014069559,0.00028785472,0.0000038543762,0.022927826,0.011039501,0.0048631174,0.82011807,0.001800082,0.13371333],"study_design_scores_gemma":[0.004820829,0.0059466613,0.004439861,0.0001951197,0.00021489902,0.000071777264,0.0018572294,0.40200686,0.049115326,0.15028027,0.3787282,0.0023229735],"about_ca_topic_score_codex":0.00002118708,"about_ca_topic_score_gemma":0.000005367291,"teacher_disagreement_score":0.938081,"about_ca_system_score_codex":0.0000094198585,"about_ca_system_score_gemma":0.000041495907,"threshold_uncertainty_score":0.3670014},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009206383225221415,"score_gpt":0.22017459575699758,"score_spread":0.21096821253177617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210620791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075444356,0.0005176003,0.9798112,0.002251866,0.00014727701,0.00035157375,0.0001797192,0.00007108979,0.00912526],"genre_scores_gemma":[0.99842864,0.000084459505,0.00021174937,0.00060359214,0.00004932887,0.00036893916,0.000008884232,0.0000042081647,0.00024018076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993324,0.00007551992,0.00016922153,0.0001933042,0.00009221458,0.00013731672],"domain_scores_gemma":[0.997939,0.0013983566,0.000099233366,0.00049370097,0.00003117406,0.000038542654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026871334,0.000085499865,0.00010111725,0.00006414318,0.00069966406,0.0000548189,0.0005949294,0.00004349292,0.00011158326],"category_scores_gemma":[0.000020643847,0.00006301792,0.000079172794,0.000390335,0.00007814497,0.00006725125,0.00040265702,0.00021069746,0.0000026515036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002013043,0.000069188485,0.00027889418,0.000005213233,0.000043835935,4.105223e-7,0.0018460115,0.00019699706,0.00004945916,0.8632082,0.002097539,0.13218413],"study_design_scores_gemma":[0.00031157685,0.00021204002,0.0023191248,0.0000074433374,0.000009949694,0.000004977623,0.0005821257,0.011454242,0.0005718179,0.43719915,0.5471068,0.00022073656],"about_ca_topic_score_codex":0.000020996544,"about_ca_topic_score_gemma":0.0000131725155,"teacher_disagreement_score":0.99088424,"about_ca_system_score_codex":0.0000048312486,"about_ca_system_score_gemma":0.000028374776,"threshold_uncertainty_score":0.53813213},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015861239519083786,"score_gpt":0.2287484881883779,"score_spread":0.21288724866929412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307815954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046965748,0.00061420986,0.9459894,0.002157882,0.00016608053,0.00039770553,0.000207419,0.00028918596,0.003212394],"genre_scores_gemma":[0.987794,0.000088297704,0.009811233,0.0011230309,0.00018706801,0.0006961292,0.00006656068,0.000012657414,0.00022106187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990486,0.000059241556,0.00018603298,0.00040697056,0.00010563069,0.00019354845],"domain_scores_gemma":[0.9986898,0.00048565594,0.00007837309,0.00064055936,0.000026143452,0.00007951786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017189833,0.0001493229,0.00015630088,0.00011663022,0.00074390415,0.00007309897,0.00077041093,0.000048965972,0.0003574774],"category_scores_gemma":[0.000005651315,0.00011871188,0.000082857965,0.000553413,0.00006172877,0.00011972392,0.0005762913,0.00027026382,0.000025564332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008165405,0.00032262676,0.0014876775,0.000017316203,0.000120602286,0.0000108614095,0.002724336,0.00026712372,0.0014478954,0.9322208,0.0020007328,0.05929833],"study_design_scores_gemma":[0.0006079656,0.00021724054,0.0011089067,0.000015322606,0.000020820264,0.000019195064,0.00020294114,0.057532277,0.00057981093,0.5074009,0.43186864,0.00042598372],"about_ca_topic_score_codex":0.00006289707,"about_ca_topic_score_gemma":0.00002863778,"teacher_disagreement_score":0.9408282,"about_ca_system_score_codex":0.000010554392,"about_ca_system_score_gemma":0.000035867346,"threshold_uncertainty_score":0.57215846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06146125525131579,"score_gpt":0.3233821245151931,"score_spread":0.2619208692638773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315880697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582769,0.00017376358,0.031746704,0.00068055827,0.00003171186,0.00082908734,0.0005233613,0.0001286538,0.0076092426],"genre_scores_gemma":[0.99778724,0.0002480834,0.0012277465,0.000047991456,0.000023592469,0.00024273702,0.00005496841,0.000018086534,0.00034955208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992822,0.00005256129,0.00024238824,0.00017876505,0.000101252044,0.0001428635],"domain_scores_gemma":[0.9979946,0.0013845799,0.00008267062,0.00035204322,0.00013332586,0.000052787094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025820913,0.000104994346,0.00019027667,0.00019982317,0.00011207727,0.0000119459155,0.00010694068,0.000105008534,0.00010691188],"category_scores_gemma":[0.00014396648,0.00008401673,0.000050974108,0.00053831236,0.0001364116,0.000030916526,0.00007356261,0.0001370275,0.000008156837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040257117,0.000121555386,0.00085313653,0.00021364508,0.0000667787,3.6014384e-7,0.0010605833,0.000014631617,0.0011277618,0.9914889,0.0009809214,0.004031488],"study_design_scores_gemma":[0.00031721097,0.00022655414,0.0018609682,0.00004275978,0.000020478716,0.0000016534015,0.0005106987,0.0010173848,0.0019169928,0.99209124,0.001877095,0.000116951625],"about_ca_topic_score_codex":0.000020478701,"about_ca_topic_score_gemma":0.00002543034,"teacher_disagreement_score":0.039510325,"about_ca_system_score_codex":0.0000031639395,"about_ca_system_score_gemma":0.000019169218,"threshold_uncertainty_score":0.34261027},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03999686515164369,"score_gpt":0.28590159084937333,"score_spread":0.24590472569772964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319302498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95737857,0.00020200899,0.032230712,0.0005519164,0.00007034416,0.00031668931,0.00015662548,0.0001924918,0.008900649],"genre_scores_gemma":[0.9966919,0.00029886383,0.0010259742,0.0001507619,0.00008398917,0.0000905758,0.000053495627,0.000016464439,0.0015879787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999292,0.00003283836,0.00024414607,0.00018707121,0.000081739796,0.00016218095],"domain_scores_gemma":[0.99830705,0.001168719,0.00008742713,0.00032950164,0.000057027053,0.000050291408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020965222,0.00013131496,0.00020610346,0.0001121601,0.00013811664,0.000013756525,0.00015005619,0.0001629562,0.00021619516],"category_scores_gemma":[0.000103033424,0.000104840095,0.00006574082,0.0005505469,0.00008195441,0.00004649551,0.00007906077,0.00015317334,0.000045388733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014604643,0.0006925853,0.0048241755,0.0010146801,0.000620796,0.0000066245075,0.016390273,0.0007822466,0.0050151506,0.8856419,0.0265171,0.058348455],"study_design_scores_gemma":[0.0007304157,0.00016844683,0.0025354752,0.00006427618,0.000072080635,0.0000040866717,0.0030847222,0.0066000777,0.012132914,0.9000957,0.07401936,0.0004924621],"about_ca_topic_score_codex":0.000026610973,"about_ca_topic_score_gemma":0.00001442704,"teacher_disagreement_score":0.05785599,"about_ca_system_score_codex":0.0000028994893,"about_ca_system_score_gemma":0.000017775445,"threshold_uncertainty_score":0.4275255},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024333156700218014,"score_gpt":0.22919570255133512,"score_spread":0.2048625458511171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324056828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0804367,0.00009111832,0.91240865,0.0028141541,0.0001151783,0.00028365466,0.000052131803,0.000097445176,0.0037009593],"genre_scores_gemma":[0.9988327,0.00006575047,0.00026900505,0.00053112133,0.000029365887,0.00012069596,0.000010629554,0.0000046731834,0.00013606013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993025,0.000048717862,0.00020770868,0.00020210209,0.00011324156,0.00012572114],"domain_scores_gemma":[0.9968617,0.002348044,0.00009514014,0.00059288775,0.00006334054,0.000038908616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024177371,0.00009998261,0.00012948396,0.00015814549,0.00021982983,0.000024262867,0.0003383999,0.00007529347,0.00008767365],"category_scores_gemma":[0.000057057885,0.0000661216,0.000117347285,0.00090807345,0.00010328376,0.000058716818,0.00012493209,0.00015431596,0.000015685844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007695382,0.000056522837,0.00012073843,0.000013936477,0.000026906675,2.2271551e-7,0.00057517766,0.00041919277,0.00024039997,0.99235463,0.001540637,0.0046439446],"study_design_scores_gemma":[0.00017636573,0.00015476871,0.007530937,0.00004427133,0.000013159267,0.000001328455,0.00017078924,0.015811423,0.00086577865,0.97104394,0.0040535326,0.0001336759],"about_ca_topic_score_codex":0.000009685164,"about_ca_topic_score_gemma":0.000008483752,"teacher_disagreement_score":0.918396,"about_ca_system_score_codex":0.0000015013314,"about_ca_system_score_gemma":0.000019645438,"threshold_uncertainty_score":0.26963606},"labels":[],"label_agreement":null},{"id":"W4365506037","doi":"10.1016/j.ffa.2023.102198","title":"Zigzag polynomials, Artin's conjecture and trinomials","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Defence Academy","keywords":"Mathematics; Trinomial; Divisibility rule; Finite field; Combinatorics; Fibonacci number; Lucas sequence; Sequence (biology); Recursion (computer science); Order (exchange); Binomial coefficient; Discrete mathematics; Prime (order theory); Galois group; Pure mathematics; Fibonacci polynomials; Difference polynomials; Orthogonal polynomials","score_opus":0.012760571223991579,"score_gpt":0.22200973988702838,"score_spread":0.2092491686630368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365506037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1304658,0.0007539966,0.8515383,0.008837642,0.00014890007,0.0005720246,0.00007369955,0.00068313803,0.00692651],"genre_scores_gemma":[0.9982547,0.00015673804,0.00071305374,0.00045794324,0.00008735556,0.00012282813,0.000009572818,0.0000049851055,0.00019283556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994203,0.000028814991,0.00011942855,0.00024492748,0.000037382706,0.00014915464],"domain_scores_gemma":[0.9991619,0.00038612637,0.000040188414,0.00032579995,0.000015095526,0.00007086897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019068488,0.0000936165,0.00011171783,0.00010377772,0.00023465001,0.00011130481,0.00022451876,0.000074497184,0.000013834956],"category_scores_gemma":[0.000012627804,0.00007558473,0.0000390973,0.00041159647,0.000052068546,0.000081662714,0.00015852453,0.00009893358,0.000028712644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004248638,0.000017627894,0.00026259274,0.0000127546355,0.000018314582,9.0388136e-7,0.0009756841,0.00000806194,0.0005607068,0.8719052,0.0014799462,0.12475393],"study_design_scores_gemma":[0.0004643616,0.00011729087,0.0053883055,0.000018034192,0.000012285056,0.00001456464,0.00019344036,0.003988028,0.0020954642,0.68133557,0.3060267,0.00034593092],"about_ca_topic_score_codex":0.0000073719793,"about_ca_topic_score_gemma":0.0000053228705,"teacher_disagreement_score":0.86778885,"about_ca_system_score_codex":0.0000018040588,"about_ca_system_score_gemma":0.000012548757,"threshold_uncertainty_score":0.30822557},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02085775382021079,"score_gpt":0.25358558741738507,"score_spread":0.23272783359717428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365506139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034928944,0.00025691156,0.9536173,0.0034651787,0.00020092654,0.00032525463,0.000048242655,0.00051541923,0.0066418527],"genre_scores_gemma":[0.9948682,0.0002388082,0.00180967,0.0015891482,0.00018603883,0.0002837446,0.00003004646,0.000010397732,0.0009839085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991181,0.00004645375,0.00018881101,0.00033038954,0.00007724781,0.00023903609],"domain_scores_gemma":[0.99858963,0.00061004516,0.0000579632,0.00061943085,0.000030195284,0.000092713875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023176231,0.00013956199,0.00015118583,0.00016351622,0.0003075175,0.00014534501,0.00048025115,0.00012710798,0.0000965307],"category_scores_gemma":[0.000023176095,0.000118009106,0.000103148865,0.00076749385,0.00004691583,0.00013315116,0.00023966408,0.00015303327,0.000105568084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009424034,0.00004931025,0.00030864723,0.000018214749,0.000044854507,0.0000024176707,0.0015427517,0.00017697246,0.00034470105,0.9221196,0.0067928364,0.068590224],"study_design_scores_gemma":[0.000574975,0.00010796173,0.002578606,0.000022780374,0.000015529944,0.000006414792,0.00009219105,0.03398161,0.0011730806,0.55120194,0.4097767,0.00046821966],"about_ca_topic_score_codex":0.000022652628,"about_ca_topic_score_gemma":0.000013316014,"teacher_disagreement_score":0.9599393,"about_ca_system_score_codex":0.00000383184,"about_ca_system_score_gemma":0.000021015296,"threshold_uncertainty_score":0.48122716},"labels":[],"label_agreement":null},{"id":"W4385595281","doi":"10.1016/j.ffa.2023.102271","title":"Remarks on Catalan's equation over function fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Simons Foundation","keywords":"Mathematics; Prime (order theory); Combinatorics; Field (mathematics); Degree (music); Function (biology); Catalan; Finite field; Ring (chemistry); Constant (computer programming); Function field; Pure mathematics; Physics; Humanities","score_opus":0.035167971368443705,"score_gpt":0.2767362607782514,"score_spread":0.2415682894098077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385595281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22098434,0.00008603946,0.71983886,0.0026038105,0.00030785956,0.0009195458,0.00010438558,0.0006152072,0.054539952],"genre_scores_gemma":[0.99536294,0.00004323215,0.00013233081,0.0004453942,0.00019159669,0.0002278831,0.00014358391,0.000014631489,0.003438432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936455,0.000030497657,0.00016384314,0.00020629825,0.00008631393,0.00014848178],"domain_scores_gemma":[0.9984352,0.0010775413,0.00006361577,0.00034422372,0.000028694474,0.000050703107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002618276,0.00011360636,0.00011628522,0.00010579963,0.00020411852,0.000026693462,0.00008909821,0.000161432,0.00026222257],"category_scores_gemma":[0.000099073455,0.00009304803,0.000050749157,0.0003525488,0.000028047487,0.000057282003,0.00004530329,0.00018374734,0.00020130281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045102646,0.00009940878,0.00023882846,0.00007784509,0.00005694115,8.564749e-7,0.0011178049,0.000036447436,0.00007941664,0.9537883,0.014550637,0.029908404],"study_design_scores_gemma":[0.00021329576,0.00008680099,0.0016987676,0.000022451397,0.00002065371,0.0000017746655,0.0002905943,0.0013489801,0.0003066035,0.9638024,0.03205931,0.00014836514],"about_ca_topic_score_codex":0.000010244595,"about_ca_topic_score_gemma":0.000010094632,"teacher_disagreement_score":0.7743786,"about_ca_system_score_codex":0.000007748536,"about_ca_system_score_gemma":0.000010383377,"threshold_uncertainty_score":0.37943888},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.045168188106215174,"score_gpt":0.2780125608051152,"score_spread":0.23284437269890004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386179316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9296966,0.0001059532,0.050279353,0.00034325075,0.00001822451,0.00029891764,0.000037712867,0.0001245572,0.019095406],"genre_scores_gemma":[0.9969428,0.000042315372,0.0021688861,0.00003489511,0.000024439354,0.00008017963,0.0000071376267,0.000008409237,0.0006909177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995564,0.000013991323,0.00012551506,0.00012934588,0.00006550455,0.00010923616],"domain_scores_gemma":[0.99881095,0.0008122498,0.00006655136,0.00023513353,0.000042143874,0.00003300423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791638,0.0000767407,0.00012594995,0.000051479426,0.000107036365,0.00000978802,0.00010883732,0.000051460745,0.000053770116],"category_scores_gemma":[0.000040932257,0.000053980293,0.000025272815,0.0003663594,0.000071104245,0.00003562856,0.000043132393,0.00007898691,0.000019343632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003502563,0.00012704104,0.0022855294,0.00034124116,0.00011621176,0.0000020644038,0.0068521635,0.000035996854,0.0010424771,0.97158974,0.00046557974,0.017106937],"study_design_scores_gemma":[0.0002818601,0.00010705055,0.001091096,0.00008171508,0.00003411961,0.000009536856,0.004833073,0.00048767732,0.0059619485,0.980247,0.006653797,0.00021112012],"about_ca_topic_score_codex":0.0000068783493,"about_ca_topic_score_gemma":0.000005783454,"teacher_disagreement_score":0.06724619,"about_ca_system_score_codex":0.0000021790872,"about_ca_system_score_gemma":0.000012751723,"threshold_uncertainty_score":0.22012526},"labels":[],"label_agreement":null},{"id":"W4386234502","doi":"10.1016/j.ffa.2023.102281","title":"On the number of irreducible factors with a given multiplicity in function fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplicity (mathematics); Mathematics; Pure mathematics; Function field; Field (mathematics); Mathematical analysis","score_opus":0.03546094611135513,"score_gpt":0.2800566401133997,"score_spread":0.24459569400204456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386234502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784064,0.0000076892475,0.014128953,0.0004621116,0.000030422967,0.00034047378,0.00003781284,0.00004261929,0.006543491],"genre_scores_gemma":[0.9993815,0.000015519709,0.00010017071,0.00009246508,0.000021632291,0.00013627723,0.0000092372275,0.000008514606,0.0002347143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995397,0.000027636292,0.0001320034,0.00013603363,0.00006216736,0.000102470774],"domain_scores_gemma":[0.99809945,0.0014951043,0.00005775571,0.00030230344,0.000024414583,0.000020985795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013660359,0.00008921544,0.000115529714,0.000052838885,0.00014691052,0.00000959121,0.00010403109,0.00008606956,0.00008791515],"category_scores_gemma":[0.000054750944,0.000046663245,0.000036078007,0.00029785655,0.00005852467,0.000022589331,0.000044345157,0.00016726647,0.000004125461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034287463,0.000056286728,0.0053533344,0.000036271987,0.00003417894,1.8527842e-7,0.0034868154,0.00006149283,0.000026320547,0.98874116,0.0007048999,0.0014647471],"study_design_scores_gemma":[0.00018385162,0.000054715183,0.012532183,0.000029472321,0.000010881861,8.9208623e-7,0.0011245323,0.00060794275,0.00037643174,0.98372304,0.0012675812,0.00008847178],"about_ca_topic_score_codex":0.000035374786,"about_ca_topic_score_gemma":0.000046136185,"teacher_disagreement_score":0.020975042,"about_ca_system_score_codex":0.0000035555838,"about_ca_system_score_gemma":0.000007118847,"threshold_uncertainty_score":0.19028719},"labels":[],"label_agreement":null},{"id":"W4387497966","doi":"10.1016/j.ffa.2023.102314","title":"Automorphisms of the supersingular isogeny graph","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Isogeny; Mathematics; Automorphism; Graph; Supersingular elliptic curve; Discrete mathematics; Combinatorics; Pure mathematics; Elliptic curve","score_opus":0.027698175965219347,"score_gpt":0.2586124202650988,"score_spread":0.23091424429987945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387497966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8758995,0.0003394593,0.1032774,0.0043680635,0.00020235703,0.0009905107,0.00020240778,0.00032900737,0.014391328],"genre_scores_gemma":[0.9984163,0.000033945365,0.00035634259,0.00011644362,0.00004023636,0.000072867966,0.000008751101,0.000009519091,0.0009455648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953383,0.000028626746,0.00014444374,0.00011628996,0.000064463035,0.00011231786],"domain_scores_gemma":[0.9989709,0.0005378901,0.000053901622,0.0003769678,0.000030216195,0.000030101011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020047673,0.00007617291,0.000111284375,0.000056604065,0.00017907351,0.000008113751,0.00017535524,0.0000763414,0.0000930792],"category_scores_gemma":[0.000057726837,0.000049247377,0.00007958236,0.00054482097,0.00010533591,0.000021675389,0.00008194192,0.00010230942,0.00002108464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043713485,0.000069295886,0.0006822816,0.000081355545,0.00006151335,3.0090695e-7,0.0023022443,0.000007928469,0.0008395406,0.9873821,0.0034176572,0.0051513948],"study_design_scores_gemma":[0.00009862494,0.0000141852015,0.0009605452,0.000015877946,0.000018191253,0.0000032933888,0.00051494536,0.00014837357,0.0029053956,0.9835863,0.011669449,0.00006481548],"about_ca_topic_score_codex":0.000005774958,"about_ca_topic_score_gemma":0.0000028532104,"teacher_disagreement_score":0.12251686,"about_ca_system_score_codex":0.0000024488359,"about_ca_system_score_gemma":0.000011663313,"threshold_uncertainty_score":0.20082498},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010885680740948258,"score_gpt":0.23387814785765237,"score_spread":0.22299246711670412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393305872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09997293,0.0008505319,0.8939076,0.0009550425,0.00016385029,0.0002025107,0.000113345006,0.0001467394,0.0036874488],"genre_scores_gemma":[0.9948229,0.0000404169,0.004703444,0.00012125696,0.00013144911,0.000073478615,0.000040692394,0.000006986587,0.000059381422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992115,0.000048904323,0.00025925788,0.00029305063,0.00006895917,0.000118323704],"domain_scores_gemma":[0.9986354,0.0008982399,0.000077333025,0.00029535562,0.00004571497,0.000047932117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019512519,0.00011151553,0.0001493552,0.00014103268,0.0001334426,0.00015873776,0.00024205152,0.00010645584,0.00008614255],"category_scores_gemma":[0.000021827027,0.00009798867,0.00008296439,0.00035384184,0.00006922,0.0002267802,0.000075610646,0.00013044821,0.0000109947405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059632857,0.000022001474,0.00029053574,0.00004089342,0.000048986494,7.173779e-7,0.0034677563,0.000012777709,0.004474009,0.75806874,0.00013933446,0.23342825],"study_design_scores_gemma":[0.00045590798,0.0001869975,0.0020085706,0.00020051924,0.000068642126,0.000026879377,0.0024959566,0.04700802,0.043876853,0.88258827,0.020485176,0.0005982144],"about_ca_topic_score_codex":0.000046878446,"about_ca_topic_score_gemma":0.000021295033,"teacher_disagreement_score":0.89484996,"about_ca_system_score_codex":0.000008375072,"about_ca_system_score_gemma":0.00003999567,"threshold_uncertainty_score":0.3995862},"labels":[],"label_agreement":null},{"id":"W4396758762","doi":"10.1016/j.ffa.2024.102442","title":"Nilpotent linearized polynomials over finite fields, revisited","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Nilpotent; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.013120139164921706,"score_gpt":0.24181829841122354,"score_spread":0.22869815924630182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396758762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014061386,0.0020199632,0.988697,0.002538851,0.0001498365,0.0002801759,0.000045127355,0.0003278699,0.0045350245],"genre_scores_gemma":[0.99377877,0.0004113016,0.0032926425,0.0013920479,0.00026008204,0.00017678547,0.000027095006,0.000011593989,0.0006496986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905676,0.0000457367,0.0002240192,0.00039950784,0.00007911823,0.00019483788],"domain_scores_gemma":[0.9985059,0.00075143535,0.000039996346,0.00057815155,0.000033180113,0.00009137485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024384631,0.00015462944,0.00016275705,0.0001502304,0.00021316134,0.0003449959,0.00040612835,0.00013238407,0.000120449615],"category_scores_gemma":[0.000024635177,0.00012278743,0.00013073983,0.00058006914,0.00004357314,0.00016763584,0.00018645918,0.00024641267,0.00006518346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012190407,0.00006632439,0.000062407766,0.00007824331,0.000084536114,0.000004770264,0.0012285686,0.00005844908,0.00044028732,0.8245704,0.00426554,0.16912827],"study_design_scores_gemma":[0.00027491132,0.00010719367,0.00027208586,0.000111457404,0.00002730184,0.0000110256215,0.00003590747,0.07404081,0.00066935783,0.27616057,0.6479151,0.00037423888],"about_ca_topic_score_codex":0.0000129521395,"about_ca_topic_score_gemma":0.0000036554566,"teacher_disagreement_score":0.99237263,"about_ca_system_score_codex":0.0000056970166,"about_ca_system_score_gemma":0.000028457322,"threshold_uncertainty_score":0.50071263},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06740493582419127,"score_gpt":0.33190591223308574,"score_spread":0.2645009764088945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401421447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12245485,0.0020357643,0.6039794,0.013879904,0.000106563806,0.0020332455,0.00047627426,0.00026665133,0.25476733],"genre_scores_gemma":[0.99540234,0.00005068273,0.000343553,0.00007390595,0.00005256713,0.00014494703,0.0000032370383,0.000011456342,0.0039173127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952483,0.000035455385,0.00013888894,0.00012082334,0.000075658834,0.00010431599],"domain_scores_gemma":[0.9955558,0.004038854,0.000025254592,0.00032169092,0.000028936574,0.00002943316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003662642,0.00006890363,0.000104133236,0.000045657187,0.000092100076,0.000037287165,0.00015062321,0.00004893688,0.00048507308],"category_scores_gemma":[0.00010993191,0.00003782608,0.000047114812,0.00016871217,0.00008035776,0.000022535303,0.00005073205,0.0001444432,0.00005080447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040546006,0.000026979238,0.000010409555,0.0000509246,0.00003952544,2.0313635e-7,0.00040519662,0.0000034186414,0.00012804219,0.991599,0.004607258,0.003124948],"study_design_scores_gemma":[0.000037063128,0.000028427621,0.000012428994,0.000045755914,0.000013588688,0.000001667408,0.00033286677,0.0023767569,0.0012893919,0.9730199,0.02278928,0.000052884505],"about_ca_topic_score_codex":0.000015464735,"about_ca_topic_score_gemma":0.000010253449,"teacher_disagreement_score":0.87294745,"about_ca_system_score_codex":0.0000058502505,"about_ca_system_score_gemma":0.000026673506,"threshold_uncertainty_score":0.531121},"labels":[],"label_agreement":null},{"id":"W4401579488","doi":"10.1016/j.ffa.2024.102492","title":"The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Mathematics; Subspace topology; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.013864434196348545,"score_gpt":0.2738438776061649,"score_spread":0.2599794434098164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401579488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98437977,0.0026315537,0.009118723,0.000611871,0.00012054204,0.00044580258,0.000724279,0.000053707798,0.0019137666],"genre_scores_gemma":[0.9975777,0.0009929332,0.0012271807,0.0000326662,0.000039225142,0.000041171475,0.00001947781,0.000014393531,0.000055201413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928254,0.000054197848,0.00029972664,0.00017385303,0.00006993264,0.000119744676],"domain_scores_gemma":[0.99723583,0.0021940728,0.00008762018,0.00041126568,0.000042227053,0.000029001996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011557179,0.0001236586,0.00019524992,0.00009459582,0.00013434592,0.000026260604,0.00022289886,0.00014023767,0.000032712764],"category_scores_gemma":[0.000048254242,0.0000741718,0.00008266994,0.0002728652,0.00019293875,0.000037928046,0.00007850873,0.0002364108,3.4321184e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010816482,0.00002004607,0.0009645583,0.000082293365,0.00006178779,2.958069e-7,0.0020107944,0.0000046772334,0.001397804,0.9915145,0.0002372467,0.0036951525],"study_design_scores_gemma":[0.00008173596,0.00002209824,0.0019389894,0.0000687914,0.000023860464,0.0000016990577,0.0005469334,0.00029689085,0.0028929685,0.989808,0.0042381715,0.000079835176],"about_ca_topic_score_codex":0.00008073401,"about_ca_topic_score_gemma":0.00041900223,"teacher_disagreement_score":0.013197997,"about_ca_system_score_codex":0.0000050790172,"about_ca_system_score_gemma":0.00002567605,"threshold_uncertainty_score":0.30246386},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014667909028146828,"score_gpt":0.2384795716512006,"score_spread":0.22381166262305377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403537073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027899467,0.0012285686,0.98140436,0.0015756504,0.00017328339,0.00018444331,0.000036530142,0.00027719245,0.012329992],"genre_scores_gemma":[0.99601835,0.00020133275,0.0018323839,0.00077642,0.00015378841,0.0001779351,0.0000107399965,0.000008424236,0.00082060735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992389,0.000027615399,0.0001558825,0.0003311616,0.00006282052,0.00018361842],"domain_scores_gemma":[0.9987047,0.00068836566,0.000025523852,0.0004858858,0.000023196975,0.00007235775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019358011,0.000123438,0.00011465866,0.00012495888,0.00020428684,0.00032054973,0.000372661,0.000107279426,0.00014597952],"category_scores_gemma":[0.00001173425,0.00009930574,0.000084642685,0.00049068313,0.000040284915,0.00021399242,0.00016298449,0.00019045483,0.000066782486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002530864,0.000029107387,0.000055436838,0.0000327719,0.000029691575,0.0000016816119,0.00086986757,0.000052237527,0.00010949957,0.917572,0.0023966846,0.07884849],"study_design_scores_gemma":[0.000099062665,0.00006143136,0.0001870709,0.00003699128,0.000010035709,0.000004794821,0.000038250466,0.02663424,0.00058955455,0.425203,0.54692304,0.00021251444],"about_ca_topic_score_codex":0.000016170205,"about_ca_topic_score_gemma":0.000009644186,"teacher_disagreement_score":0.99322844,"about_ca_system_score_codex":0.0000048812194,"about_ca_system_score_gemma":0.000029516686,"threshold_uncertainty_score":0.40495706},"labels":[],"label_agreement":null},{"id":"W4403964093","doi":"10.1016/j.ffa.2024.102536","title":"Quasi-polycyclic and skew quasi-polycyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math>","year":2024,"lang":"lv","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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Carleton University","keywords":"Skew; Mathematics; Computer science","score_opus":0.01852373439247834,"score_gpt":0.24274089607668084,"score_spread":0.2242171616842025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403964093","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3448591,0.004399036,0.043265868,0.0021843982,0.0021355026,0.00008600784,0.00045083344,0.00043457007,0.60218465],"genre_scores_gemma":[0.99035096,0.0021729437,0.0022300188,0.0015365769,0.001286646,0.0013767664,0.00042845632,0.00030448547,0.0003131477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.994551,0.00025675612,0.0011503136,0.0015900836,0.0009859519,0.0014659006],"domain_scores_gemma":[0.99427074,0.0019344494,0.00081365847,0.0021574865,0.00006381191,0.0007598631],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012716504,0.0006364525,0.0002615555,0.0004936169,0.0016889034,0.0020800917,0.0017852584,0.0015257781,0.13682336],"category_scores_gemma":[0.0002631232,0.0011010725,0.0010280728,0.0013882073,0.0011910237,0.0010336968,0.0015440345,0.0013137134,0.00095457555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039170246,0.0002767424,0.0000135649225,0.00066234334,0.00081768906,0.0002110548,0.0034713568,0.00009432959,0.00077324663,0.90282434,0.07914996,0.011313685],"study_design_scores_gemma":[0.0019067641,0.0021709339,0.00022170036,0.001578012,0.0012656524,0.0013348003,0.0021154897,0.11602342,0.8301251,0.009152325,0.031891793,0.002214038],"about_ca_topic_score_codex":0.0010303055,"about_ca_topic_score_gemma":0.0007931135,"teacher_disagreement_score":0.893672,"about_ca_system_score_codex":0.0000063620896,"about_ca_system_score_gemma":0.0006580577,"threshold_uncertainty_score":0.9998233},"labels":[],"label_agreement":null},{"id":"W4404108386","doi":"10.1016/j.ffa.2024.102524","title":"Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Class (philosophy); Equivalence (formal languages); Finite field; Class number; Field (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.022946567417132482,"score_gpt":0.3139485004522888,"score_spread":0.2910019330351563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404108386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017400755,0.00024800003,0.97947055,0.0003858655,0.000050729912,0.00035139066,0.00085916725,0.000012290753,0.001221227],"genre_scores_gemma":[0.99825615,0.00007154564,0.0013817473,0.000030708572,0.00001974951,0.000107638094,0.0000067034744,0.0000069808407,0.00011880236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.000023115723,0.0004060556,0.00013386339,0.00008796984,0.000106692765],"domain_scores_gemma":[0.9945052,0.005044569,0.00010870205,0.00025675196,0.000058202775,0.000026539796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015312602,0.00009085208,0.00024361581,0.00003322547,0.00003829564,0.000010462922,0.00015822171,0.000095508934,0.000112911286],"category_scores_gemma":[0.0006969974,0.000059731297,0.000081712154,0.0002872659,0.00007754781,0.000028055936,0.00008092891,0.00013893851,0.0000015884389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002020263,0.00009069004,0.00014580178,0.0005325773,0.000032212545,1.8074086e-7,0.00041332244,0.000013052703,0.000551759,0.9947457,0.00018132072,0.0032732377],"study_design_scores_gemma":[0.00039538607,0.000053000826,0.00023795605,0.0004513588,0.0000643565,0.0000027444053,0.0001301258,0.0143725015,0.006227592,0.97721463,0.0007532837,0.000097039534],"about_ca_topic_score_codex":0.00003944312,"about_ca_topic_score_gemma":0.000017030687,"teacher_disagreement_score":0.98085535,"about_ca_system_score_codex":0.000006786007,"about_ca_system_score_gemma":0.00005616389,"threshold_uncertainty_score":0.24357717},"labels":[],"label_agreement":null},{"id":"W4406084888","doi":"10.1016/j.ffa.2024.102570","title":"The complexity of elliptic normal bases","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Carleton University","keywords":"Mathematics; Normal basis; Pure mathematics; Algebra over a field; Discrete mathematics; Galois module","score_opus":0.017341124241650643,"score_gpt":0.2365833396224899,"score_spread":0.21924221538083927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406084888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001882645,0.00086856744,0.9849078,0.0039222008,0.000041367923,0.0001473884,0.000008588335,0.00002835117,0.008193066],"genre_scores_gemma":[0.9963629,0.00019686016,0.0030067563,0.00021504129,0.000012849492,0.000059294132,0.0000018977836,0.0000011263983,0.00014325079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996439,0.000017899114,0.000112017544,0.00010695948,0.0000347981,0.000084381994],"domain_scores_gemma":[0.99915034,0.00041585483,0.000032476426,0.00034500775,0.000036310186,0.000019996993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000866727,0.000049235572,0.00006263623,0.000041616735,0.00029654524,0.00004378667,0.0003302078,0.000029662197,0.0000037614639],"category_scores_gemma":[0.000008514116,0.000030011552,0.00004049454,0.00032639547,0.00021587653,0.000038055543,0.00011308696,0.00007029999,0.0000020448097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011837554,0.000023601653,0.00022634216,0.000009975222,0.00001197256,4.4125677e-8,0.00011002425,0.000009728142,0.000038546783,0.9615336,0.00016644488,0.037868526],"study_design_scores_gemma":[0.00020968716,0.00005136057,0.015240809,0.000027420385,0.000012692691,0.0000024687922,0.00016815457,0.02184517,0.0031907996,0.8134599,0.14566605,0.00012551123],"about_ca_topic_score_codex":0.000022330141,"about_ca_topic_score_gemma":0.000028250459,"teacher_disagreement_score":0.99448025,"about_ca_system_score_codex":0.0000012785873,"about_ca_system_score_gemma":0.000018662231,"threshold_uncertainty_score":0.22808163},"labels":[],"label_agreement":null},{"id":"W4408408500","doi":"10.1016/j.ffa.2025.102606","title":"Artin-Schreier towers of finite fields","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo para la Investigación Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.008855253006169935,"score_gpt":0.22812650273654952,"score_spread":0.2192712497303796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408408500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029926337,0.00034767666,0.9661714,0.0018441466,0.000076055214,0.00015539548,0.000010544584,0.000065647735,0.028336545],"genre_scores_gemma":[0.99520344,0.00008851371,0.0031553993,0.00088946364,0.000025438603,0.0000972688,0.0000042438214,0.000002826185,0.0005334007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939877,0.000024131565,0.00018210674,0.00021854865,0.000047854264,0.00012858605],"domain_scores_gemma":[0.9988381,0.0004978195,0.000056278663,0.0005171967,0.000050023937,0.000040566734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014547417,0.00009368798,0.00012406093,0.0001233525,0.00014316963,0.00004558979,0.0004018306,0.00009165315,0.00003698267],"category_scores_gemma":[0.000022527931,0.00007946291,0.00007759818,0.000523159,0.00006232587,0.00008208599,0.00015825575,0.00013536941,0.000006580944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051757597,0.00004798451,0.00025311127,0.000021155924,0.000026170464,2.0131657e-7,0.0005472759,0.00005719816,0.000106864725,0.8833839,0.0005947051,0.114956215],"study_design_scores_gemma":[0.00031135583,0.00010225822,0.00095679594,0.000057920137,0.000017386645,0.0000014916639,0.00015635708,0.009450849,0.003933389,0.7251725,0.25961646,0.00022322359],"about_ca_topic_score_codex":0.0000080589725,"about_ca_topic_score_gemma":0.0000056106464,"teacher_disagreement_score":0.9922108,"about_ca_system_score_codex":0.000002366551,"about_ca_system_score_gemma":0.0000257594,"threshold_uncertainty_score":0.32404032},"labels":[],"label_agreement":null},{"id":"W4408816213","doi":"10.1016/j.ffa.2025.102624","title":"BRK-type sets over finite fields","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Type (biology); Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.021138292663252414,"score_gpt":0.2993024278510898,"score_spread":0.2781641351878374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408816213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21638694,0.0021501558,0.52792895,0.0043492797,0.0010429719,0.0018407584,0.00029811478,0.00050844636,0.24549438],"genre_scores_gemma":[0.9934421,0.00018055049,0.0014135401,0.001525495,0.00009030581,0.00010367061,0.000022078497,0.000013079526,0.0032091504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992527,0.00003127855,0.00022821236,0.00024224442,0.00006414772,0.00018141181],"domain_scores_gemma":[0.9980488,0.0012445204,0.000063085456,0.0005288175,0.00006156734,0.000053249103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013099232,0.00016032193,0.0001915366,0.00009491012,0.00037047247,0.000043370605,0.0002157002,0.00022456782,0.00025074728],"category_scores_gemma":[0.000120002245,0.00012133468,0.00007760903,0.00028003627,0.00008141321,0.00004535691,0.00015751038,0.00026460952,0.0000082727365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016238559,0.000050855157,0.0005738971,0.000079981946,0.00007509928,5.758819e-7,0.0010068616,0.0000108515615,0.000021601105,0.97605383,0.008228924,0.013881286],"study_design_scores_gemma":[0.00019750702,0.000028065118,0.00079361454,0.000028362,0.00002851804,0.0000015425711,0.0001071471,0.0006569677,0.00015577249,0.8949899,0.10287396,0.00013861337],"about_ca_topic_score_codex":0.00001262051,"about_ca_topic_score_gemma":0.000025379111,"teacher_disagreement_score":0.7770552,"about_ca_system_score_codex":0.0000067073056,"about_ca_system_score_gemma":0.000024505862,"threshold_uncertainty_score":0.49478844},"labels":[],"label_agreement":null},{"id":"W4410193200","doi":"10.1016/j.ffa.2025.102648","title":"The second generalized covering radius of binary primitive double-error-correcting BCH codes","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"BCH code; Mathematics; Binary number; RADIUS; Discrete mathematics; Arithmetic; Combinatorics; Error detection and correction; Algorithm; Computer science","score_opus":0.014762619647715433,"score_gpt":0.2518076760788961,"score_spread":0.23704505643118065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410193200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13956144,0.0010133757,0.8429506,0.00078534713,0.00015168764,0.00033733906,0.000016750095,0.00008203948,0.015101454],"genre_scores_gemma":[0.99760336,0.00007147747,0.00141073,0.00020321982,0.000022715549,0.00015236088,0.000003209448,0.0000031781597,0.0005297439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994358,0.000037875303,0.00016612066,0.00019240593,0.000041185027,0.00012663334],"domain_scores_gemma":[0.9988401,0.00062494964,0.000075468444,0.0003825032,0.000050760395,0.000026202766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023114176,0.00008809974,0.00011343076,0.000069179565,0.00046109964,0.00008104357,0.0003896215,0.000051589395,0.000009603389],"category_scores_gemma":[0.000009666929,0.00006307807,0.0000628275,0.00041331648,0.000077550554,0.0000785968,0.0001810497,0.00012430096,0.0000011895185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002816744,0.000034173045,0.00026380416,0.000027580587,0.00004424347,2.0777259e-7,0.0011867516,0.00006690437,0.0017804906,0.944116,0.00019491267,0.05225675],"study_design_scores_gemma":[0.002405096,0.00026405993,0.006178455,0.0002135268,0.00005600749,0.000019549256,0.0020558669,0.04560538,0.07027468,0.5714737,0.300749,0.00070468924],"about_ca_topic_score_codex":0.000011845741,"about_ca_topic_score_gemma":0.000024863557,"teacher_disagreement_score":0.85804194,"about_ca_system_score_codex":0.0000050246344,"about_ca_system_score_gemma":0.000029482324,"threshold_uncertainty_score":0.35464522},"labels":[],"label_agreement":null},{"id":"W4410813117","doi":"10.1016/j.ffa.2025.102660","title":"Linear codes with few weights from vectorial dual-bent functions","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Qufu Normal University","keywords":"Bent molecular geometry; Mathematics; Dual (grammatical number); Combinatorics; Bent function; Discrete mathematics; Algebra over a field; Boolean function; Pure mathematics","score_opus":0.0072687133727059395,"score_gpt":0.21116720648958442,"score_spread":0.2038984931168785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410813117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007820034,0.00020835607,0.983868,0.0013873596,0.00019457104,0.00018327057,0.000047366266,0.00013553721,0.0061554797],"genre_scores_gemma":[0.99235576,0.00004702023,0.0062328842,0.00044893863,0.00024926473,0.00022812217,0.000036688616,0.0000044857184,0.00039680733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994332,0.000025756563,0.00010992309,0.00026720527,0.000051914267,0.000111961745],"domain_scores_gemma":[0.9990542,0.00037659946,0.000033664626,0.0004420407,0.00004613847,0.000047356003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006299687,0.00010163197,0.00010398742,0.000082734594,0.00034012456,0.00009068879,0.0002197577,0.00006590502,0.00002845757],"category_scores_gemma":[0.0000050654753,0.000073472635,0.000044138196,0.00043345074,0.0000482316,0.00008470914,0.00009568662,0.00012874774,0.000016116168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017765846,0.0000819253,0.0003569998,0.0000064019,0.00006843231,4.5097494e-7,0.0004618372,0.00002955664,0.00009826359,0.97940785,0.0008357323,0.01863479],"study_design_scores_gemma":[0.0005309682,0.0001363933,0.0020193039,0.000053102216,0.000039094837,0.0000021191934,0.00012765927,0.0058921687,0.0010857295,0.52149063,0.46836555,0.00025727483],"about_ca_topic_score_codex":0.000039372157,"about_ca_topic_score_gemma":0.000051919025,"teacher_disagreement_score":0.98453575,"about_ca_system_score_codex":0.000004587077,"about_ca_system_score_gemma":0.000032348176,"threshold_uncertainty_score":0.2996127},"labels":[],"label_agreement":null},{"id":"W4412809371","doi":"10.1016/j.ffa.2025.102710","title":"Construction of (n,n)-functions with low differential-linear uniformity","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Hubei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Differential (mechanical device); Pure mathematics; Linear differential equation; Discrete mathematics; Mathematical analysis; Combinatorics; Differential equation; Physics","score_opus":0.005076776265270787,"score_gpt":0.20212316995202365,"score_spread":0.19704639368675286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412809371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028181693,0.000032458156,0.96649504,0.0003942226,0.000046298952,0.00013389208,0.000015216061,0.000058549802,0.004642651],"genre_scores_gemma":[0.9939807,0.000021415497,0.005701976,0.00006901274,0.000016028034,0.00006561433,0.000007839076,0.0000018584481,0.0001355769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961305,0.000015674728,0.00010924971,0.00015321154,0.00003503994,0.000073788484],"domain_scores_gemma":[0.99941236,0.00013284267,0.00004646922,0.00032560137,0.000057094076,0.000025611602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048152928,0.00006856854,0.000088516936,0.00009847759,0.00017327494,0.000024305877,0.00017322958,0.000046876306,0.000014154096],"category_scores_gemma":[0.000003986962,0.000050638882,0.000035967998,0.00044922045,0.00009736239,0.00007612915,0.00006431717,0.000086102074,0.000001856241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007968762,0.00005118328,0.0009635282,0.000021426216,0.000028339071,4.5737746e-8,0.00011406149,0.000024263694,0.000106409985,0.95653474,0.00002936539,0.04211864],"study_design_scores_gemma":[0.0012237334,0.0003637668,0.012834524,0.00018621769,0.00008409343,0.00001842125,0.00065084704,0.033134032,0.011567411,0.89971656,0.039723247,0.00049717235],"about_ca_topic_score_codex":0.000007594375,"about_ca_topic_score_gemma":0.000009793251,"teacher_disagreement_score":0.965799,"about_ca_system_score_codex":0.0000025656252,"about_ca_system_score_gemma":0.000025188552,"threshold_uncertainty_score":0.20649937},"labels":[],"label_agreement":null},{"id":"W4414684088","doi":"10.1016/j.ffa.2025.102730","title":"On the study of semi-involutory and semi-orthogonal matrices","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Circulant matrix; Diagonal; Order (exchange); Matrix (chemical analysis); Main diagonal; Computational complexity theory; Diagonal matrix","score_opus":0.007018259349240369,"score_gpt":0.20027188860003167,"score_spread":0.19325362925079131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414684088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97732675,0.0011848639,0.008873638,0.000096336524,0.000048617385,0.00043858474,0.00003047624,0.000055443797,0.011945278],"genre_scores_gemma":[0.9994714,0.000080675374,0.000004568725,0.000054311233,0.000018496032,0.0002067453,0.0000025263253,0.0000046446235,0.00015663494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967235,0.000022275655,0.00011952169,0.00009136515,0.00003204663,0.00006243399],"domain_scores_gemma":[0.999339,0.00041679794,0.000019668014,0.0001940913,0.000013325093,0.000017161588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010657406,0.00007279716,0.00009141044,0.000051779534,0.000105401705,0.000014461914,0.00008206657,0.000046566016,0.000012637102],"category_scores_gemma":[0.000005111208,0.000048115435,0.000019145644,0.0001558803,0.000027872056,0.00001696974,0.000022213158,0.00010056574,0.0000019533131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002883174,0.00028687328,0.0058546877,0.00031596108,0.00031962595,4.9604506e-7,0.0056935586,0.0022505946,0.00084224454,0.9687364,0.002548305,0.0131224105],"study_design_scores_gemma":[0.002871695,0.0011378153,0.05594295,0.0006426684,0.0003453794,0.000013471744,0.045058675,0.059851736,0.0042920904,0.65383893,0.17461976,0.0013848444],"about_ca_topic_score_codex":0.0000072589755,"about_ca_topic_score_gemma":0.000017976834,"teacher_disagreement_score":0.3148975,"about_ca_system_score_codex":0.000002195149,"about_ca_system_score_gemma":0.0000036343472,"threshold_uncertainty_score":0.19620904},"labels":[],"label_agreement":null}]}