{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2166683,0.0033422378,0.7123699,0.002387688,0.00083668146,0.00010188026,0.0003975922,0.00032082226,0.06357496],"genre_scores_gemma":[0.8617168,0.0021215803,0.10897517,0.0007376219,0.0006450424,0.00012584214,0.00022909505,0.00009194489,0.025356933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992987,0.00027280368,0.00003781402,0.00013150171,0.00015706995,0.00010204238],"domain_scores_gemma":[0.99741167,0.0011488849,0.00037521563,0.00054973067,0.00034021103,0.00017430302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011587224,0.00064908987,0.00080062886,0.0017202359,0.0012156676,0.0024016316,0.0010142874,0.0017095902,0.0056183897],"category_scores_gemma":[0.0039547104,0.00041904626,0.00052627287,0.0023670034,0.0031400225,0.0037936894,0.0012654376,0.0021423418,0.00079011696],"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.000021656824,0.000009441021,0.00007177923,0.000015965466,0.0000035287603,0.000027364653,0.00006432998,0.0020845328,0.0005984099,0.9929692,0.0003954247,0.00373824],"study_design_scores_gemma":[0.000010156362,0.000014989317,0.00006866521,0.0000133626545,0.0000037601449,0.00008851701,0.000043762928,0.01771672,0.00047460874,0.9792309,0.002315391,0.000019241817],"about_ca_topic_score_codex":0.0006584228,"about_ca_topic_score_gemma":0.00068209355,"teacher_disagreement_score":0.0056183897,"about_ca_system_score_codex":0.0010025162,"about_ca_system_score_gemma":0.00075152656,"threshold_uncertainty_score":0.018795371},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28233033,0.0067983135,0.2672326,0.008672637,0.0034630585,0.00020976116,0.00067029474,0.0006802422,0.42994276],"genre_scores_gemma":[0.87897253,0.0028713702,0.03666125,0.0012689768,0.0030202016,0.00034384485,0.00064955564,0.00042684583,0.0757854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681795,0.0009548879,0.00027904983,0.0005408748,0.0008356965,0.0005714662],"domain_scores_gemma":[0.9966182,0.0017412766,0.00029824598,0.0003314282,0.00046690213,0.000543993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004366041,0.0014916741,0.002302211,0.005366795,0.007804501,0.008409688,0.0017755985,0.0028651813,0.012786581],"category_scores_gemma":[0.009353836,0.0015310576,0.002255498,0.0048813317,0.010677894,0.014449848,0.0058798976,0.0079853805,0.0020463928],"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.0000059932177,0.000007458381,0.000026294043,0.0000055970913,0.0000015336469,0.000017564687,0.00015886126,0.00004135805,0.00006772872,0.9987041,0.0002915187,0.00067186495],"study_design_scores_gemma":[0.00000834628,0.000002526655,0.000031369178,0.00000512812,0.000002419725,0.000017721219,0.000049773294,0.00027445346,0.00007609974,0.99833965,0.0011872404,0.000005223432],"about_ca_topic_score_codex":0.0028450747,"about_ca_topic_score_gemma":0.0021094338,"teacher_disagreement_score":0.012786581,"about_ca_system_score_codex":0.0041214037,"about_ca_system_score_gemma":0.0013334036,"threshold_uncertainty_score":0.042775333},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6112727,0.0027081273,0.22345388,0.0061180037,0.0007745891,0.00013588046,0.0008448471,0.0005463927,0.15414552],"genre_scores_gemma":[0.9093075,0.0012118965,0.037884828,0.00052481226,0.00069003657,0.0001508269,0.00054297294,0.00015396488,0.049533162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860793,0.00037748105,0.00005503613,0.00016513414,0.0005090566,0.00028543425],"domain_scores_gemma":[0.9970337,0.0017854888,0.00026493374,0.00032503548,0.0002912013,0.00029959666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015130161,0.0010516869,0.0010223463,0.0023298033,0.0017625316,0.003637922,0.0012098079,0.0012074157,0.009331107],"category_scores_gemma":[0.005544724,0.00048309812,0.0005822257,0.0021021382,0.0030702266,0.0059692967,0.0022772038,0.0033297467,0.0016001924],"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.00019619417,0.00005832802,0.0002908926,0.00005250265,0.0000072912285,0.000077105855,0.00022876407,0.0029372263,0.0012290374,0.97836393,0.0020305817,0.014528142],"study_design_scores_gemma":[0.000034324737,0.000032432494,0.00015815857,0.000021066662,0.0000058786577,0.00011844818,0.00005703828,0.008961486,0.0010071974,0.9860184,0.0035662446,0.000019172856],"about_ca_topic_score_codex":0.0012520326,"about_ca_topic_score_gemma":0.0017951773,"teacher_disagreement_score":0.009331107,"about_ca_system_score_codex":0.0022393803,"about_ca_system_score_gemma":0.0010379896,"threshold_uncertainty_score":0.031215668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087852314,0.013341261,0.52299523,0.011557728,0.002826356,0.000086409156,0.0006431444,0.00045109793,0.36024645],"genre_scores_gemma":[0.72846127,0.010263509,0.14201476,0.004524356,0.005270012,0.00022705621,0.0009151801,0.0006826058,0.10764127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989441,0.00037047724,0.00005721002,0.00016456268,0.0002992552,0.00016446147],"domain_scores_gemma":[0.9977695,0.0012430112,0.00017343354,0.0003502438,0.00029785928,0.00016607909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027380968,0.00092968077,0.0013304182,0.002452077,0.0015162114,0.0032032034,0.0014348085,0.0016946332,0.01062963],"category_scores_gemma":[0.0052292757,0.00063183,0.0017911505,0.0020659675,0.0042874445,0.0103567485,0.0027657,0.005397802,0.0022772462],"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.000015762613,0.000011296057,0.00004004147,0.00002189825,0.000004093838,0.000028530267,0.00007681751,0.0003256701,0.00016297074,0.9937097,0.0019679128,0.0036354482],"study_design_scores_gemma":[0.000007561519,0.0000067050405,0.000052863455,0.000015715717,0.0000037203538,0.00004891467,0.000027801188,0.0021707048,0.000106034626,0.99366117,0.0038917833,0.000006978139],"about_ca_topic_score_codex":0.0011510947,"about_ca_topic_score_gemma":0.0008657467,"teacher_disagreement_score":0.01062963,"about_ca_system_score_codex":0.0014910828,"about_ca_system_score_gemma":0.00074867374,"threshold_uncertainty_score":0.035559654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6416414,0.0086647235,0.21635443,0.006028478,0.0012674311,0.00006148669,0.00037682717,0.00035096143,0.12525426],"genre_scores_gemma":[0.9465034,0.0035891037,0.013137557,0.00038783136,0.0010228719,0.000044654164,0.00018235767,0.00014788436,0.034984387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991898,0.00024035099,0.000045298297,0.0001467003,0.0002143859,0.00016346367],"domain_scores_gemma":[0.9972615,0.0014499043,0.00025763732,0.00024039808,0.00031146395,0.0004790672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018128003,0.0013573653,0.0011711016,0.0038361624,0.0022955844,0.0036952398,0.0013457367,0.0018894621,0.006278447],"category_scores_gemma":[0.0058098924,0.0007642112,0.0009637113,0.0029686366,0.0075339484,0.011725617,0.004052151,0.004074694,0.00060077937],"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.000015555179,0.000015443977,0.00013765226,0.00001407097,0.0000033716265,0.00005110849,0.00033270684,0.00023049292,0.00023165072,0.9964468,0.00019649838,0.0023247167],"study_design_scores_gemma":[0.0000070141227,0.000011378685,0.00008858581,0.000011503671,0.0000030115427,0.000055822493,0.00011453093,0.0008514809,0.00014590101,0.99752396,0.001179448,0.0000073004726],"about_ca_topic_score_codex":0.0017386747,"about_ca_topic_score_gemma":0.0011725645,"teacher_disagreement_score":0.006278447,"about_ca_system_score_codex":0.0021367476,"about_ca_system_score_gemma":0.00092715654,"threshold_uncertainty_score":0.021003544},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021706179,0.52423316,0.020295741,0.029807944,0.0064991876,0.00004874079,0.0002775656,0.00025218297,0.3968793],"genre_scores_gemma":[0.52101785,0.2612919,0.010996398,0.0042362446,0.029437575,0.0001542609,0.00038582116,0.0001513247,0.17232862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928695,0.00024936456,0.000030315554,0.00013821282,0.00023040819,0.00006489287],"domain_scores_gemma":[0.9987109,0.0008129312,0.00011086233,0.00012642512,0.00015681326,0.00008213024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079304335,0.0014403646,0.0015845681,0.0035685182,0.0024610208,0.007790062,0.00079298404,0.0029170825,0.013018138],"category_scores_gemma":[0.0036090498,0.0006492495,0.0004282066,0.0054426473,0.0074889446,0.008221007,0.0015798776,0.0050074896,0.0027672236],"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.000013746653,0.000014420706,0.00007290263,0.000103368686,0.000005708329,0.000022233495,0.00017957878,0.00059336575,0.00012541881,0.9711888,0.012644739,0.01503566],"study_design_scores_gemma":[0.000008133358,0.000010955866,0.00013843604,0.0000683272,0.0000050086765,0.000075696335,0.00008291928,0.0006571877,0.000060056533,0.9296853,0.0692007,0.0000072663934],"about_ca_topic_score_codex":0.0016688235,"about_ca_topic_score_gemma":0.0012666652,"teacher_disagreement_score":0.013018138,"about_ca_system_score_codex":0.0037887048,"about_ca_system_score_gemma":0.0012877274,"threshold_uncertainty_score":0.043550014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77098525,0.0010615954,0.1464185,0.0016634524,0.0004237653,0.000061701925,0.00035047584,0.00028886268,0.07874641],"genre_scores_gemma":[0.92919564,0.0008127835,0.021315226,0.00035751934,0.00040432622,0.00006757276,0.00029943348,0.00015805785,0.047389567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995838,0.00009679716,0.00001625713,0.000067543035,0.0001411996,0.00009451817],"domain_scores_gemma":[0.999046,0.00034535618,0.00018162884,0.0001108989,0.00012243017,0.00019364977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005793938,0.0009448274,0.0008932264,0.0028167712,0.0015326557,0.0019343097,0.0010026676,0.0012761318,0.006377603],"category_scores_gemma":[0.0021008644,0.0005613217,0.00051179354,0.0014058395,0.0020099117,0.0034785515,0.0022565394,0.0028299463,0.0012081163],"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.0001353339,0.000051537125,0.000352859,0.0000397879,0.000011397772,0.000111762165,0.00017565126,0.0036286998,0.0031148652,0.9822597,0.0012963396,0.0088221235],"study_design_scores_gemma":[0.00003300451,0.00006297493,0.00044345995,0.000029860743,0.000009401208,0.00029343498,0.00014752515,0.018747887,0.0014181783,0.9754735,0.0033148653,0.000025893854],"about_ca_topic_score_codex":0.0005550367,"about_ca_topic_score_gemma":0.0004533179,"teacher_disagreement_score":0.006377603,"about_ca_system_score_codex":0.0012654195,"about_ca_system_score_gemma":0.00038840604,"threshold_uncertainty_score":0.021335244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022782974,0.0006184782,0.10142625,0.0074760085,0.0046883803,0.0007964908,0.07099235,0.12367897,0.6880448],"genre_scores_gemma":[0.013946114,0.0011411567,0.04647147,0.0039288723,0.0008872209,0.00062201027,0.117084526,0.066317834,0.74960077],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971641,0.00043012228,0.00031390754,0.00048035572,0.0012225491,0.0003888719],"domain_scores_gemma":[0.99343663,0.0010059346,0.00024640746,0.0018214983,0.002909085,0.0005804395],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027933337,0.0030880137,0.0016500998,0.0031703732,0.0025873787,0.010049864,0.004330075,0.0034176838,0.56302935],"category_scores_gemma":[0.011311755,0.001830446,0.0024559363,0.004354234,0.0012057355,0.010671423,0.0045774286,0.0045258836,0.6393183],"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.000179231,0.00009458447,0.0002541281,0.00023030929,0.00001586372,0.00011585836,0.00022164707,0.00039716042,0.0020858713,0.010398322,0.93630487,0.049702127],"study_design_scores_gemma":[0.000026116299,0.00001577139,0.00030389614,0.00006641871,0.000009367669,0.00007381472,0.000087525754,0.0008465951,0.0025258637,0.0023858803,0.9936279,0.000030826624],"about_ca_topic_score_codex":0.03076908,"about_ca_topic_score_gemma":0.027228152,"teacher_disagreement_score":0.56302935,"about_ca_system_score_codex":0.0043530287,"about_ca_system_score_gemma":0.0040626084,"threshold_uncertainty_score":0.6232856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5292748,0.0062103136,0.16598366,0.028958736,0.004001219,0.00015041225,0.0011577402,0.00074142835,0.2635216],"genre_scores_gemma":[0.9594697,0.0023491117,0.013725887,0.0020207914,0.0033479163,0.000062343126,0.00058121857,0.000089271336,0.018353853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979499,0.00053894037,0.00010145374,0.0005061612,0.00047889276,0.00042474872],"domain_scores_gemma":[0.99391717,0.002941714,0.000653765,0.0014237034,0.000582922,0.00048071006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003116054,0.00094923296,0.0022100906,0.002904076,0.0028738545,0.0039014437,0.0020439064,0.0031822568,0.008776818],"category_scores_gemma":[0.010556455,0.00067451474,0.0016883968,0.0033947984,0.0077958573,0.013756585,0.0040953932,0.006335538,0.0010763576],"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.00006885926,0.000034863242,0.00039500845,0.00006427749,0.000012230146,0.00011879933,0.00022882863,0.00220568,0.000303306,0.9879923,0.003521738,0.005054095],"study_design_scores_gemma":[0.00001417951,0.0000096504245,0.00017239455,0.000017893974,0.00000495002,0.00005329341,0.00004960391,0.0039876583,0.00011386653,0.99382883,0.0017352303,0.00001250246],"about_ca_topic_score_codex":0.002671655,"about_ca_topic_score_gemma":0.0018467903,"teacher_disagreement_score":0.008776818,"about_ca_system_score_codex":0.002321428,"about_ca_system_score_gemma":0.0014192124,"threshold_uncertainty_score":0.029361367},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1548726,0.010094415,0.23613349,0.008486418,0.003961536,0.000083033905,0.00033174185,0.00027258974,0.5857642],"genre_scores_gemma":[0.7621694,0.010081601,0.03659538,0.0021591808,0.005373901,0.000120815734,0.0005501132,0.00029808562,0.18265152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999255,0.00021851182,0.00002499376,0.00013786588,0.00022176075,0.00014175643],"domain_scores_gemma":[0.99875975,0.00068903394,0.000112475755,0.00015677039,0.00017421218,0.000107739215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010206884,0.0013885146,0.001097629,0.0031485704,0.0016380971,0.0025922577,0.0009936616,0.001471359,0.010441455],"category_scores_gemma":[0.0038666169,0.0006783217,0.0009936477,0.0030966836,0.004228147,0.0065969587,0.0027186638,0.0048445635,0.0018549265],"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.000013018838,0.0000091114825,0.000036371417,0.000015472127,0.000001925823,0.000018979314,0.000075616015,0.00040486865,0.00015839137,0.99290997,0.0011093682,0.0052469275],"study_design_scores_gemma":[0.0000047053604,0.000008084361,0.000054784152,0.000013596714,0.000003731637,0.000058990783,0.00002420439,0.0014089674,0.0001693497,0.9916706,0.006575823,0.000007309591],"about_ca_topic_score_codex":0.0007565143,"about_ca_topic_score_gemma":0.00059558445,"teacher_disagreement_score":0.010441455,"about_ca_system_score_codex":0.0016760118,"about_ca_system_score_gemma":0.0007084801,"threshold_uncertainty_score":0.03493011},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6384713,0.0019670434,0.26341105,0.0025639795,0.00054383615,0.00013853103,0.0006497387,0.0007883431,0.091466285],"genre_scores_gemma":[0.9418683,0.00079357927,0.029550942,0.0004808493,0.0004426065,0.00009144845,0.0005714582,0.00019393805,0.026006887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992668,0.00016948224,0.000045206663,0.00014224618,0.0001464006,0.00022994037],"domain_scores_gemma":[0.99621767,0.0019062875,0.0005218054,0.0004096655,0.0004471945,0.00049734145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015280108,0.0007605133,0.0011322637,0.0022019236,0.002964128,0.0031351591,0.00119615,0.0014117769,0.0069963275],"category_scores_gemma":[0.004914079,0.0006082562,0.0009066754,0.0015304959,0.00451287,0.007987315,0.0024978847,0.0028457255,0.0013159134],"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.000051860578,0.000014958425,0.000108716406,0.000019943187,0.00000211398,0.00005178664,0.00028965145,0.00043112956,0.00040893417,0.99522626,0.0005507654,0.0028438359],"study_design_scores_gemma":[0.000014087271,0.000020877158,0.00007065426,0.000014382102,0.00000335545,0.000045916542,0.00006368573,0.0015033999,0.00026639935,0.9968451,0.0011408031,0.000011403618],"about_ca_topic_score_codex":0.00093497505,"about_ca_topic_score_gemma":0.000874849,"teacher_disagreement_score":0.0069963275,"about_ca_system_score_codex":0.001220883,"about_ca_system_score_gemma":0.00084320735,"threshold_uncertainty_score":0.023405075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49411184,0.0010891109,0.46446148,0.0015369988,0.00013607636,0.000054356442,0.00019716313,0.00022956109,0.03818339],"genre_scores_gemma":[0.9854116,0.00039664275,0.008918418,0.00016633711,0.00014104441,0.000034729524,0.000078883524,0.000033548873,0.0048187934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995577,0.0001635273,0.000012415629,0.000054508655,0.00012903323,0.00008278107],"domain_scores_gemma":[0.9961759,0.0024633268,0.00043866903,0.00027478495,0.00041175235,0.00023561416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013130846,0.0004936476,0.00054173346,0.0020576564,0.00053270714,0.001481207,0.0007828048,0.0007264602,0.004080112],"category_scores_gemma":[0.0070549413,0.00023186718,0.0004106743,0.00080822676,0.00217221,0.0021691602,0.0009863249,0.001182295,0.00029644792],"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.00007774969,0.000035960402,0.00036820606,0.000033656517,0.000011152918,0.000054981043,0.000079093916,0.023070583,0.0022020214,0.96621835,0.00090323394,0.0069450345],"study_design_scores_gemma":[0.000019369672,0.00003249832,0.00046573768,0.00002046526,0.000009508294,0.00013836724,0.00008620068,0.281619,0.0015504296,0.71489745,0.001140136,0.000020817934],"about_ca_topic_score_codex":0.00048880297,"about_ca_topic_score_gemma":0.00027642737,"teacher_disagreement_score":0.004080112,"about_ca_system_score_codex":0.0010357132,"about_ca_system_score_gemma":0.0005328255,"threshold_uncertainty_score":0.013649344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8730884,0.0015626583,0.07620736,0.0021693117,0.00012595681,0.00005144848,0.00034492288,0.00021334589,0.046236657],"genre_scores_gemma":[0.979014,0.00096369535,0.009906713,0.00012442117,0.00023631217,0.00004197311,0.000300542,0.00005174769,0.009360672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988944,0.00023581952,0.000102485705,0.00022972189,0.00027540035,0.0002621168],"domain_scores_gemma":[0.9903104,0.0061267354,0.0010177854,0.0005878856,0.00096273154,0.0009946115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017269317,0.0006069943,0.0008918895,0.0026732665,0.0016934338,0.004627556,0.0012342164,0.0011498355,0.0038358422],"category_scores_gemma":[0.009166958,0.0007726034,0.00070468494,0.002173154,0.0057740347,0.0091381455,0.0026525308,0.002857743,0.0006784439],"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.00018861999,0.00007181137,0.0017149978,0.00006641928,0.000014692576,0.00011655469,0.0007981621,0.001190604,0.002587476,0.98747534,0.0004476686,0.005327705],"study_design_scores_gemma":[0.00004448608,0.000062319865,0.00057229196,0.00004264892,0.000017660897,0.0004089604,0.00043073064,0.0048604105,0.0026091905,0.9884808,0.0024403587,0.000030004003],"about_ca_topic_score_codex":0.00060511264,"about_ca_topic_score_gemma":0.00041428357,"teacher_disagreement_score":0.004627556,"about_ca_system_score_codex":0.0016996291,"about_ca_system_score_gemma":0.0008834259,"threshold_uncertainty_score":0.012832224},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3790501,0.008778095,0.11783904,0.0061324793,0.004044047,0.00015818187,0.00057833764,0.0005829265,0.48283675],"genre_scores_gemma":[0.85599834,0.0039000972,0.019236686,0.0014177399,0.0018200104,0.0001444769,0.00029940566,0.00027111467,0.116912104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988147,0.00030569057,0.00007732356,0.00014437542,0.00034483083,0.00031315745],"domain_scores_gemma":[0.99868745,0.00073170045,0.00017535666,0.00013677332,0.00013909634,0.00012970844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013546809,0.0015072103,0.0015208125,0.0034769333,0.0034766512,0.0041862475,0.0011548304,0.0015591133,0.015160125],"category_scores_gemma":[0.0039242045,0.00064846594,0.00087592413,0.004130483,0.004137562,0.006376437,0.0038431992,0.0029000344,0.0029705907],"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.000039144114,0.000017111008,0.000060267233,0.000043879143,0.000005046518,0.000063142055,0.00023325128,0.00042601323,0.00038699343,0.9888226,0.0016444813,0.008258048],"study_design_scores_gemma":[0.000009596574,0.000012412343,0.000073763964,0.000034468074,0.000009160496,0.00012549324,0.0000671699,0.0010996313,0.000648253,0.991719,0.0061846534,0.000016347974],"about_ca_topic_score_codex":0.0006063398,"about_ca_topic_score_gemma":0.0009224654,"teacher_disagreement_score":0.015160125,"about_ca_system_score_codex":0.0021992172,"about_ca_system_score_gemma":0.0012334725,"threshold_uncertainty_score":0.050715625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38440594,0.0031312052,0.39390814,0.0047627576,0.0013828094,0.00012672617,0.0005198751,0.00041802827,0.21134453],"genre_scores_gemma":[0.91027486,0.0031902434,0.032984074,0.00069699925,0.0012682156,0.0001270435,0.0003127627,0.0002304301,0.05091536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908817,0.00031151026,0.000026810554,0.00011018639,0.000271296,0.00019205689],"domain_scores_gemma":[0.9971944,0.001720923,0.00034224443,0.0003111892,0.00023456391,0.00019665537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011681736,0.0013136176,0.0011802224,0.002230129,0.0016263548,0.0023610361,0.0012506823,0.0017912826,0.006864659],"category_scores_gemma":[0.006197837,0.00064341177,0.0008316395,0.0029766494,0.0053821523,0.0050556767,0.002783972,0.0030033293,0.0012511463],"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.000021278693,0.0000071094382,0.000038859867,0.000012817925,0.0000012390469,0.00002672443,0.00007459768,0.0010858967,0.00020473778,0.9947948,0.00050996523,0.0032221065],"study_design_scores_gemma":[0.0000084661515,0.000008949333,0.000037655434,0.000010149233,0.0000019619727,0.00004679435,0.00002808072,0.0043440806,0.00015171262,0.99395436,0.0014000133,0.0000076541355],"about_ca_topic_score_codex":0.0010581354,"about_ca_topic_score_gemma":0.00093576463,"teacher_disagreement_score":0.006864659,"about_ca_system_score_codex":0.0017961441,"about_ca_system_score_gemma":0.0010335821,"threshold_uncertainty_score":0.022964597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045022126,0.10355605,0.35036922,0.09519698,0.08564006,0.00008210094,0.00054961705,0.0011132718,0.31847054],"genre_scores_gemma":[0.43270016,0.06774214,0.15523116,0.02884283,0.15537731,0.00023717471,0.00049021805,0.0015481613,0.15783097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982981,0.00058935455,0.00013525042,0.00026190365,0.0005808309,0.0001346345],"domain_scores_gemma":[0.99235326,0.0056838063,0.00028444667,0.000714266,0.0005945916,0.00036978582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003750477,0.0016695268,0.0024789823,0.0041506444,0.0032846313,0.0056489166,0.0030298422,0.0033043267,0.006992817],"category_scores_gemma":[0.009405052,0.00063775806,0.0018771358,0.0038775285,0.00614138,0.0153658455,0.0046739033,0.009975217,0.0016093955],"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.000024918123,0.000022721577,0.00010153886,0.00012475981,0.000017280521,0.00020401325,0.00018699987,0.00035203967,0.0005245256,0.9723796,0.016380323,0.009681314],"study_design_scores_gemma":[0.0000053252325,0.00001179599,0.000114919596,0.000039043716,0.000013342169,0.00022608765,0.000042400556,0.0011995808,0.00023795596,0.96289176,0.035196424,0.000021230493],"about_ca_topic_score_codex":0.00059111253,"about_ca_topic_score_gemma":0.0010053646,"teacher_disagreement_score":0.006992817,"about_ca_system_score_codex":0.0017147011,"about_ca_system_score_gemma":0.00070044206,"threshold_uncertainty_score":0.023393273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8528519,0.0013496339,0.052720264,0.0013734492,0.00017688934,0.00005548913,0.0005572579,0.00027236028,0.090642735],"genre_scores_gemma":[0.9710055,0.000662866,0.011525547,0.00011822966,0.00017273992,0.000063888605,0.00051092973,0.00012782164,0.015812524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988913,0.00032264684,0.00006281353,0.00015293976,0.00029397986,0.00027625545],"domain_scores_gemma":[0.9969285,0.0014250687,0.00078042696,0.00016530606,0.00029075047,0.0004098663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008885433,0.000910432,0.0010054853,0.0059257555,0.0036358747,0.006285001,0.0012897754,0.0018095606,0.008907418],"category_scores_gemma":[0.0035444465,0.0011703041,0.0006917867,0.0055271913,0.0034250878,0.0066408017,0.002721464,0.0030842477,0.0008333863],"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.00008398658,0.000021708962,0.00073950255,0.000018417077,0.000007104032,0.00018395021,0.00027235513,0.001265215,0.00051901076,0.99283504,0.0008466201,0.003207217],"study_design_scores_gemma":[0.000031566902,0.000036363923,0.0012074471,0.000039067156,0.000019368512,0.0003915311,0.00066302554,0.009140199,0.0018317655,0.98280233,0.0038065498,0.000030883508],"about_ca_topic_score_codex":0.0016834361,"about_ca_topic_score_gemma":0.0020753606,"teacher_disagreement_score":0.008907418,"about_ca_system_score_codex":0.002090549,"about_ca_system_score_gemma":0.0006186473,"threshold_uncertainty_score":0.02979827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08533993,0.037736848,0.5449712,0.046413604,0.009594585,0.00012372408,0.0007284387,0.0011193675,0.27397224],"genre_scores_gemma":[0.7173345,0.023040807,0.15016891,0.009575369,0.017687248,0.00033571396,0.00038689998,0.0009262043,0.08054439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988238,0.0005296622,0.00008282679,0.0001844213,0.0002968125,0.00008232515],"domain_scores_gemma":[0.9933041,0.004733598,0.000325725,0.00067022315,0.00047044893,0.00049593206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004299308,0.0012153718,0.0020623098,0.0037192446,0.0026425738,0.0042007314,0.0027030704,0.0029262952,0.0070711067],"category_scores_gemma":[0.010744074,0.00082785706,0.0014261411,0.0024250906,0.0106275985,0.015791016,0.0041438327,0.0070266654,0.00087404327],"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.000003988149,0.0000064845644,0.00003013853,0.00002544195,0.0000026248651,0.000032841916,0.000105223,0.00023630017,0.00013700442,0.99643683,0.0017774876,0.001205651],"study_design_scores_gemma":[0.0000030836454,0.000005505408,0.000045347646,0.0000110565425,0.0000034100829,0.000053432173,0.000033767417,0.0019576466,0.000079675614,0.992833,0.004965223,0.000008924696],"about_ca_topic_score_codex":0.0016096445,"about_ca_topic_score_gemma":0.0016998346,"teacher_disagreement_score":0.0070711067,"about_ca_system_score_codex":0.0021902202,"about_ca_system_score_gemma":0.0008523404,"threshold_uncertainty_score":0.023655236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7380045,0.0016018532,0.16852121,0.002686771,0.0002862131,0.000075793476,0.00044018545,0.00033486425,0.08804864],"genre_scores_gemma":[0.95821667,0.00092219614,0.023133053,0.000151401,0.0002523599,0.000049020597,0.00035287393,0.00008636677,0.016836103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988218,0.00031426037,0.00006137303,0.00015385041,0.00036872597,0.00027997047],"domain_scores_gemma":[0.9976132,0.0013121339,0.00032987146,0.00030117005,0.00022471609,0.00021883959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243133,0.0013239471,0.0011126546,0.0027280853,0.002105552,0.0045005265,0.0014497946,0.0015745095,0.004964197],"category_scores_gemma":[0.00700428,0.00066555577,0.00072555285,0.0041814577,0.0047351685,0.005800863,0.003201628,0.0036012563,0.0007774967],"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.00005956723,0.000024094781,0.000311183,0.000033127704,0.000004075603,0.000109809145,0.0003269079,0.0015561739,0.0007025938,0.989726,0.0005541642,0.0065922127],"study_design_scores_gemma":[0.000018378922,0.000011553343,0.00017953715,0.000030971234,0.000008485374,0.00016287195,0.000112539456,0.0072661494,0.00096886564,0.98888934,0.0023335437,0.000017761251],"about_ca_topic_score_codex":0.0009243935,"about_ca_topic_score_gemma":0.0009975495,"teacher_disagreement_score":0.004964197,"about_ca_system_score_codex":0.002045621,"about_ca_system_score_gemma":0.0011700373,"threshold_uncertainty_score":0.016606927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50719917,0.030420847,0.23445308,0.009270223,0.002878134,0.000111648566,0.0008110685,0.000277233,0.21457857],"genre_scores_gemma":[0.91811466,0.018293655,0.02214604,0.0005328055,0.0035628083,0.0001005954,0.0005901966,0.0001603829,0.036498763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869627,0.00040759408,0.000049880233,0.0001421552,0.00042956517,0.00027454703],"domain_scores_gemma":[0.9953069,0.0032355573,0.00044898264,0.00024609306,0.0004354815,0.0003269984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019003547,0.0019505519,0.0014961845,0.00461767,0.0015672275,0.003452275,0.0013002724,0.001280626,0.005505837],"category_scores_gemma":[0.009109525,0.00083121884,0.00074668793,0.005333574,0.005143633,0.006957325,0.0026998252,0.0040703462,0.0011353212],"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.000060655988,0.00002664132,0.00027396157,0.000076335185,0.0000073894466,0.00010953015,0.00033410988,0.0026088625,0.0006553315,0.98640394,0.0015200368,0.007923173],"study_design_scores_gemma":[0.000022235987,0.000015781532,0.00023107474,0.00006481797,0.000010596036,0.00010720557,0.00008366642,0.0077879326,0.00032444304,0.98738027,0.003955048,0.000016865184],"about_ca_topic_score_codex":0.0022639313,"about_ca_topic_score_gemma":0.0020287412,"teacher_disagreement_score":0.005505837,"about_ca_system_score_codex":0.0023923728,"about_ca_system_score_gemma":0.0009739719,"threshold_uncertainty_score":0.018418849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61685634,0.024248648,0.124021955,0.007719481,0.0013004841,0.000053282834,0.00048619037,0.0003488811,0.22496477],"genre_scores_gemma":[0.96243584,0.004776078,0.007309751,0.0002954001,0.00087372283,0.000019697047,0.00011485609,0.0000344206,0.024140216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967706,0.000096709584,0.000014326395,0.000053464315,0.00008318303,0.00007530486],"domain_scores_gemma":[0.9988493,0.000656239,0.0001748835,0.00008278317,0.00009973347,0.00013701757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072233065,0.0006352957,0.0006310145,0.003143063,0.0010963357,0.0019873835,0.00050760026,0.0007340631,0.0058453227],"category_scores_gemma":[0.0025250644,0.00041313548,0.0003297092,0.0031617247,0.0026965134,0.0031483038,0.0013037521,0.001960365,0.00057041517],"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.000022989903,0.0000123973805,0.00015545626,0.000024540637,0.0000027561996,0.000032595723,0.000111108064,0.0007065955,0.0003529534,0.9924582,0.0006490509,0.0054712906],"study_design_scores_gemma":[0.000015117067,0.000018309629,0.0003161975,0.000024878138,0.000008467743,0.00012460395,0.000102589205,0.004303701,0.000488037,0.9865731,0.008008049,0.000016989994],"about_ca_topic_score_codex":0.0010564654,"about_ca_topic_score_gemma":0.0010390948,"teacher_disagreement_score":0.0058453227,"about_ca_system_score_codex":0.0018154554,"about_ca_system_score_gemma":0.0005809629,"threshold_uncertainty_score":0.019554496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5266592,0.011869398,0.14553793,0.010265,0.0019634953,0.00006930492,0.0004005723,0.00039848583,0.30283657],"genre_scores_gemma":[0.9163818,0.0038965642,0.008094582,0.00073747325,0.0022339541,0.000073694515,0.00021054987,0.00012802347,0.06824335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00024091525,0.000040795592,0.00014109023,0.00023794484,0.0001524675],"domain_scores_gemma":[0.9977047,0.0012708066,0.00028216458,0.00024164225,0.00023524795,0.00026550677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014983024,0.001139395,0.0013585376,0.0036065835,0.0021327143,0.0040057683,0.0013140598,0.0013681855,0.008687559],"category_scores_gemma":[0.0057013533,0.00065772637,0.00064870086,0.004478392,0.004464977,0.007954376,0.0027874107,0.0032004807,0.0011882207],"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.000011507983,0.00001192667,0.000067261615,0.000014301921,0.0000030183194,0.000016239075,0.00007844295,0.00024571057,0.00013718515,0.99588615,0.00063761167,0.0028906357],"study_design_scores_gemma":[0.0000044399594,0.0000035016512,0.00006079001,0.000006326495,0.0000043397513,0.00003568739,0.000022631886,0.0009143258,0.00012031235,0.9974437,0.0013788263,0.000005305039],"about_ca_topic_score_codex":0.00073738565,"about_ca_topic_score_gemma":0.0006236034,"teacher_disagreement_score":0.008687559,"about_ca_system_score_codex":0.0019228067,"about_ca_system_score_gemma":0.0006737878,"threshold_uncertainty_score":0.029062748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018396128,0.001592976,0.9655534,0.002874448,0.00018234826,0.000057258112,0.0002876469,0.00011866137,0.010937178],"genre_scores_gemma":[0.72676545,0.004701734,0.24345708,0.0013644047,0.00347189,0.00046454708,0.0007246769,0.00030510747,0.018745044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98729867,0.005169913,0.00065733236,0.0015801777,0.0043292698,0.00096453674],"domain_scores_gemma":[0.94845366,0.041073777,0.002467852,0.0041294666,0.002552952,0.0013222859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010717063,0.001611108,0.0029434746,0.0065361126,0.0036750955,0.010375513,0.0068240194,0.0033661455,0.0055329734],"category_scores_gemma":[0.04168387,0.0025604481,0.0041802507,0.006835518,0.012963142,0.023353174,0.0075469585,0.008834806,0.00072321226],"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.000006566731,0.0000060799143,0.000064742984,0.000016666905,0.000005981934,0.000012814069,0.000055306362,0.0030984317,0.000057102417,0.99525744,0.00016781237,0.0012510597],"study_design_scores_gemma":[0.000004028386,0.000004521373,0.000031011306,0.000013062056,0.0000054982797,0.00002104749,0.000014690155,0.01850196,0.00006503389,0.98070234,0.0006272053,0.0000094787265],"about_ca_topic_score_codex":0.0025577974,"about_ca_topic_score_gemma":0.0019987007,"teacher_disagreement_score":0.010717063,"about_ca_system_score_codex":0.006764783,"about_ca_system_score_gemma":0.0030315293,"threshold_uncertainty_score":0.056677938},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017883105,0.56712365,0.21405005,0.004688447,0.0030500742,0.0002846644,0.0011237054,0.0026312093,0.18916512],"genre_scores_gemma":[0.092359364,0.61184347,0.19110909,0.0029528856,0.0041906973,0.00031832137,0.004980529,0.0014554649,0.09079019],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876404,0.0002059377,0.00014603949,0.00024105735,0.0005033828,0.0001394824],"domain_scores_gemma":[0.99784636,0.000831872,0.0001606833,0.00046830127,0.00055165216,0.00014110775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991447,0.0014843576,0.0010250903,0.005891962,0.00092491775,0.0024342628,0.0019849043,0.0010367291,0.027011445],"category_scores_gemma":[0.0045875926,0.001092291,0.00084050244,0.009210715,0.0010375289,0.0076193605,0.00222013,0.002283858,0.017842513],"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.00021953876,0.00014530747,0.00046480214,0.0024395394,0.000034461846,0.0000949153,0.00012660329,0.0024785216,0.005257333,0.051443707,0.0344735,0.90282184],"study_design_scores_gemma":[0.000050830822,0.0003662834,0.0007667766,0.0007885515,0.00006420888,0.0014626082,0.00011665878,0.005977044,0.012845759,0.039480407,0.9380041,0.000076887925],"about_ca_topic_score_codex":0.0007752329,"about_ca_topic_score_gemma":0.0011317213,"teacher_disagreement_score":0.027011445,"about_ca_system_score_codex":0.0013977574,"about_ca_system_score_gemma":0.0017950167,"threshold_uncertainty_score":0.09036231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57376856,0.002700186,0.35599273,0.007150917,0.00044313568,0.00018497359,0.002985012,0.001191378,0.055582967],"genre_scores_gemma":[0.9637389,0.0024261407,0.013893716,0.00044041176,0.00096892624,0.00035778974,0.0021507426,0.00046119204,0.015562071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962752,0.0017099646,0.00013364168,0.0005178052,0.00067754835,0.0006859085],"domain_scores_gemma":[0.9425206,0.044575747,0.0033163133,0.003877263,0.0032363816,0.0024736866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010161189,0.0011423804,0.001805713,0.0054644835,0.0019302717,0.004644925,0.0025739144,0.0015550642,0.016182262],"category_scores_gemma":[0.04936036,0.0011077136,0.00092495343,0.0033642615,0.0073523833,0.009444597,0.0033644438,0.00465839,0.0027478822],"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.00036024855,0.000073031646,0.003140694,0.00013649378,0.000028147912,0.00016407644,0.00046503337,0.012141561,0.0008412014,0.96293277,0.006788763,0.012928149],"study_design_scores_gemma":[0.000106958985,0.00009192547,0.0032445756,0.00028535537,0.000028523606,0.00031977554,0.0002736667,0.11514597,0.0013129051,0.8763113,0.0027613011,0.00011774087],"about_ca_topic_score_codex":0.002510133,"about_ca_topic_score_gemma":0.001965288,"teacher_disagreement_score":0.016182262,"about_ca_system_score_codex":0.003400865,"about_ca_system_score_gemma":0.0020983028,"threshold_uncertainty_score":0.054135084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11276666,0.0010499646,0.80712336,0.0010033221,0.00020940113,0.00006926509,0.00034231934,0.0002818564,0.07715379],"genre_scores_gemma":[0.80556464,0.001600933,0.16078807,0.00089234597,0.00038261502,0.00026596294,0.0005609587,0.00021285051,0.0297317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993081,0.0001792892,0.00004628654,0.00016347898,0.00020803504,0.000094738076],"domain_scores_gemma":[0.9976882,0.0014966932,0.0002021142,0.00027825843,0.00021261266,0.00012216959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010304571,0.00089002703,0.0007728261,0.0015698874,0.0011126895,0.0022356394,0.0009972175,0.0013035417,0.008680572],"category_scores_gemma":[0.0033109873,0.00062750257,0.0011417837,0.0012334384,0.0021295473,0.0049352096,0.0019539988,0.0025273652,0.000970348],"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.000025547244,0.000017810919,0.00008971147,0.000046324807,0.000009621099,0.00003671282,0.00011197798,0.0025518427,0.0009912382,0.9865893,0.0008163385,0.008713563],"study_design_scores_gemma":[0.0000136850185,0.00003189664,0.00008464469,0.000027427299,0.000013138557,0.00012977138,0.000049127637,0.011055965,0.0010075694,0.9832827,0.0042885863,0.000015482923],"about_ca_topic_score_codex":0.0004859512,"about_ca_topic_score_gemma":0.0004590142,"teacher_disagreement_score":0.008680572,"about_ca_system_score_codex":0.001008031,"about_ca_system_score_gemma":0.00045128094,"threshold_uncertainty_score":0.029039443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5943659,0.009029286,0.15860334,0.0101909675,0.0017654592,0.00009514583,0.00052866986,0.00039377605,0.22502746],"genre_scores_gemma":[0.9613106,0.0024092116,0.012789877,0.0005388872,0.0016139111,0.000074950585,0.00012387184,0.00007011727,0.021068525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995357,0.0001457495,0.000013895232,0.00007136072,0.00013681353,0.000096484684],"domain_scores_gemma":[0.9979741,0.001178513,0.00033652497,0.00023240084,0.00012250636,0.00015587217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071112154,0.0007526352,0.0007815377,0.0022368268,0.0013150532,0.0020285859,0.00078516104,0.0012486207,0.0070315604],"category_scores_gemma":[0.0043055406,0.0003718323,0.00046924455,0.0026543483,0.0046209437,0.003844797,0.0013329389,0.0029967984,0.00065834913],"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.00001928367,0.000011900419,0.00007162827,0.00001563845,0.000001617797,0.000034823235,0.000057958776,0.00064040703,0.00032986794,0.994371,0.00080247625,0.00364347],"study_design_scores_gemma":[0.000009067427,0.000009787457,0.000095791074,0.0000072367775,0.0000020759278,0.000070335474,0.00002297248,0.0026670445,0.00021376397,0.99539465,0.0015002528,0.0000070011874],"about_ca_topic_score_codex":0.00055447855,"about_ca_topic_score_gemma":0.00060834025,"teacher_disagreement_score":0.0070315604,"about_ca_system_score_codex":0.0013628165,"about_ca_system_score_gemma":0.00077248743,"threshold_uncertainty_score":0.023522913},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015231603,0.001047527,0.3902779,0.0036216036,0.0032480583,0.00024289092,0.0066380585,0.0061063617,0.57358605],"genre_scores_gemma":[0.20836721,0.0024699648,0.2322904,0.0020109783,0.00075329916,0.0005249381,0.0086706355,0.004034186,0.54087836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959916,0.00008739585,0.000018788178,0.00006518629,0.00015852382,0.00007097133],"domain_scores_gemma":[0.9992731,0.00024929046,0.00008744654,0.00014541429,0.00021088941,0.000033934473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032761958,0.00062431913,0.000274093,0.0018471737,0.00094201847,0.0023835555,0.0005832824,0.0010931268,0.11314587],"category_scores_gemma":[0.0027700237,0.00041911862,0.0003021536,0.0020233104,0.0008147501,0.002503123,0.0007325337,0.0014613004,0.033143535],"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.00017227467,0.00006405345,0.00028894894,0.00016153454,0.000008438231,0.00013290104,0.00020255636,0.0019587919,0.0060898005,0.68812716,0.18149133,0.12130222],"study_design_scores_gemma":[0.000044643595,0.000048721333,0.00089638453,0.00012067423,0.000010970494,0.00043747327,0.0002110457,0.020142082,0.023658875,0.25738788,0.69697917,0.00006202205],"about_ca_topic_score_codex":0.0040717483,"about_ca_topic_score_gemma":0.0054925345,"teacher_disagreement_score":0.11314587,"about_ca_system_score_codex":0.001118053,"about_ca_system_score_gemma":0.0008149694,"threshold_uncertainty_score":0.37851065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19292194,0.0027794354,0.7060495,0.0033160676,0.0008536288,0.00016826879,0.00022594677,0.0008479168,0.09283743],"genre_scores_gemma":[0.71515983,0.0033975963,0.24517171,0.0008450731,0.00061377214,0.00019150367,0.00049990247,0.0005489072,0.033571776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984701,0.0007456072,0.000086737564,0.00015705203,0.00028989138,0.00025052336],"domain_scores_gemma":[0.99636346,0.0024395494,0.00017061844,0.00065072364,0.00019828565,0.00017749328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511565,0.0009991575,0.0010816648,0.00221204,0.002480334,0.0032912302,0.0012488479,0.0015515204,0.004599545],"category_scores_gemma":[0.006610682,0.0008464919,0.0015578342,0.0030134046,0.0058585526,0.008475043,0.003682749,0.0033645958,0.0009659856],"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.00002862393,0.000019483725,0.00015788239,0.000034970613,0.0000040676464,0.000049044247,0.00029460806,0.0015341201,0.00046401203,0.9832008,0.00081880967,0.013393786],"study_design_scores_gemma":[0.000007706899,0.000010714838,0.00003852392,0.000017803726,0.000003937501,0.000046387508,0.00006083397,0.0027675102,0.0005425841,0.99277365,0.003720718,0.000009581354],"about_ca_topic_score_codex":0.00091198744,"about_ca_topic_score_gemma":0.0011797914,"teacher_disagreement_score":0.004599545,"about_ca_system_score_codex":0.001530374,"about_ca_system_score_gemma":0.0011372074,"threshold_uncertainty_score":0.015386999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50521755,0.0030125638,0.39647868,0.0038101354,0.00081675017,0.00009318265,0.00025810822,0.00056083954,0.089752264],"genre_scores_gemma":[0.95602226,0.0010066265,0.02039627,0.0001792856,0.0004176804,0.0000460584,0.00015854357,0.00007600195,0.021697264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901104,0.00032060154,0.00003553377,0.00013616784,0.00031397623,0.00018273354],"domain_scores_gemma":[0.997703,0.001192096,0.00022831548,0.00041334154,0.00024135903,0.00022190211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121477,0.0007584283,0.0011822777,0.0016774167,0.0010808583,0.0026076909,0.0012588684,0.0009982849,0.006109425],"category_scores_gemma":[0.0070922906,0.0004215066,0.0005927173,0.0015678,0.0025841347,0.0057013207,0.002636512,0.0028082512,0.0010350489],"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.00010350172,0.000039263134,0.00022534272,0.000026490234,0.0000062440536,0.000049711656,0.00015836133,0.0050927484,0.0005180933,0.984814,0.00092293724,0.008043421],"study_design_scores_gemma":[0.000027638627,0.000026387528,0.00011937901,0.000015658206,0.0000085156225,0.00007499293,0.000058766087,0.04733794,0.0010249477,0.94856393,0.0027255986,0.000016265663],"about_ca_topic_score_codex":0.00077043194,"about_ca_topic_score_gemma":0.00049500365,"teacher_disagreement_score":0.006109425,"about_ca_system_score_codex":0.0019461864,"about_ca_system_score_gemma":0.0008411975,"threshold_uncertainty_score":0.020438015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9393675,0.0009973441,0.030990718,0.0032607482,0.0004649427,0.000029934263,0.00036447513,0.00022250466,0.024301877],"genre_scores_gemma":[0.99475443,0.00031184996,0.0023974765,0.000113894144,0.00046385013,0.000027875472,0.00014128308,0.00005682899,0.0017323857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971559,0.001019584,0.00016628654,0.00046186853,0.000660715,0.0005356326],"domain_scores_gemma":[0.97338796,0.018659122,0.002620004,0.002045518,0.0014983052,0.0017891368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054222276,0.0009615458,0.0014807823,0.0033332964,0.0017508803,0.0050211614,0.0024098803,0.0021890127,0.005410276],"category_scores_gemma":[0.028446602,0.0007507506,0.0007397326,0.0016826174,0.008705922,0.007706662,0.0024523898,0.0027081976,0.0006399064],"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.0020164072,0.00022385025,0.007190966,0.00019906767,0.00007176845,0.0006054028,0.00075259444,0.009108674,0.010062796,0.94565314,0.003028233,0.021087205],"study_design_scores_gemma":[0.00014913685,0.00013283444,0.002398606,0.00008449206,0.00005665003,0.00062811177,0.00021644967,0.041697852,0.004404193,0.9487902,0.0013485359,0.00009308833],"about_ca_topic_score_codex":0.00052109634,"about_ca_topic_score_gemma":0.0003300328,"teacher_disagreement_score":0.0054222276,"about_ca_system_score_codex":0.0014236654,"about_ca_system_score_gemma":0.0010333857,"threshold_uncertainty_score":0.028675854},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61524385,0.014019435,0.26465774,0.010866085,0.0011377045,0.00007842558,0.0007071792,0.00028926996,0.09300036],"genre_scores_gemma":[0.96606946,0.0029790492,0.015049814,0.00043055054,0.001298512,0.000060188948,0.00016605933,0.000042702017,0.013903705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897885,0.0003685259,0.00005366934,0.00015798068,0.00029858173,0.00014242926],"domain_scores_gemma":[0.9964353,0.002103556,0.00054880977,0.00038115642,0.00027058495,0.00026063426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171583,0.0006840097,0.0007798909,0.003064343,0.0014244865,0.002657823,0.0006605089,0.0013403773,0.0036170115],"category_scores_gemma":[0.0049482463,0.00062222604,0.00060515536,0.0021744715,0.0038741543,0.0043182992,0.0022485564,0.0025780236,0.00040715528],"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.000025626485,0.000011235278,0.00016385262,0.000018941142,0.000002875574,0.000029657755,0.00012155213,0.0013254316,0.00021833176,0.99435884,0.00048154668,0.0032421867],"study_design_scores_gemma":[0.000009358632,0.000009616825,0.00007850277,0.000015928284,0.000004002513,0.00008613206,0.000046056895,0.005976103,0.00029488938,0.9913127,0.0021567964,0.000009858504],"about_ca_topic_score_codex":0.00053844065,"about_ca_topic_score_gemma":0.0004086243,"teacher_disagreement_score":0.0036170115,"about_ca_system_score_codex":0.0016220261,"about_ca_system_score_gemma":0.00085864775,"threshold_uncertainty_score":0.01210016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6565156,0.023258554,0.18879634,0.0058780285,0.0014210152,0.00008248964,0.00064492313,0.00035976685,0.12304323],"genre_scores_gemma":[0.94627213,0.0075671007,0.01676941,0.00022034282,0.0013390013,0.000049495004,0.00026478685,0.000106018066,0.027411696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993093,0.00019585105,0.0000319463,0.000097427954,0.00023925382,0.00012632838],"domain_scores_gemma":[0.9967374,0.0021834814,0.00046070555,0.00014944772,0.00023680038,0.00023217175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010109494,0.0010666823,0.0011146733,0.0030567863,0.0010529717,0.0034124723,0.0010302886,0.0011670542,0.005948542],"category_scores_gemma":[0.008039151,0.0007119305,0.0004957143,0.0031681964,0.00372246,0.00452014,0.00152217,0.003342319,0.0012166917],"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.00010078066,0.0000416643,0.00049734395,0.000111196925,0.000010896493,0.00018259029,0.00048026876,0.0034153082,0.0018373172,0.9764189,0.0015714477,0.015332187],"study_design_scores_gemma":[0.000030231888,0.000021775044,0.00036984019,0.00006514618,0.000011414634,0.00021876257,0.00012754127,0.008641305,0.0007528513,0.98594254,0.0037949365,0.000023727764],"about_ca_topic_score_codex":0.0010522617,"about_ca_topic_score_gemma":0.001005459,"teacher_disagreement_score":0.005948542,"about_ca_system_score_codex":0.001384014,"about_ca_system_score_gemma":0.0007388365,"threshold_uncertainty_score":0.019899845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6020935,0.014730314,0.11796674,0.006709046,0.0019099895,0.000071860064,0.0004927715,0.00025069935,0.255775],"genre_scores_gemma":[0.96004313,0.006757568,0.009118295,0.00038319002,0.0015241113,0.0000502798,0.00017200618,0.00007204721,0.02187942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937904,0.00018863792,0.000022846367,0.000080935715,0.000182313,0.00014620525],"domain_scores_gemma":[0.99722254,0.0016281459,0.00036717628,0.00016894836,0.00032048507,0.00029264492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357486,0.0013925565,0.00092031626,0.0043825344,0.0015089242,0.002561447,0.0008904736,0.0010477254,0.006916214],"category_scores_gemma":[0.0071687796,0.00051648146,0.00046453287,0.0046565575,0.004383733,0.0041969214,0.002042445,0.0033220144,0.0009886539],"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.00003736741,0.000016014803,0.00023485022,0.000045955112,0.000004122253,0.000067352936,0.0002762745,0.0012338604,0.00060119125,0.99050677,0.0009253159,0.006050955],"study_design_scores_gemma":[0.000014318557,0.000011922417,0.0003288949,0.00003670878,0.000007054414,0.00009770477,0.000113921866,0.0040615,0.00037827573,0.9922231,0.0027107259,0.000015893696],"about_ca_topic_score_codex":0.0021409458,"about_ca_topic_score_gemma":0.0018215706,"teacher_disagreement_score":0.006916214,"about_ca_system_score_codex":0.00229445,"about_ca_system_score_gemma":0.00080172863,"threshold_uncertainty_score":0.023137093},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33426175,0.005653849,0.24442296,0.017700685,0.0043098177,0.00013044132,0.00088393595,0.0006222384,0.39201432],"genre_scores_gemma":[0.92440486,0.0031888601,0.027170142,0.0021775304,0.0033673672,0.00013706721,0.0007992579,0.00041803677,0.03833684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851197,0.00042811962,0.000083906096,0.00033662416,0.0003833422,0.0002560792],"domain_scores_gemma":[0.9957135,0.002417934,0.00037383448,0.00040731567,0.0005779778,0.0005096338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024650896,0.0009090902,0.0017899096,0.0029713532,0.002373779,0.0029280998,0.0017292753,0.002675439,0.02170681],"category_scores_gemma":[0.012091872,0.00055650645,0.00096503616,0.0025819046,0.00561085,0.01386432,0.004166286,0.0067133163,0.0017838269],"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.000051219165,0.000012803632,0.00017849459,0.00003513839,0.000002991472,0.000088648805,0.00010329737,0.00029834665,0.00023406844,0.9933141,0.001490808,0.004190132],"study_design_scores_gemma":[0.000009887932,0.0000073454316,0.000082021106,0.000011878222,0.0000022768218,0.000058738384,0.000046018755,0.0018782654,0.00010507511,0.9965263,0.0012661268,0.000006123242],"about_ca_topic_score_codex":0.0022604,"about_ca_topic_score_gemma":0.0012504506,"teacher_disagreement_score":0.02170681,"about_ca_system_score_codex":0.0015669634,"about_ca_system_score_gemma":0.0009218907,"threshold_uncertainty_score":0.07261652},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20269331,0.013651262,0.30060774,0.009108699,0.009642132,0.000117543656,0.0003919933,0.0006015177,0.46318585],"genre_scores_gemma":[0.8302307,0.012497027,0.0670929,0.002160101,0.006977714,0.000081842525,0.00038028945,0.00029822288,0.08028122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.000088775436,0.000026918931,0.0000982587,0.00015380049,0.00007783778],"domain_scores_gemma":[0.99880826,0.0007724199,0.00007211235,0.00015614221,0.000118824806,0.00007222591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073104067,0.00088226626,0.0006384106,0.0016106119,0.0012545593,0.0023004857,0.00067931117,0.001158142,0.005054955],"category_scores_gemma":[0.002974846,0.00041312192,0.0009604041,0.0015871003,0.0027569602,0.003655405,0.0015942613,0.004685432,0.0008685788],"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.000038256527,0.000025603462,0.00011937807,0.000052360232,0.000003736598,0.00017489016,0.00019459604,0.00080719223,0.0014089906,0.9804559,0.0025958896,0.014123275],"study_design_scores_gemma":[0.000008613849,0.000045329485,0.00019557151,0.000025727464,0.0000076111255,0.00042314935,0.000067087254,0.0028274774,0.001972806,0.97212124,0.022285283,0.000020159774],"about_ca_topic_score_codex":0.0006610895,"about_ca_topic_score_gemma":0.0005689055,"teacher_disagreement_score":0.005054955,"about_ca_system_score_codex":0.00083734165,"about_ca_system_score_gemma":0.0005942029,"threshold_uncertainty_score":0.016910493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.506295,0.0020783853,0.4196467,0.0030019446,0.00037447378,0.000088063425,0.0005271651,0.00019837366,0.06778985],"genre_scores_gemma":[0.953317,0.0010198926,0.033365738,0.00019745085,0.0005715729,0.000055966546,0.00016046103,0.000059661248,0.011252385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993013,0.00024293894,0.000036235182,0.00013120114,0.00017752936,0.00011080693],"domain_scores_gemma":[0.9958264,0.0019107523,0.0008307678,0.00039191605,0.0005728645,0.00046720263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012453243,0.0004804957,0.00068934314,0.0019356775,0.0013716454,0.0025430287,0.0009924808,0.000861519,0.005165388],"category_scores_gemma":[0.00436613,0.00042366315,0.000548872,0.0019602038,0.0034339956,0.004441699,0.001748221,0.001847156,0.00042880667],"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.000018732579,0.000014626589,0.0001036313,0.000012623827,0.0000022101071,0.000025179066,0.000101700185,0.0014540126,0.00036898218,0.9955031,0.00030632783,0.0020889717],"study_design_scores_gemma":[0.000010549586,0.00002068217,0.00013247556,0.000008501831,0.0000044981266,0.00007714301,0.00007587557,0.016472785,0.00042697028,0.9811102,0.0016478136,0.000012408633],"about_ca_topic_score_codex":0.0007914991,"about_ca_topic_score_gemma":0.000771966,"teacher_disagreement_score":0.005165388,"about_ca_system_score_codex":0.0012576011,"about_ca_system_score_gemma":0.00080865866,"threshold_uncertainty_score":0.017279983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9396581,0.00041337105,0.033746243,0.00053492805,0.00017311623,0.000033537013,0.00019158877,0.00016912696,0.025079995],"genre_scores_gemma":[0.9850249,0.00027382607,0.0031126984,0.00010651997,0.00018849893,0.000039707153,0.00012463283,0.00007059608,0.011058678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.00013768834,0.000029346505,0.000074793636,0.00014734575,0.00017471162],"domain_scores_gemma":[0.99816954,0.00062293676,0.0004624739,0.00015329622,0.00016758923,0.00042413073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008224154,0.000973727,0.0006868329,0.0046020956,0.0014653011,0.002644915,0.0008744627,0.0009503848,0.006065235],"category_scores_gemma":[0.0028267603,0.0005776693,0.0004919303,0.0022950266,0.0024609424,0.0034116001,0.002183939,0.0014221728,0.00081903604],"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.0002546812,0.000084070045,0.0017911268,0.000045059613,0.00002314066,0.0002115646,0.00047379392,0.002840689,0.0037111861,0.97923905,0.00096817146,0.010357497],"study_design_scores_gemma":[0.00005939956,0.00008660605,0.0017994795,0.000043097505,0.000029391878,0.0002720523,0.00026262083,0.01822286,0.003278784,0.97327584,0.0026151377,0.00005469066],"about_ca_topic_score_codex":0.00064351474,"about_ca_topic_score_gemma":0.0010491102,"teacher_disagreement_score":0.006065235,"about_ca_system_score_codex":0.0010978836,"about_ca_system_score_gemma":0.0005718635,"threshold_uncertainty_score":0.020290256},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101128146,0.06544522,0.24777292,0.055935774,0.040668197,0.0000982098,0.00080860796,0.0008810382,0.4872619],"genre_scores_gemma":[0.71564126,0.03664697,0.049935155,0.0106943995,0.05904817,0.0002403553,0.0006384973,0.0007214593,0.12643385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998437,0.0005369522,0.00012525258,0.0002517362,0.00045502844,0.00019406456],"domain_scores_gemma":[0.9954596,0.0033834889,0.0001532169,0.00036699726,0.00034188078,0.0002947728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019678476,0.0017095617,0.0022125905,0.00440367,0.00399367,0.005571544,0.0018433268,0.0027412,0.0065042297],"category_scores_gemma":[0.0065206056,0.00078043813,0.0014604478,0.00516791,0.0063653197,0.016124964,0.005146577,0.008554451,0.0013614355],"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.000021882726,0.000018461897,0.00008612243,0.00007430486,0.000007916153,0.000088353816,0.00014898201,0.00039802847,0.00033336418,0.9856592,0.0062078536,0.0069555338],"study_design_scores_gemma":[0.00000376183,0.000011826263,0.00008327218,0.00002640761,0.000007935198,0.00009678202,0.00003354296,0.0008051808,0.00020817123,0.979722,0.018988624,0.0000124979815],"about_ca_topic_score_codex":0.00067846134,"about_ca_topic_score_gemma":0.0007846835,"teacher_disagreement_score":0.0065042297,"about_ca_system_score_codex":0.0020619722,"about_ca_system_score_gemma":0.00079027744,"threshold_uncertainty_score":0.021758854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8596636,0.0018199031,0.10362186,0.0022494867,0.00029333957,0.000030201783,0.00019154255,0.00009556823,0.03203456],"genre_scores_gemma":[0.9869442,0.0007726319,0.0070431605,0.00012145617,0.0003486767,0.000025539135,0.00008573459,0.000032956304,0.004625528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894184,0.00035635504,0.00005853503,0.00017035016,0.00029600709,0.00017680938],"domain_scores_gemma":[0.99483925,0.0028430717,0.00084813946,0.0003801719,0.0003829633,0.00070641463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021797835,0.0008886911,0.0009720742,0.003347296,0.001538243,0.0033167829,0.0012343621,0.0014556936,0.0031575838],"category_scores_gemma":[0.009506587,0.0005958933,0.00054881023,0.0019934173,0.0069780555,0.005903427,0.0024175856,0.0023485592,0.00040308113],"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.00007738127,0.000028633365,0.00038825048,0.00002252847,0.000004049287,0.00010730208,0.00024861147,0.0015294725,0.0012127762,0.99315107,0.0002690791,0.0029608796],"study_design_scores_gemma":[0.00001593517,0.000021363856,0.00021340734,0.000014562732,0.0000039147317,0.00016294647,0.00009387466,0.007343267,0.00031067443,0.9912816,0.00052128447,0.000017096383],"about_ca_topic_score_codex":0.00075798354,"about_ca_topic_score_gemma":0.00046278746,"teacher_disagreement_score":0.003347296,"about_ca_system_score_codex":0.0015293871,"about_ca_system_score_gemma":0.0011219638,"threshold_uncertainty_score":0.0115279555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51742107,0.00066135207,0.41352144,0.001520887,0.00024052811,0.00009948376,0.00084938237,0.0002729959,0.06541295],"genre_scores_gemma":[0.8889366,0.0005958022,0.06828438,0.00031159952,0.0003097971,0.000104629886,0.0008819055,0.0001849421,0.040390477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993949,0.00012797565,0.00002945973,0.00021233187,0.00011375706,0.00012155414],"domain_scores_gemma":[0.99859697,0.00037356975,0.00022644023,0.00022268036,0.00019734332,0.00038299445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009351501,0.0006566713,0.0008235462,0.0021037695,0.0016175259,0.0025633995,0.0010710837,0.0009800199,0.0072763157],"category_scores_gemma":[0.0016873658,0.0004884399,0.0009351314,0.0013807926,0.003149452,0.004848492,0.0019837231,0.0022777542,0.0008618006],"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.00002025188,0.000009373878,0.00010911862,0.000010537253,0.0000035488235,0.000015732461,0.00012115097,0.00040652207,0.00042293686,0.9967282,0.00031019558,0.0018425714],"study_design_scores_gemma":[0.000009688335,0.000012516706,0.00018181617,0.000009461198,0.000007118812,0.000042421118,0.000086614455,0.0038176295,0.0002957107,0.9933164,0.0022133961,0.0000072520074],"about_ca_topic_score_codex":0.001146633,"about_ca_topic_score_gemma":0.00096934324,"teacher_disagreement_score":0.0072763157,"about_ca_system_score_codex":0.0011464548,"about_ca_system_score_gemma":0.00063364697,"threshold_uncertainty_score":0.024341762},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61744213,0.0031942755,0.20127329,0.008091607,0.00157177,0.0000678315,0.00043904013,0.00046158396,0.16745842],"genre_scores_gemma":[0.96046555,0.0009783441,0.010641771,0.00044407655,0.0011335826,0.000040107512,0.00014437624,0.00009087738,0.026061382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993598,0.00019342944,0.00002141337,0.000116511954,0.00016970959,0.00013903955],"domain_scores_gemma":[0.99900776,0.00037337575,0.0001691711,0.00012665389,0.00010528544,0.00021778543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007803317,0.0009839485,0.0006740736,0.0019359032,0.0012053606,0.0020422623,0.00066735264,0.0012491602,0.0071574734],"category_scores_gemma":[0.0017805218,0.00035531598,0.0007335904,0.0012816106,0.0034401205,0.0037768753,0.002077905,0.0021616719,0.0008043599],"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.000027186834,0.000017514412,0.000085963315,0.000016664782,0.0000032650798,0.000050635575,0.00012678509,0.00063883583,0.0005970783,0.9941518,0.00076001004,0.003524271],"study_design_scores_gemma":[0.0000139370195,0.000018167473,0.00009518632,0.000011896967,0.0000056842973,0.00007894158,0.00004012118,0.004207181,0.00037293628,0.99230474,0.0028410242,0.00001025656],"about_ca_topic_score_codex":0.0006016449,"about_ca_topic_score_gemma":0.00042158374,"teacher_disagreement_score":0.0071574734,"about_ca_system_score_codex":0.0010077779,"about_ca_system_score_gemma":0.00063687767,"threshold_uncertainty_score":0.02394414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7208339,0.0030868233,0.18175396,0.0061555863,0.00059119414,0.00008193918,0.00054376887,0.0004156186,0.08653713],"genre_scores_gemma":[0.95566213,0.0016045643,0.021342129,0.00042881045,0.00082584703,0.00007400123,0.0004359676,0.000112446105,0.019514095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863595,0.00038140084,0.00007845367,0.0002940048,0.00033638833,0.0002736955],"domain_scores_gemma":[0.9932193,0.004605944,0.0005279599,0.00043811765,0.00059493317,0.0006137071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019001864,0.0010891431,0.0012069553,0.0034097654,0.0018822234,0.004265033,0.0013091193,0.002009447,0.004911932],"category_scores_gemma":[0.0087011745,0.0009751334,0.00091748306,0.0022963262,0.006518153,0.009533118,0.0036294865,0.004849794,0.0008199426],"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.00006604764,0.000025033309,0.0003318126,0.000052248586,0.000004475953,0.000056981276,0.0003183624,0.0005644225,0.0007999803,0.9929349,0.000516058,0.004329782],"study_design_scores_gemma":[0.000014011634,0.000013639976,0.00008251966,0.000015484487,0.0000042273336,0.000082831655,0.000056671084,0.0014818691,0.00046663333,0.99679655,0.00097593205,0.000009598991],"about_ca_topic_score_codex":0.00043456175,"about_ca_topic_score_gemma":0.00036650183,"teacher_disagreement_score":0.004911932,"about_ca_system_score_codex":0.0018912525,"about_ca_system_score_gemma":0.0010637657,"threshold_uncertainty_score":0.016432047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17990635,0.0077860397,0.17469375,0.008609049,0.0029949816,0.00009142038,0.00089214573,0.0008550081,0.62417126],"genre_scores_gemma":[0.89222115,0.0023754777,0.022853466,0.0018601643,0.0013811243,0.00009593518,0.0004354714,0.00034021516,0.07843702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888176,0.0003458143,0.000056329965,0.000271151,0.0002641219,0.0001808389],"domain_scores_gemma":[0.9988813,0.0003882935,0.00015803154,0.00013304912,0.00024521988,0.00019422961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017238877,0.0011267682,0.0010162527,0.0023252124,0.0022294268,0.0037857704,0.0010401936,0.0010337869,0.02154043],"category_scores_gemma":[0.0033440986,0.00048584168,0.0013499715,0.0018775307,0.0049661617,0.005471381,0.0023285765,0.0033066769,0.0051806346],"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.000027198266,0.000010729413,0.000090815,0.000033782355,0.000006196421,0.00007076566,0.00019404062,0.0003671752,0.0002501733,0.9932882,0.0021384028,0.0035224322],"study_design_scores_gemma":[0.000010564209,0.000018598,0.00015786591,0.000013548579,0.000005185092,0.000076378725,0.000059782607,0.0011685009,0.00023649329,0.9923794,0.00586094,0.000012618299],"about_ca_topic_score_codex":0.002797783,"about_ca_topic_score_gemma":0.0012888317,"teacher_disagreement_score":0.02154043,"about_ca_system_score_codex":0.0024089634,"about_ca_system_score_gemma":0.0010502897,"threshold_uncertainty_score":0.07205993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9021509,0.00069717754,0.045929614,0.0021797037,0.00027555917,0.000093512106,0.00034562728,0.00027902576,0.04804884],"genre_scores_gemma":[0.97550464,0.00089993025,0.006934761,0.00037267877,0.00033852825,0.00006344817,0.0005383614,0.00017008638,0.015177652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994179,0.00015812428,0.000022583446,0.00012263877,0.00012651137,0.00015219257],"domain_scores_gemma":[0.9973769,0.0011815323,0.0006314692,0.00018687335,0.00018348588,0.00043979473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006719774,0.0013429354,0.0011706923,0.004177508,0.002633379,0.0036102592,0.001361059,0.0014878213,0.009144222],"category_scores_gemma":[0.0031847793,0.0006673078,0.0009085914,0.002706327,0.0035854436,0.0050471164,0.0021786296,0.0025349401,0.00084487867],"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.00013171729,0.000071568116,0.0009457024,0.00005897035,0.000010880718,0.0003176835,0.000840051,0.0028381832,0.0014868074,0.9830273,0.0015369742,0.008734119],"study_design_scores_gemma":[0.000025257998,0.00002130597,0.00058505207,0.000025559459,0.000012894286,0.00010469598,0.00034176253,0.004143615,0.00050123397,0.99264187,0.0015835864,0.000013184779],"about_ca_topic_score_codex":0.0013347745,"about_ca_topic_score_gemma":0.0014380936,"teacher_disagreement_score":0.009144222,"about_ca_system_score_codex":0.0016139492,"about_ca_system_score_gemma":0.000657341,"threshold_uncertainty_score":0.030590475},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2418554,0.012063785,0.15523712,0.011524573,0.003495056,0.00013156733,0.0013749659,0.0005019385,0.5738157],"genre_scores_gemma":[0.7737526,0.013586088,0.02295859,0.0020703026,0.0067269676,0.00010074211,0.0022547373,0.00039805422,0.17815197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999156,0.00016168234,0.000039444385,0.00012989386,0.00029604376,0.00021705963],"domain_scores_gemma":[0.99739057,0.0013720418,0.00021131233,0.00039340707,0.00028266574,0.00035015502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014474246,0.0019680012,0.0015966523,0.0035094868,0.002487534,0.002831532,0.0013739858,0.0010253853,0.021477068],"category_scores_gemma":[0.0037778695,0.00066986546,0.0020059948,0.0057861493,0.0040645073,0.009864134,0.0033522758,0.005177001,0.003166724],"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.0001100979,0.00010882249,0.00025351136,0.00019671765,0.000018074317,0.00016169182,0.00022984328,0.0018333961,0.0011039666,0.97356695,0.0055441754,0.016872803],"study_design_scores_gemma":[0.000016979944,0.000042161737,0.00035597774,0.000039077884,0.000023251303,0.00017349765,0.000078951394,0.0021149628,0.00095058297,0.9831933,0.0129914675,0.00001973687],"about_ca_topic_score_codex":0.0009654357,"about_ca_topic_score_gemma":0.0013113549,"teacher_disagreement_score":0.021477068,"about_ca_system_score_codex":0.0015345906,"about_ca_system_score_gemma":0.0011367422,"threshold_uncertainty_score":0.071847975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70743096,0.0017987072,0.20005426,0.005209895,0.0006768301,0.000089992376,0.00040590658,0.0003057945,0.084027626],"genre_scores_gemma":[0.9527375,0.0006939589,0.02394794,0.0005742367,0.0005331137,0.00007229011,0.00038076326,0.00017083308,0.020889325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999,0.0003142154,0.00006505385,0.00019796334,0.00020506885,0.00021772893],"domain_scores_gemma":[0.9974353,0.00093816995,0.00045863856,0.00025733595,0.00035520832,0.0005554928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029970834,0.0012040684,0.0019743089,0.0028504732,0.004081457,0.0048972075,0.0028124205,0.0038002352,0.006342334],"category_scores_gemma":[0.0073986426,0.0011058563,0.0022770036,0.0016543485,0.00619673,0.010738111,0.0036729209,0.0040002344,0.0006522596],"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.000013576629,0.000016877095,0.00011175166,0.000013221261,0.000006152299,0.000043193493,0.00010458834,0.00042334574,0.00020864065,0.9984927,0.00019818479,0.00036774864],"study_design_scores_gemma":[0.00001490909,0.000011325095,0.000110289504,0.000011265462,0.0000054906923,0.00009805339,0.00013738258,0.004513505,0.0002499851,0.99446434,0.00036884696,0.00001463851],"about_ca_topic_score_codex":0.0013025935,"about_ca_topic_score_gemma":0.0014357358,"teacher_disagreement_score":0.006342334,"about_ca_system_score_codex":0.0024099732,"about_ca_system_score_gemma":0.0017782664,"threshold_uncertainty_score":0.021217167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17486276,0.0027850932,0.752207,0.001741267,0.0005210479,0.00013750292,0.00038522482,0.00025757914,0.06710252],"genre_scores_gemma":[0.84984356,0.0025025448,0.110070065,0.00059419597,0.00086522027,0.0002365553,0.00034430315,0.00011394525,0.03542967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690336,0.0009285387,0.00023046618,0.00062278705,0.0009242336,0.00039067038],"domain_scores_gemma":[0.9907548,0.004413248,0.0011762944,0.0017762802,0.0012314493,0.00064778305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004433191,0.00064134615,0.0010510705,0.0027957244,0.0029762054,0.0045181965,0.0015583794,0.0018968685,0.007156173],"category_scores_gemma":[0.008355522,0.00063589937,0.00096911,0.0038273348,0.005144287,0.00918232,0.0032980838,0.0036668396,0.0011589763],"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.000010992124,0.0000067679707,0.000037570753,0.0000075928056,0.0000026554662,0.000011136045,0.00007119864,0.00031731403,0.0001618022,0.99750996,0.00013459199,0.001728394],"study_design_scores_gemma":[0.000008245705,0.000014531644,0.00009480062,0.0000105947865,0.000007835093,0.000078591496,0.000036422134,0.005526669,0.00041729663,0.9905381,0.0032522036,0.000014519869],"about_ca_topic_score_codex":0.0006313445,"about_ca_topic_score_gemma":0.00030553734,"teacher_disagreement_score":0.007156173,"about_ca_system_score_codex":0.0014638801,"about_ca_system_score_gemma":0.0013162099,"threshold_uncertainty_score":0.023939729},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30384398,0.011047699,0.21849231,0.10977525,0.0043701595,0.0001406313,0.00165353,0.0010314285,0.349645],"genre_scores_gemma":[0.9348771,0.003821986,0.025705772,0.0051958663,0.0054730275,0.00015275928,0.0012462887,0.00029332898,0.023233885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995411,0.0015732684,0.0001912391,0.0009651644,0.0009881444,0.00087124144],"domain_scores_gemma":[0.97052336,0.023261195,0.001057994,0.002408361,0.0016381876,0.001110957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005907461,0.001340796,0.0028260157,0.0029929015,0.004222319,0.0055575413,0.0027510135,0.0054237787,0.011326445],"category_scores_gemma":[0.029472275,0.0010325541,0.0023325523,0.0039399387,0.015626894,0.02308897,0.0067253625,0.011433317,0.0016298464],"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.00007824661,0.000024162144,0.00017764766,0.0000561378,0.0000055743308,0.000043200136,0.0002297174,0.0007740474,0.00013419565,0.9929767,0.003016368,0.0024839805],"study_design_scores_gemma":[0.000026367605,0.000012330229,0.00008118457,0.000026232869,0.000005395239,0.000043415035,0.00006250763,0.0021222406,0.00010207512,0.99532723,0.0021790434,0.000011946517],"about_ca_topic_score_codex":0.0024099948,"about_ca_topic_score_gemma":0.0011816359,"teacher_disagreement_score":0.011326445,"about_ca_system_score_codex":0.0037745954,"about_ca_system_score_gemma":0.0018928663,"threshold_uncertainty_score":0.037890673},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7456042,0.0017652587,0.11115841,0.0030670583,0.00054378336,0.000096698,0.00035196825,0.00021696814,0.13719565],"genre_scores_gemma":[0.95804924,0.0014785222,0.013808004,0.00049434614,0.0008689372,0.000094043935,0.0004929521,0.00012438247,0.024589596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998865,0.0003101487,0.00006832401,0.00019362538,0.0002692887,0.00029359446],"domain_scores_gemma":[0.9959656,0.002560296,0.00044396886,0.0003208929,0.00029649088,0.0004127839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018201101,0.0007992656,0.00096888246,0.0030263586,0.0023724874,0.0043846234,0.0009905428,0.0017912323,0.0066984617],"category_scores_gemma":[0.005765517,0.00059815746,0.0016011923,0.0016499393,0.004766843,0.0061054444,0.0018655839,0.0034046422,0.00063651905],"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.000042714597,0.00003066719,0.00027370724,0.000016403288,0.0000038387925,0.000082700404,0.00018175921,0.0004955616,0.00044773016,0.99503195,0.00054601114,0.002846869],"study_design_scores_gemma":[0.000022750537,0.000026889591,0.0002713482,0.00002123222,0.000007212486,0.00023556038,0.00011755536,0.00457523,0.0004287581,0.9918339,0.0024442591,0.000015341755],"about_ca_topic_score_codex":0.0008888948,"about_ca_topic_score_gemma":0.0005406103,"teacher_disagreement_score":0.0066984617,"about_ca_system_score_codex":0.0015889836,"about_ca_system_score_gemma":0.0010333355,"threshold_uncertainty_score":0.022408605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9218352,0.0010806042,0.06455965,0.0006020976,0.00009386423,0.000041502597,0.00037447535,0.00018302377,0.011229596],"genre_scores_gemma":[0.98771125,0.0005737912,0.007169901,0.00007205988,0.0002686506,0.00002095139,0.00045848257,0.00003770988,0.0036872094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993938,0.00015697918,0.00004253726,0.00012640003,0.00015055004,0.00012970045],"domain_scores_gemma":[0.99752253,0.000889528,0.0008322248,0.0003067034,0.00016143448,0.00028742058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087777566,0.00036452644,0.0006454164,0.0017974473,0.00078856753,0.002276439,0.0006392112,0.00049395824,0.002912577],"category_scores_gemma":[0.0025613632,0.00022476155,0.00045233587,0.0020269668,0.002247705,0.003874088,0.0009184456,0.0011153882,0.00035202657],"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.00030447872,0.00012492576,0.010221233,0.0000903728,0.000018799266,0.00017655469,0.00041399073,0.006154435,0.004268087,0.92816246,0.0027354648,0.04732907],"study_design_scores_gemma":[0.000053139218,0.0001328675,0.0072623254,0.00005297124,0.00003240232,0.0006380728,0.00036362253,0.03719522,0.0045768283,0.9407874,0.008862981,0.000042219668],"about_ca_topic_score_codex":0.00025186353,"about_ca_topic_score_gemma":0.00017888173,"teacher_disagreement_score":0.002912577,"about_ca_system_score_codex":0.00065572135,"about_ca_system_score_gemma":0.0005323094,"threshold_uncertainty_score":0.009743571},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49110064,0.008041856,0.25450855,0.0067756367,0.0012836427,0.000058652004,0.00023000764,0.00047548828,0.23752561],"genre_scores_gemma":[0.9549056,0.001641143,0.019458171,0.000551228,0.0009438538,0.000056256576,0.000095511765,0.000069247406,0.022278994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875796,0.00045504404,0.000072091105,0.00032595673,0.00025243848,0.00013658535],"domain_scores_gemma":[0.99693054,0.0017299057,0.00032477503,0.00038428948,0.00023745804,0.00039307977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024683047,0.0007910373,0.0010385034,0.0023655207,0.002753809,0.0032876926,0.0010624719,0.0011250827,0.005861569],"category_scores_gemma":[0.003470366,0.00071477215,0.00080977095,0.0016623908,0.0077564577,0.011790315,0.0035567484,0.0028468582,0.0005938816],"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.000010476781,0.000008164088,0.0000338485,0.000010799304,0.000002289683,0.000012241276,0.00010319455,0.000079919424,0.000178871,0.9983797,0.00012990154,0.0010505841],"study_design_scores_gemma":[0.0000061630617,0.000006956119,0.000038332648,0.0000051817765,0.000003319805,0.000039314877,0.000038385835,0.00037953217,0.00022546716,0.99819916,0.0010534484,0.0000048248735],"about_ca_topic_score_codex":0.0003179853,"about_ca_topic_score_gemma":0.00030675798,"teacher_disagreement_score":0.005861569,"about_ca_system_score_codex":0.0014880197,"about_ca_system_score_gemma":0.00062639115,"threshold_uncertainty_score":0.019608915},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13314098,0.013157339,0.2364321,0.01366453,0.0027709485,0.00010877377,0.001154351,0.0010140016,0.59855694],"genre_scores_gemma":[0.79422027,0.0070803463,0.040736265,0.0022808015,0.0042834096,0.00020322941,0.0008347557,0.00051291595,0.14984797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928826,0.00019088315,0.000030066454,0.00015054834,0.00025419635,0.0000861105],"domain_scores_gemma":[0.9985557,0.0007718841,0.00016160695,0.00012520346,0.00016489874,0.00022067805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014859127,0.0017048597,0.0013944475,0.0044102827,0.0027041733,0.005134289,0.0019201493,0.0023045726,0.012465356],"category_scores_gemma":[0.0042161667,0.00087050383,0.0009967895,0.003367347,0.0043690936,0.009474554,0.0025581478,0.006126528,0.0017474707],"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.000022865288,0.000011556345,0.000075130294,0.000039578765,0.0000051416564,0.000031488806,0.00010041777,0.000384211,0.00023905201,0.9936466,0.0020893083,0.003354555],"study_design_scores_gemma":[0.000010436396,0.000008014663,0.00014127846,0.000013828828,0.000006331468,0.00006826928,0.000030507314,0.0022442227,0.00022789938,0.9896757,0.0075629386,0.000010611021],"about_ca_topic_score_codex":0.0015342326,"about_ca_topic_score_gemma":0.0009950555,"teacher_disagreement_score":0.012465356,"about_ca_system_score_codex":0.003189718,"about_ca_system_score_gemma":0.00064955704,"threshold_uncertainty_score":0.04170078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22083981,0.013724124,0.52879417,0.015342702,0.00198047,0.00037862366,0.003511587,0.0024599044,0.21296859],"genre_scores_gemma":[0.8613647,0.0047375527,0.07689197,0.0032049697,0.0027139036,0.00051269145,0.0013043418,0.0013468176,0.047923066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99491936,0.001234614,0.00013930372,0.00085416524,0.0012465849,0.001605839],"domain_scores_gemma":[0.94690514,0.042313423,0.0016011818,0.004730186,0.001559895,0.0028902006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004329485,0.00342113,0.0041880924,0.0048386245,0.0034127792,0.007742964,0.0063118218,0.0047288514,0.030983044],"category_scores_gemma":[0.03290311,0.0018108444,0.0020460405,0.00425743,0.0068181115,0.015446046,0.009605845,0.00816433,0.0032730603],"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.0014896778,0.0002954817,0.001358156,0.0008553354,0.00012045471,0.00037145024,0.0005687634,0.0283649,0.0072997953,0.90441436,0.021223258,0.033638358],"study_design_scores_gemma":[0.00013923744,0.00014027569,0.0007058609,0.00022626389,0.00014765089,0.0003900637,0.00021069466,0.109789334,0.003673526,0.87502307,0.009473786,0.00008027938],"about_ca_topic_score_codex":0.0015566347,"about_ca_topic_score_gemma":0.001808486,"teacher_disagreement_score":0.030983044,"about_ca_system_score_codex":0.0039345045,"about_ca_system_score_gemma":0.0018793939,"threshold_uncertainty_score":0.10364854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75592905,0.007807451,0.110078886,0.0028771975,0.0005488845,0.00007345863,0.00022366675,0.0002227134,0.12223866],"genre_scores_gemma":[0.9217626,0.0038916667,0.01883934,0.00027907643,0.00070144486,0.00004325016,0.00014906222,0.00010076074,0.054232832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946636,0.00013723513,0.00003161855,0.00015356668,0.000113639515,0.00009764867],"domain_scores_gemma":[0.9977191,0.001145771,0.000388947,0.00013177954,0.00018596662,0.00042839372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087719865,0.0006259039,0.0012035455,0.004267428,0.0028444799,0.0034919577,0.0011567753,0.0015571328,0.007864434],"category_scores_gemma":[0.003682324,0.00071989995,0.00088249665,0.0039931755,0.0048953677,0.008021937,0.0030031335,0.0029738233,0.00063101156],"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.000017211607,0.0000185749,0.00024302865,0.000022424418,0.0000045952866,0.00005088496,0.00029825745,0.0006171004,0.0002560227,0.994251,0.00035723308,0.003863692],"study_design_scores_gemma":[0.000014994754,0.000017904827,0.0003525283,0.0000287515,0.00000911673,0.00012830726,0.00020534791,0.0035841553,0.000436627,0.99119735,0.004011,0.00001390358],"about_ca_topic_score_codex":0.0023240843,"about_ca_topic_score_gemma":0.0019911844,"teacher_disagreement_score":0.007864434,"about_ca_system_score_codex":0.002191401,"about_ca_system_score_gemma":0.00057169946,"threshold_uncertainty_score":0.026309192},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83666223,0.0004350892,0.12283584,0.0006249578,0.00009413395,0.000073098454,0.00042389517,0.00043314733,0.03841765],"genre_scores_gemma":[0.95975596,0.00029100792,0.028732767,0.0001067901,0.00010467577,0.00003973366,0.00048695723,0.00009965937,0.010382459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990595,0.00024262824,0.00006722057,0.00009707754,0.00030165125,0.00023193672],"domain_scores_gemma":[0.9975701,0.0013908277,0.0002628673,0.00028903078,0.00025057507,0.00023665986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009835964,0.0006972785,0.000870978,0.0021213486,0.0012802333,0.003154441,0.0010808449,0.00087854284,0.0035163488],"category_scores_gemma":[0.004236012,0.00040901263,0.00054376916,0.0021392666,0.0015822704,0.002332953,0.0016101818,0.0012527066,0.00073580944],"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.000501845,0.00021004134,0.0027691096,0.0002504748,0.000026093652,0.000397484,0.000621753,0.0075218263,0.015725626,0.9285787,0.0024696,0.040927507],"study_design_scores_gemma":[0.000085475855,0.00013684128,0.001485461,0.00008939487,0.000053436397,0.0011322821,0.0003141313,0.06320539,0.020665653,0.90571564,0.007060352,0.000055970693],"about_ca_topic_score_codex":0.0003628366,"about_ca_topic_score_gemma":0.0008154565,"teacher_disagreement_score":0.0035163488,"about_ca_system_score_codex":0.0010254864,"about_ca_system_score_gemma":0.00091633335,"threshold_uncertainty_score":0.011763334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6494262,0.011131026,0.20024997,0.004813999,0.0019633884,0.000048303566,0.00052075915,0.000419362,0.131427],"genre_scores_gemma":[0.97157764,0.002805225,0.011336334,0.00028186923,0.0019972115,0.000042277665,0.00020482753,0.00007947287,0.011675225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821943,0.00045178522,0.0001210112,0.0002799786,0.00063025503,0.0002975126],"domain_scores_gemma":[0.99421966,0.0033823585,0.00080213265,0.00046443316,0.00046560858,0.00066573784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019199986,0.0010023892,0.00135503,0.0057276827,0.001728589,0.0058532585,0.0017457894,0.0012878156,0.0034301481],"category_scores_gemma":[0.008082189,0.0006505775,0.0006710847,0.0045194253,0.0050927126,0.009437819,0.0027372842,0.0032642717,0.0007397626],"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.000055185323,0.000023900568,0.00024931412,0.000031333613,0.0000055112246,0.00005062545,0.00017119395,0.0008912374,0.0007170188,0.9920344,0.0004655938,0.005304738],"study_design_scores_gemma":[0.000011846629,0.000029396035,0.0003399721,0.00003715695,0.0000151997,0.0001486081,0.00006973177,0.0063248435,0.0009375474,0.9892641,0.0027991931,0.000022441389],"about_ca_topic_score_codex":0.0005125143,"about_ca_topic_score_gemma":0.00041404564,"teacher_disagreement_score":0.0058532585,"about_ca_system_score_codex":0.002030965,"about_ca_system_score_gemma":0.0010270317,"threshold_uncertainty_score":0.014735758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63256294,0.003007206,0.20504193,0.0030464663,0.0014053286,0.00022903769,0.00087010366,0.00048420945,0.15335281],"genre_scores_gemma":[0.93517566,0.0015644941,0.033137467,0.00075746584,0.00067998585,0.00021714179,0.00039136512,0.00015288545,0.027923418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996039,0.00008172451,0.000027203145,0.00007152135,0.00012068117,0.00009492884],"domain_scores_gemma":[0.99913055,0.00036264386,0.00016461284,0.00014835976,0.000092512724,0.000101290534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048253985,0.0008411406,0.00045080928,0.0019261204,0.00087036454,0.0018868111,0.0006366328,0.0017917141,0.0059994394],"category_scores_gemma":[0.0024453064,0.00029464767,0.0005084734,0.001775242,0.0017830865,0.0023444714,0.0016984402,0.0016001322,0.0011987368],"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.000082218176,0.000031756445,0.0002262895,0.00006143579,0.000005307946,0.00014012055,0.00017960498,0.0014587626,0.0037246083,0.97519636,0.0013654319,0.01752807],"study_design_scores_gemma":[0.00002281097,0.00003168769,0.0002838824,0.000049369246,0.0000067004803,0.00036944915,0.00006811417,0.007554507,0.0041142944,0.9826774,0.004788689,0.000033030214],"about_ca_topic_score_codex":0.00027076065,"about_ca_topic_score_gemma":0.0002211805,"teacher_disagreement_score":0.0059994394,"about_ca_system_score_codex":0.00076364004,"about_ca_system_score_gemma":0.00066448277,"threshold_uncertainty_score":0.020070136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79629374,0.0009778101,0.15724823,0.002876679,0.00030052752,0.000074984135,0.00029530784,0.00018107827,0.04175163],"genre_scores_gemma":[0.955864,0.0007414195,0.02272907,0.00037984847,0.00050431315,0.000120183526,0.00030146295,0.0001585072,0.019201161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991321,0.00033858622,0.000031679196,0.00017006799,0.00013823938,0.00018925128],"domain_scores_gemma":[0.99366283,0.0042136423,0.0006431395,0.00029894305,0.00029027046,0.0008913257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018035329,0.0009867572,0.0012506484,0.003077186,0.0024741925,0.0033056773,0.0020219965,0.0020716449,0.008245022],"category_scores_gemma":[0.00733325,0.001168266,0.001513004,0.0021165793,0.00586215,0.006152814,0.002615542,0.003203462,0.0005532275],"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.000035048746,0.000026627265,0.00030313147,0.000025272246,0.000007996367,0.00005325557,0.00042500466,0.0015159675,0.0006344732,0.99467963,0.00057276164,0.0017207733],"study_design_scores_gemma":[0.000014507463,0.000007634244,0.00024328269,0.000012132065,0.000005214171,0.000036237314,0.0001725763,0.009410187,0.00013469138,0.9894671,0.00048499092,0.000011552345],"about_ca_topic_score_codex":0.002077212,"about_ca_topic_score_gemma":0.0031204787,"teacher_disagreement_score":0.008245022,"about_ca_system_score_codex":0.0017049003,"about_ca_system_score_gemma":0.0007372972,"threshold_uncertainty_score":0.027582347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7768325,0.0031796969,0.1353429,0.0028839367,0.0002964274,0.0000635611,0.00051459874,0.00056742283,0.08031888],"genre_scores_gemma":[0.9645216,0.0013037043,0.009755633,0.0001815291,0.00040244238,0.000058167945,0.00037216282,0.00010172949,0.023303147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991792,0.00027345004,0.000034249566,0.00012422798,0.00023993803,0.00014896429],"domain_scores_gemma":[0.997445,0.0012674341,0.00036107367,0.00015004382,0.00030803672,0.00046834996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014050665,0.0009913467,0.000987146,0.0049025016,0.0023356928,0.0031295414,0.0015340238,0.0012996446,0.0068999166],"category_scores_gemma":[0.0039566136,0.00081490964,0.00089857186,0.0027266613,0.0041284026,0.005066573,0.0029791442,0.0021776645,0.0005653697],"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.000044577053,0.00002834225,0.00056970026,0.00004339825,0.000017745788,0.00016916177,0.0004025331,0.0012458388,0.000762197,0.99224275,0.0007774109,0.003696315],"study_design_scores_gemma":[0.000037128484,0.0000478418,0.001133198,0.00004476441,0.000027217407,0.0004101278,0.00044864032,0.013103936,0.00089078123,0.98060226,0.0032222983,0.000031944397],"about_ca_topic_score_codex":0.0013288422,"about_ca_topic_score_gemma":0.0010451523,"teacher_disagreement_score":0.0068999166,"about_ca_system_score_codex":0.0025446317,"about_ca_system_score_gemma":0.00053481414,"threshold_uncertainty_score":0.023082554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879822,0.00035008078,0.037454255,0.0023109387,0.0002752804,0.000049752212,0.00053238694,0.00025708484,0.0707879],"genre_scores_gemma":[0.970666,0.000257493,0.004724061,0.00036985616,0.00020219418,0.00003405668,0.00050234474,0.00015830345,0.023085786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996946,0.00007376432,0.0000073106044,0.000054338965,0.00007582635,0.00009421994],"domain_scores_gemma":[0.99891424,0.0004647194,0.00017099993,0.00005884983,0.00013823797,0.00025292768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044849492,0.0004906221,0.00057332666,0.0016696554,0.0016619888,0.0012003473,0.00082560873,0.00095713657,0.009428199],"category_scores_gemma":[0.0012864408,0.0002559652,0.0004292938,0.0009953044,0.002068041,0.0021583543,0.000773735,0.0012123269,0.0006896914],"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.00013718856,0.000041017694,0.0004693938,0.00005239658,0.000008179656,0.00027477893,0.00021151073,0.0039728465,0.0028714752,0.984186,0.0022960051,0.0054791304],"study_design_scores_gemma":[0.000042108808,0.00004030485,0.0016317286,0.000030586114,0.000008996427,0.00024062113,0.00017987673,0.018964859,0.0013152228,0.9743201,0.0031934292,0.0000320262],"about_ca_topic_score_codex":0.0039013342,"about_ca_topic_score_gemma":0.004318617,"teacher_disagreement_score":0.009428199,"about_ca_system_score_codex":0.0011863619,"about_ca_system_score_gemma":0.00073217606,"threshold_uncertainty_score":0.031540453},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.573775,0.022436924,0.11233459,0.026477458,0.0023032508,0.00006147739,0.00061276444,0.00046573335,0.2615327],"genre_scores_gemma":[0.9610245,0.0048931167,0.0089139035,0.0009796644,0.0013261497,0.000050310893,0.00028382923,0.000053177322,0.022475317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992355,0.00023180354,0.00003605992,0.00013907795,0.00018701743,0.00017052736],"domain_scores_gemma":[0.9972088,0.001805659,0.0003187457,0.0003087619,0.00016682466,0.00019126247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017652494,0.0008138368,0.001203697,0.0030798025,0.002859113,0.0035369329,0.0010895245,0.00246429,0.0067422143],"category_scores_gemma":[0.0059515773,0.0005500792,0.0007599019,0.0040545478,0.008443155,0.007072359,0.0023951316,0.004639678,0.00094384176],"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.000039817518,0.000017038292,0.00020781609,0.000036732476,0.0000030689625,0.00003746125,0.00015137669,0.0008858016,0.00014734794,0.9931467,0.0013848686,0.003941934],"study_design_scores_gemma":[0.000008347079,0.000004222758,0.000072942996,0.000012943284,0.0000022841111,0.000027866907,0.00004649069,0.0009460167,0.000052157357,0.99727136,0.0015489857,0.00000638073],"about_ca_topic_score_codex":0.0030751417,"about_ca_topic_score_gemma":0.0028184955,"teacher_disagreement_score":0.0067422143,"about_ca_system_score_codex":0.0021675734,"about_ca_system_score_gemma":0.0010920896,"threshold_uncertainty_score":0.022554934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6651867,0.012097411,0.18444835,0.0056340415,0.0009907509,0.00009319926,0.0004894965,0.0006255042,0.13043462],"genre_scores_gemma":[0.9551555,0.0034611353,0.014902435,0.00025651732,0.000802253,0.000049777023,0.00013842164,0.0000687339,0.025165219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959034,0.00012304871,0.000015781701,0.000066577086,0.00011215706,0.00009216792],"domain_scores_gemma":[0.99858946,0.00071682694,0.00028992494,0.00011784112,0.00014502766,0.00014084703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066829554,0.00090022234,0.0009535544,0.0030730315,0.0012700883,0.0026772015,0.00078909675,0.0011320037,0.0060587362],"category_scores_gemma":[0.0033627637,0.00055741286,0.0005102956,0.0034478093,0.003878343,0.004209895,0.0014966839,0.00253141,0.0008402454],"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.000032844106,0.000009480252,0.00011281578,0.00003088453,0.0000031263776,0.000057218727,0.0001255652,0.0016117266,0.0004718349,0.99222916,0.00055335305,0.0047619366],"study_design_scores_gemma":[0.00001677405,0.00001821096,0.00017725996,0.000027866927,0.0000067589594,0.00010436986,0.000077870005,0.00608719,0.0004020374,0.9890442,0.0040187314,0.000018809817],"about_ca_topic_score_codex":0.0013253202,"about_ca_topic_score_gemma":0.0015306175,"teacher_disagreement_score":0.0060587362,"about_ca_system_score_codex":0.0024531947,"about_ca_system_score_gemma":0.00091617095,"threshold_uncertainty_score":0.02026844},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037410907,0.011225735,0.036716953,0.22150286,0.022675732,0.0000609538,0.00095506234,0.00035944587,0.6690924],"genre_scores_gemma":[0.6081818,0.01095467,0.01922548,0.056734115,0.026941264,0.00020406427,0.00077794923,0.00037778923,0.2766029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858046,0.00044839256,0.000081487444,0.00024226896,0.00045451606,0.00019283414],"domain_scores_gemma":[0.9977678,0.0013243926,0.00010463607,0.0001776157,0.00046467147,0.00016086691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021623312,0.0009702626,0.0014201927,0.0026309132,0.00312623,0.0034549187,0.0024439609,0.0032667988,0.016691675],"category_scores_gemma":[0.0041928384,0.00039786324,0.0012844341,0.0018789861,0.0066242074,0.009709036,0.0033245427,0.0065605096,0.0021678177],"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.000014857866,0.000008701465,0.00004300201,0.000037813814,0.0000038902895,0.00007273832,0.0001959454,0.00010778318,0.00009621807,0.98420215,0.013557011,0.0016599289],"study_design_scores_gemma":[0.00001270486,0.0000071032896,0.00019365773,0.000026983129,0.000005964873,0.000096935066,0.00012515509,0.0004228839,0.00013524413,0.94979185,0.04916538,0.00001616577],"about_ca_topic_score_codex":0.007206608,"about_ca_topic_score_gemma":0.0035682027,"teacher_disagreement_score":0.016691675,"about_ca_system_score_codex":0.003188487,"about_ca_system_score_gemma":0.00091310777,"threshold_uncertainty_score":0.05583924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55652994,0.0015350601,0.29695728,0.0023411585,0.0004779861,0.00015029142,0.00041673434,0.000704928,0.14088659],"genre_scores_gemma":[0.91827875,0.00074691663,0.036602486,0.0002928987,0.00030670298,0.00012222068,0.00038774477,0.00020438228,0.043057848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988734,0.00024263373,0.00006957675,0.0002245798,0.00029942102,0.000290371],"domain_scores_gemma":[0.9956785,0.0020761113,0.00051952054,0.00039547845,0.000480076,0.00085031986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014625813,0.0012590074,0.00116167,0.002855081,0.00243632,0.005301284,0.0019360497,0.0020889153,0.01191583],"category_scores_gemma":[0.0081599755,0.0011060502,0.00089481473,0.0013837031,0.0038467678,0.009349886,0.0036897229,0.0036992445,0.0011353202],"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.000039322415,0.000023971768,0.00015853826,0.000024414468,0.000005554392,0.00007037985,0.000120145414,0.00082201994,0.0008095104,0.99523073,0.00045106595,0.0022444234],"study_design_scores_gemma":[0.000032608914,0.000035851408,0.0002112547,0.000024773486,0.000008740686,0.0001689401,0.00020183648,0.00975182,0.0016127996,0.9853157,0.002613038,0.000022735443],"about_ca_topic_score_codex":0.0005741762,"about_ca_topic_score_gemma":0.00048416283,"teacher_disagreement_score":0.01191583,"about_ca_system_score_codex":0.0018968893,"about_ca_system_score_gemma":0.0008130714,"threshold_uncertainty_score":0.039862454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8717348,0.0030867988,0.078485064,0.0038007456,0.00041818287,0.00005158408,0.00034662263,0.00034989102,0.041726384],"genre_scores_gemma":[0.978127,0.0009652034,0.013614673,0.00017548702,0.00065746123,0.000088328394,0.00015343634,0.000101079015,0.0061172554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971002,0.001079015,0.00022243014,0.00061286567,0.0005934611,0.00039208704],"domain_scores_gemma":[0.9702206,0.020966932,0.002838641,0.0014245501,0.0010461088,0.0035030881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006988593,0.0013089841,0.0027729664,0.008558481,0.0046888874,0.0075600166,0.00437713,0.00397718,0.005693161],"category_scores_gemma":[0.030084137,0.0012539488,0.0015879528,0.004622365,0.011517684,0.016350308,0.0050059482,0.003689856,0.00052440364],"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.00025459568,0.00008352804,0.0017352025,0.00011662266,0.000025758238,0.00017990392,0.000609879,0.0029468555,0.0012375687,0.98662937,0.0007121393,0.0054685543],"study_design_scores_gemma":[0.0000275444,0.000036048496,0.00059048424,0.000065814645,0.000033878056,0.00035282428,0.00018273934,0.010926272,0.00087019417,0.98582757,0.0010479721,0.000038662034],"about_ca_topic_score_codex":0.00058462424,"about_ca_topic_score_gemma":0.00046263292,"teacher_disagreement_score":0.008558481,"about_ca_system_score_codex":0.0031663703,"about_ca_system_score_gemma":0.0009731185,"threshold_uncertainty_score":0.036959708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8624905,0.00076791807,0.044789046,0.0018875179,0.00049679255,0.000062606254,0.00022627838,0.00026765108,0.08901173],"genre_scores_gemma":[0.97437626,0.0005234032,0.0060334075,0.0002630103,0.0004987233,0.000034077293,0.00016068759,0.00010094217,0.018009413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997032,0.000075959746,0.000011609444,0.00007623712,0.00006235391,0.00007067604],"domain_scores_gemma":[0.9991898,0.0002534384,0.00021066237,0.00010004272,0.000076562756,0.0001693732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045062733,0.00059018144,0.0007313915,0.0023405734,0.0014809868,0.001925423,0.00062408415,0.0008327628,0.0047040903],"category_scores_gemma":[0.0012965482,0.00036484128,0.0007390027,0.0010816636,0.0033919152,0.0026099142,0.0013100223,0.0020396379,0.00057500566],"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.000045328325,0.000020698248,0.00026735183,0.000014320967,0.0000052124415,0.00009751891,0.0002567635,0.0009818563,0.0011265894,0.99227846,0.00051374326,0.0043922435],"study_design_scores_gemma":[0.000015695796,0.000017735665,0.00038411893,0.0000063491784,0.000004970465,0.00009302853,0.00012004358,0.002143214,0.0005227204,0.9949516,0.0017306845,0.000009796751],"about_ca_topic_score_codex":0.0014005144,"about_ca_topic_score_gemma":0.00091692986,"teacher_disagreement_score":0.0047040903,"about_ca_system_score_codex":0.0011534843,"about_ca_system_score_gemma":0.00046853485,"threshold_uncertainty_score":0.015736759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20752995,0.0005860304,0.7650302,0.00071675755,0.00035062074,0.00013156029,0.00018923086,0.0007159412,0.02474976],"genre_scores_gemma":[0.71896267,0.0011464816,0.26420107,0.0002974429,0.0003577896,0.0000760523,0.00051595265,0.00045560437,0.0139868995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00015190347,0.000025790005,0.00007307506,0.0001663191,0.000105725594],"domain_scores_gemma":[0.9988985,0.00061567023,0.00009636177,0.00020362993,0.00011903619,0.000066720546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094016286,0.00073401164,0.0007834022,0.0013816403,0.0008865601,0.001449551,0.00088912254,0.00067020196,0.0035727965],"category_scores_gemma":[0.003428522,0.0005036545,0.0009351755,0.001775936,0.0019395956,0.0026762825,0.001590673,0.0020582734,0.0013511574],"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.00019455595,0.00010367553,0.0007645579,0.00016687228,0.000019335908,0.00032816027,0.0005037261,0.010350088,0.010569141,0.86116445,0.0032122466,0.11262325],"study_design_scores_gemma":[0.00004183112,0.00008729761,0.0002471785,0.000032400538,0.00002143474,0.00026476008,0.00012146617,0.03256564,0.0095262565,0.9486168,0.008440197,0.000034664703],"about_ca_topic_score_codex":0.0007010174,"about_ca_topic_score_gemma":0.0009818091,"teacher_disagreement_score":0.0035727965,"about_ca_system_score_codex":0.00072118297,"about_ca_system_score_gemma":0.000943822,"threshold_uncertainty_score":0.011952162},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32568315,0.03892175,0.102956474,0.031087166,0.0022062105,0.000044862427,0.00030604927,0.0003643936,0.4984299],"genre_scores_gemma":[0.9460207,0.0070240926,0.004913772,0.0011724569,0.0019557234,0.000017640943,0.00005771117,0.000041500385,0.03879647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960595,0.00013233117,0.000013624391,0.000046586283,0.00012310685,0.00007848712],"domain_scores_gemma":[0.99902666,0.00050992245,0.00013588027,0.00010422586,0.00012275866,0.00010054015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000579051,0.00037185522,0.0004410523,0.0016269338,0.0012418292,0.002118757,0.00086000905,0.00092207955,0.0077444776],"category_scores_gemma":[0.0022185345,0.00023055749,0.00029188386,0.0010385119,0.0036668063,0.005815591,0.0016393587,0.0028263882,0.0010122934],"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.000005802336,0.0000045240554,0.000048956583,0.000019533474,0.0000012684318,0.00003037917,0.00009856546,0.00019042999,0.00016920017,0.9965509,0.0005445891,0.0023357808],"study_design_scores_gemma":[0.000004969294,0.000012594425,0.00013386937,0.000023244336,0.0000024905648,0.0002024533,0.00014453348,0.0014285182,0.0002769775,0.9921544,0.0056079337,0.000007989014],"about_ca_topic_score_codex":0.00078598567,"about_ca_topic_score_gemma":0.0006732781,"teacher_disagreement_score":0.0077444776,"about_ca_system_score_codex":0.0011670992,"about_ca_system_score_gemma":0.0006581233,"threshold_uncertainty_score":0.025907874},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49875492,0.013989527,0.1880083,0.010542692,0.0034019458,0.00008025415,0.0005474087,0.00023082607,0.28444412],"genre_scores_gemma":[0.95254946,0.005035181,0.011849977,0.00050693733,0.0022455265,0.000039165046,0.00016343768,0.000072093346,0.027538283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940014,0.00022802217,0.000016775557,0.000084531624,0.00012619281,0.00014428738],"domain_scores_gemma":[0.9976889,0.001382443,0.0002976938,0.00010977098,0.00028034745,0.00024092419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013623772,0.0009812625,0.000842997,0.0038304962,0.0016890086,0.0024223146,0.000976643,0.0009917255,0.0075822417],"category_scores_gemma":[0.0056550857,0.00039993587,0.00066803704,0.0030280622,0.005245299,0.0046529234,0.0018198643,0.00250423,0.0008943778],"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.00004039899,0.000009358028,0.000104728955,0.000025620113,0.000003127345,0.00003236086,0.0001651694,0.00092323,0.00027801897,0.991678,0.0010677257,0.005672252],"study_design_scores_gemma":[0.000008098922,0.000013522677,0.0001526928,0.000014279621,0.000003672283,0.000046493806,0.00006759888,0.0027985403,0.00014494611,0.99425936,0.0024808666,0.000009971072],"about_ca_topic_score_codex":0.0017447036,"about_ca_topic_score_gemma":0.0014269754,"teacher_disagreement_score":0.0075822417,"about_ca_system_score_codex":0.0016282505,"about_ca_system_score_gemma":0.0009874227,"threshold_uncertainty_score":0.025365114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91930985,0.00013940355,0.06818043,0.0003390299,0.000015601569,0.000027199038,0.00017430531,0.00008825532,0.0117259165],"genre_scores_gemma":[0.985886,0.000104355364,0.011020673,0.0000461693,0.00004097104,0.000039065693,0.00019606699,0.000026778142,0.0026398913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961495,0.000095377814,0.000018045419,0.00011363516,0.00007476994,0.00008333174],"domain_scores_gemma":[0.9980527,0.0009799089,0.00030636,0.00025631365,0.0001506425,0.0002541432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049788336,0.0002071439,0.0003746647,0.0012720744,0.0014081253,0.0010441343,0.0003979736,0.0003609393,0.0036564819],"category_scores_gemma":[0.001984789,0.0003140473,0.0005892829,0.0008232618,0.0025053727,0.003187299,0.0014151044,0.0009220835,0.00019637166],"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.00010562542,0.000032988497,0.003304464,0.000071521965,0.000016519049,0.00022076227,0.0009529935,0.0051693493,0.008373444,0.9721452,0.0005680195,0.009039026],"study_design_scores_gemma":[0.000024507211,0.000055284763,0.0040977737,0.00001650318,0.000012900151,0.0003958539,0.0005026712,0.023213832,0.0047266674,0.9635742,0.0033565117,0.000023357685],"about_ca_topic_score_codex":0.00067490054,"about_ca_topic_score_gemma":0.0008313242,"teacher_disagreement_score":0.0036564819,"about_ca_system_score_codex":0.0005460818,"about_ca_system_score_gemma":0.00029433405,"threshold_uncertainty_score":0.012232125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5781699,0.008716805,0.18646061,0.0066942475,0.001740438,0.00012886872,0.00047353545,0.00049699406,0.21711859],"genre_scores_gemma":[0.9513845,0.0025796879,0.010159303,0.00032064022,0.0015119108,0.000090743546,0.00017989479,0.00008399733,0.033689316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990195,0.00034902935,0.000049013586,0.000119699755,0.000296788,0.00016591634],"domain_scores_gemma":[0.9956726,0.0027116297,0.0005249765,0.00020689427,0.00043029783,0.00045368721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020483648,0.00087694253,0.0013571022,0.00521093,0.0026063912,0.00474713,0.0008917778,0.0012751137,0.008789795],"category_scores_gemma":[0.0071766814,0.0007963041,0.0006049979,0.0037194178,0.00506227,0.007022225,0.002090353,0.002415297,0.0009940781],"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.000020573287,0.000011417795,0.00006989013,0.00001379323,0.0000022236532,0.00003552397,0.00010935341,0.00033150194,0.00019910205,0.9966633,0.000520863,0.0020224673],"study_design_scores_gemma":[0.00001618684,0.000010346781,0.00007710337,0.0000149870075,0.000004145074,0.00006235427,0.000040572497,0.0029208495,0.00017746724,0.9952421,0.0014246119,0.000009174051],"about_ca_topic_score_codex":0.00075186364,"about_ca_topic_score_gemma":0.00069673144,"teacher_disagreement_score":0.008789795,"about_ca_system_score_codex":0.0019563409,"about_ca_system_score_gemma":0.00080927415,"threshold_uncertainty_score":0.029404819},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41027254,0.0038188607,0.3997052,0.004979848,0.0012422685,0.00025675553,0.0052181687,0.0013538798,0.17315246],"genre_scores_gemma":[0.88732874,0.0017946108,0.04888173,0.0008895819,0.000713266,0.00019354126,0.0017029609,0.00030667696,0.058188934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987733,0.00029906482,0.00009729958,0.00025868925,0.00031425347,0.00025752568],"domain_scores_gemma":[0.99540675,0.0019247085,0.00074499164,0.0007964456,0.0007758902,0.00035121513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010824389,0.00040342848,0.00035198597,0.0010863169,0.00078952545,0.0020196731,0.0004210917,0.00060783484,0.0117956605],"category_scores_gemma":[0.0051660617,0.00027712746,0.00044326074,0.0016064184,0.0016739315,0.0024357766,0.0011727571,0.0010959838,0.0022335683],"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.00024402534,0.000035756268,0.0006059197,0.00008724974,0.0000105081945,0.00017473218,0.00018952534,0.004865151,0.0027451338,0.95496225,0.0072392127,0.028840493],"study_design_scores_gemma":[0.00005299628,0.00011580918,0.0011926274,0.00008733935,0.000016985377,0.0005243286,0.00011484867,0.028221408,0.0053855274,0.9323537,0.031869207,0.0000652129],"about_ca_topic_score_codex":0.001893042,"about_ca_topic_score_gemma":0.0017680294,"teacher_disagreement_score":0.0117956605,"about_ca_system_score_codex":0.0012961926,"about_ca_system_score_gemma":0.0016686312,"threshold_uncertainty_score":0.03946042},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91692185,0.0005730734,0.076559745,0.0008359956,0.000044938955,0.00005144406,0.00025180826,0.00021889545,0.0045423005],"genre_scores_gemma":[0.9940441,0.00031020222,0.0036615685,0.000056755493,0.00012035999,0.000066414985,0.00020865534,0.000042760472,0.001489151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990212,0.00030826466,0.00004198747,0.00021055533,0.00021661699,0.00020135025],"domain_scores_gemma":[0.9746192,0.018171279,0.0028235808,0.0015818399,0.0013699634,0.0014341862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040802862,0.00060817244,0.0010349178,0.0026952957,0.0008696421,0.00165067,0.0017484564,0.0009607601,0.0030215282],"category_scores_gemma":[0.025460735,0.0005373273,0.00064727454,0.00093777373,0.004201713,0.0044994135,0.0018036943,0.0020734398,0.00026681932],"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.0006189123,0.00022354408,0.02210667,0.0002216689,0.000092173424,0.00058389775,0.00079861673,0.06844517,0.01423036,0.87654585,0.0021804627,0.013952692],"study_design_scores_gemma":[0.0001297284,0.00025705594,0.012862356,0.00011440578,0.00005458814,0.00069501717,0.000521111,0.64788944,0.006527317,0.32920146,0.0016126833,0.00013482751],"about_ca_topic_score_codex":0.001056934,"about_ca_topic_score_gemma":0.0006780877,"teacher_disagreement_score":0.0040802862,"about_ca_system_score_codex":0.0021713679,"about_ca_system_score_gemma":0.0006985036,"threshold_uncertainty_score":0.021578848},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7511412,0.0077426643,0.07673349,0.019995773,0.00078745146,0.00008982208,0.0013726327,0.00023138162,0.14190559],"genre_scores_gemma":[0.97515875,0.0025519412,0.006983122,0.00030854729,0.0012641057,0.00008225986,0.0005064161,0.00006359684,0.013081397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973363,0.00066459505,0.00013903061,0.00039652208,0.0010966681,0.0003669437],"domain_scores_gemma":[0.9854687,0.010777697,0.0011412207,0.0010188818,0.0007565666,0.00083700457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002583003,0.0010174933,0.0016937476,0.0037515818,0.0018783575,0.0076823714,0.0025914698,0.0018407012,0.009238462],"category_scores_gemma":[0.01540251,0.0009488468,0.0007464653,0.004194469,0.0066008656,0.018806309,0.0037327255,0.0051822537,0.0010135556],"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.0001454238,0.000067599656,0.0011804267,0.00007711631,0.000014621876,0.00009106926,0.00036289738,0.0054217265,0.0004886584,0.98104376,0.0022417079,0.008864951],"study_design_scores_gemma":[0.000021246116,0.00001352794,0.00037003722,0.00002007906,0.0000075515377,0.00007502328,0.00006502216,0.011311153,0.00026743422,0.9864184,0.0014136946,0.000016778507],"about_ca_topic_score_codex":0.0011204397,"about_ca_topic_score_gemma":0.00096605084,"teacher_disagreement_score":0.009238462,"about_ca_system_score_codex":0.003461579,"about_ca_system_score_gemma":0.0015540776,"threshold_uncertainty_score":0.030905724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57463217,0.010182824,0.11097145,0.0047843964,0.0013597183,0.00008969554,0.00064554624,0.00078025105,0.296554],"genre_scores_gemma":[0.9522679,0.002169227,0.013435239,0.00038631927,0.0011242923,0.00006394997,0.0003140226,0.00010738753,0.030131737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989316,0.00033938914,0.000057888472,0.00017332763,0.00027332158,0.00022452754],"domain_scores_gemma":[0.9971493,0.0015110524,0.00036068208,0.00023574769,0.00023762092,0.0005056931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257175,0.0014340866,0.0020576164,0.006877785,0.0036535924,0.0046497686,0.002018747,0.0018337187,0.009890612],"category_scores_gemma":[0.005145329,0.001061044,0.0013094759,0.0033157824,0.0062579233,0.008163006,0.0033107842,0.0039118608,0.0010574502],"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.000030485773,0.000017137181,0.00015643252,0.00003383032,0.000007676539,0.00008157918,0.00023254644,0.00066729647,0.00029839543,0.9958262,0.00065503875,0.001993442],"study_design_scores_gemma":[0.000017960856,0.000010844563,0.00021847169,0.000020249261,0.000008177213,0.000078788544,0.00006385951,0.002070734,0.00016181445,0.9959474,0.0013866123,0.000015058252],"about_ca_topic_score_codex":0.0019662853,"about_ca_topic_score_gemma":0.002416628,"teacher_disagreement_score":0.009890612,"about_ca_system_score_codex":0.0030573457,"about_ca_system_score_gemma":0.00070077856,"threshold_uncertainty_score":0.033087432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41604933,0.009853283,0.29129353,0.007414175,0.0012378661,0.00010789026,0.0011164269,0.001194998,0.27173242],"genre_scores_gemma":[0.91509855,0.0034165948,0.042521376,0.00086634775,0.001229254,0.00012464426,0.0005358408,0.0002651579,0.035942227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803203,0.0006891084,0.00015681582,0.0004247898,0.0004659391,0.00023130742],"domain_scores_gemma":[0.9930227,0.004064506,0.000760151,0.0006521792,0.0006642863,0.0008362211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027555788,0.0010350868,0.0017683088,0.008315299,0.0040281652,0.0070108594,0.0028960167,0.0026269073,0.008826306],"category_scores_gemma":[0.008195848,0.0014186146,0.0013499825,0.0059733074,0.008279237,0.016501704,0.0054381327,0.005734712,0.0012398857],"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.000008383926,0.000007983178,0.000060976192,0.000021525188,0.0000020643624,0.000024747662,0.00015427351,0.00019718961,0.00008840303,0.99805224,0.00023107837,0.0011511691],"study_design_scores_gemma":[0.0000053977146,0.000003853032,0.00005352654,0.000018349578,0.0000036953281,0.000052225645,0.00007721189,0.0010005287,0.00009740718,0.99750537,0.0011743506,0.000008113027],"about_ca_topic_score_codex":0.0017150227,"about_ca_topic_score_gemma":0.0014571595,"teacher_disagreement_score":0.008826306,"about_ca_system_score_codex":0.0034361912,"about_ca_system_score_gemma":0.00080738706,"threshold_uncertainty_score":0.029526949},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66639596,0.008211604,0.25498217,0.0018587789,0.00041858014,0.00006975275,0.0005123721,0.0006138324,0.066936925],"genre_scores_gemma":[0.97967726,0.0013320209,0.013913248,0.0001355687,0.00037285106,0.00005834452,0.00014056772,0.00008824315,0.0042817495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989378,0.00036232037,0.000048787977,0.00018040511,0.00031085566,0.00015981743],"domain_scores_gemma":[0.9949704,0.0028507488,0.0007319304,0.00060401333,0.00043763247,0.00040529406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010761623,0.0008811258,0.0011258064,0.0027094807,0.00090100017,0.0022374229,0.0011571082,0.0014888183,0.0022934342],"category_scores_gemma":[0.008190016,0.00042761554,0.00048945594,0.0013387079,0.0030396422,0.002672762,0.0018935095,0.0014358746,0.0005180916],"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.00021199018,0.000025498144,0.00077280734,0.00015238108,0.000030598127,0.0001402909,0.0003128202,0.03932999,0.006486107,0.93478864,0.001951637,0.015797213],"study_design_scores_gemma":[0.000034127315,0.00008137382,0.0014932841,0.000098014134,0.000025000507,0.0005683862,0.00013930725,0.19559039,0.006555098,0.7899173,0.0054047364,0.00009303114],"about_ca_topic_score_codex":0.00059931446,"about_ca_topic_score_gemma":0.00029388652,"teacher_disagreement_score":0.0027094807,"about_ca_system_score_codex":0.0013921374,"about_ca_system_score_gemma":0.0007301791,"threshold_uncertainty_score":0.010100722},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36558658,0.002537477,0.5343105,0.002952989,0.0012103559,0.00013902773,0.00070492696,0.00089355995,0.09166471],"genre_scores_gemma":[0.8789129,0.0016546592,0.07375605,0.0011977238,0.0011515926,0.00022044023,0.0005525233,0.00056013407,0.041993994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912304,0.00024814683,0.000047295744,0.00013806671,0.00028309677,0.00016035474],"domain_scores_gemma":[0.9979602,0.0009276479,0.00028495194,0.0003421966,0.00025878448,0.00022624621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086618855,0.0013103412,0.0008614246,0.0023162058,0.0011463097,0.002447684,0.0011858535,0.0020324162,0.005154021],"category_scores_gemma":[0.0053444165,0.00074595754,0.0007281448,0.0017786067,0.0026008575,0.003558344,0.00289921,0.003622181,0.002003868],"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.00007134057,0.000029591918,0.00016149961,0.000046606237,0.000007725906,0.00006487962,0.000121820296,0.002287791,0.00271899,0.980978,0.0011370126,0.012374649],"study_design_scores_gemma":[0.000013118359,0.000019803429,0.000099752826,0.000032099473,0.000006911782,0.00013780457,0.000024847594,0.010781318,0.0015533961,0.9848845,0.0024195686,0.000026801295],"about_ca_topic_score_codex":0.00042914524,"about_ca_topic_score_gemma":0.00047232985,"teacher_disagreement_score":0.005154021,"about_ca_system_score_codex":0.0010095811,"about_ca_system_score_gemma":0.00080797274,"threshold_uncertainty_score":0.017241895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3802149,0.0005760736,0.5449386,0.0011052468,0.00035478515,0.00011739383,0.00023395118,0.00092040416,0.071538694],"genre_scores_gemma":[0.8918521,0.00029564582,0.082699284,0.000391399,0.00016031013,0.00013832623,0.00020711315,0.00020970847,0.024046179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995098,0.0001471109,0.000028597131,0.00009431992,0.00009514621,0.0001249884],"domain_scores_gemma":[0.99931943,0.00026874788,0.00007051973,0.00011326028,0.000082778635,0.00014527714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079978403,0.00069902197,0.0006731767,0.0012037245,0.0013021884,0.0013653412,0.0008232602,0.00081697555,0.0031438563],"category_scores_gemma":[0.001596014,0.00038777784,0.000693981,0.0008431985,0.002074147,0.0019860477,0.0029507831,0.0013744981,0.00081848365],"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.000111775604,0.00003550086,0.0003684113,0.00004685041,0.0000070266,0.00013637531,0.00017722217,0.0015476423,0.008031012,0.9731724,0.0010453156,0.015320388],"study_design_scores_gemma":[0.00006964912,0.0001502991,0.0006360361,0.000047620437,0.000025531592,0.00052251364,0.00012494266,0.018635143,0.025684977,0.93918204,0.014862057,0.00005922611],"about_ca_topic_score_codex":0.00027580268,"about_ca_topic_score_gemma":0.00024599562,"teacher_disagreement_score":0.0031438563,"about_ca_system_score_codex":0.0012546871,"about_ca_system_score_gemma":0.00064829696,"threshold_uncertainty_score":0.01051724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1811254,0.0006896903,0.8008304,0.0003995549,0.000064573396,0.00009272905,0.0001423629,0.00028307652,0.016372256],"genre_scores_gemma":[0.76627207,0.0010701442,0.22677219,0.00017064094,0.00019549942,0.00009276755,0.00028780696,0.000103260376,0.0050357156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988079,0.00033052743,0.00007848491,0.00018974964,0.00043365007,0.00015971636],"domain_scores_gemma":[0.98900944,0.007514459,0.0011336415,0.0011239797,0.0009536518,0.0002648256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012796262,0.0005818351,0.00049074437,0.0015755525,0.0009178349,0.001448378,0.0007048421,0.00068612664,0.003095131],"category_scores_gemma":[0.0105256345,0.00032792395,0.0004770701,0.0013188036,0.0026432173,0.003933959,0.001165072,0.0010259574,0.0006808086],"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.00018263873,0.00010614332,0.003177926,0.00020461885,0.000018853632,0.00034787523,0.0004841686,0.034805037,0.012739993,0.86356986,0.0015753823,0.0827875],"study_design_scores_gemma":[0.00002308001,0.00015073398,0.0011521284,0.0000698585,0.000011077533,0.00063760084,0.00021184025,0.2430805,0.011899565,0.7372037,0.005518257,0.000041668096],"about_ca_topic_score_codex":0.0009853138,"about_ca_topic_score_gemma":0.0011204494,"teacher_disagreement_score":0.003095131,"about_ca_system_score_codex":0.0007596901,"about_ca_system_score_gemma":0.00084223895,"threshold_uncertainty_score":0.010354221},"labels":[],"label_agreement":null}]}