{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1096,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1096,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"038a4c4cc89e","filters":{"topic":"Coding theory and cryptography"}},"results":[{"id":"W2163934701","doi":"10.1109/tit.2006.876253","title":"Algebraic immunity for cryptographically significant Boolean functions: analysis and construction","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":241,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Boolean function; Mathematics; Hamming weight; Cryptography; Algebraic function; Discrete mathematics; Boolean expression; Algebraic number; Hamming distance; Symmetric function; Addition theorem; Degree (music); Function (biology); Hamming code; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.004967897182034475,"gpt":0.1939445870323249,"spread":0.1889766898502905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007676086,0.0001720107,0.0001820743,0.001201393,0.0007001135,0.0002613934,0.0002593946,0.00009988058,0.00005398518],"category_scores_gemma":[0.000009680372,0.0001673945,0.0002940113,0.001605251,0.0001983762,0.001533445,0.000002870749,0.00019175,0.00001945561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002521688,"about_ca_system_score_gemma":0.00003130271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002936552,"about_ca_topic_score_gemma":0.00001586834,"domain_scores_codex":[0.9988389,0.0001402398,0.0004289489,0.0001939056,0.000187035,0.0002109669],"domain_scores_gemma":[0.9987926,0.0003827367,0.0001630264,0.0004300367,0.0001597656,0.00007184712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001882218,0.0001100713,0.00009123178,0.00002689297,0.0003319637,1.571312e-7,0.000396388,0.005791818,0.0002175743,0.8187492,0.00006567793,0.1740308],"study_design_scores_gemma":[0.002054972,0.0006791161,0.005125591,0.00003840227,0.0009675718,0.00003534003,0.001279067,0.04687446,0.009373914,0.9276987,0.004947906,0.0009249421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02354588,0.00001328922,0.974413,0.000142638,0.0003429413,0.0002911651,0.0000617412,0.0002811594,0.0009081253],"genre_scores_gemma":[0.9736856,0.00001635716,0.02582008,0.0002495967,0.00001811224,0.0001294622,0.00002912937,0.000005932793,0.00004578172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9501397,"threshold_uncertainty_score":0.6826151,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of British Columbia; University of Lethbridge","funders":"","keywords":"Permutation (music); Mathematics; Combinatorics; Finite field; Set (abstract data type); Cyclic permutation; Permutation graph; Partial permutation; Discrete mathematics; Algebra over a field; Pure mathematics; Symmetric group; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.009601733691645173,"gpt":0.2273680458957087,"spread":0.2177663122040636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000125466,0.00008714108,0.0000993393,0.00009886639,0.0001922311,0.00004831787,0.0003073532,0.00009109172,0.00005472808],"category_scores_gemma":[0.00005409407,0.00007392836,0.000059624,0.0002851252,0.0000904302,0.00008217707,0.00007580768,0.0002525803,0.000008626822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001080829,"about_ca_system_score_gemma":0.00001903367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005884938,"about_ca_topic_score_gemma":0.0000155023,"domain_scores_codex":[0.999465,0.00001868634,0.0001550908,0.0001963857,0.00005468121,0.0001100804],"domain_scores_gemma":[0.9983398,0.001045354,0.0000732276,0.000435549,0.00005430419,0.00005176253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001923079,0.00003187843,0.0001765417,0.000006939439,0.000008925997,1.514912e-7,0.0007394163,0.00003551716,0.0004439366,0.9582627,0.00003754417,0.04025456],"study_design_scores_gemma":[0.00024783,0.0001314293,0.0006528342,0.00002193579,0.000009411666,0.00001064473,0.0002566689,0.00949751,0.003452882,0.9741365,0.01136931,0.0002130565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06115939,0.00002215776,0.9239047,0.0007184453,0.000105527,0.000141817,0.00002286216,0.00007003347,0.01385503],"genre_scores_gemma":[0.9921511,0.000009421061,0.007386195,0.0002915465,0.00004346643,0.0000665179,0.000005679522,0.000003869592,0.00004224169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9309916,"threshold_uncertainty_score":0.3014711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W639887749","doi":"10.1201/b15006","title":"Handbook of Finite Fields","year":2013,"lang":"ru","type":"book","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Computer science; Compiler; Coding theory; Field (mathematics); Cryptography; Theoretical computer science; Coding (social sciences); Algebra over a field; Mathematics; Pure mathematics; Algorithm; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01708159709300733,"gpt":0.2141971633870265,"spread":0.1971155662940192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003825252,0.0004289156,0.000620578,0.0003621998,0.0001354636,0.0001731602,0.001924945,0.0005394531,0.006394196],"category_scores_gemma":[0.0000479329,0.0003822386,0.0005556946,0.0002899883,0.00032193,0.0002879896,0.000686598,0.0005133942,0.001192468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002061504,"about_ca_system_score_gemma":0.0002821328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004156422,"about_ca_topic_score_gemma":0.000009054381,"domain_scores_codex":[0.9977672,0.0001256819,0.0006253272,0.0006421484,0.0004177736,0.0004219317],"domain_scores_gemma":[0.9969701,0.0008401783,0.0003710919,0.001418519,0.0002310715,0.0001690087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001257914,0.00009408887,0.00004688996,0.0002253124,0.0001564393,0.00001075783,0.0007507061,0.000032152,0.0000552016,0.8469692,0.06977401,0.08187259],"study_design_scores_gemma":[0.0007534305,0.001190509,0.00009735955,0.002866025,0.0001439786,0.00001103999,0.00003059068,0.009725525,0.003168979,0.5877333,0.392892,0.001387242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00005369406,0.001591793,0.4543028,0.0001480764,0.0008977054,0.0002608279,0.000008502481,0.00009860898,0.542638],"genre_scores_gemma":[0.01711686,0.0008188655,0.01841252,0.001203256,0.0003384821,0.00003065143,0.00001608892,0.00003943295,0.9620239],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4358903,"threshold_uncertainty_score":0.999863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143019587","doi":"10.1109/tit.2002.804044","title":"New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Mathematics; Linear span; Sequence (biology); Quadratic equation; Binary number; Span (engineering); Discrete mathematics; Algorithm; Combinatorics; Statistics; Arithmetic; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01601449989209099,"gpt":0.2309714948572693,"spread":0.2149569949651783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004686448,0.0001627303,0.0001212605,0.000192352,0.0005884257,0.0002306331,0.000204114,0.00007913032,0.0001618749],"category_scores_gemma":[0.0000069144,0.0001200436,0.00006601343,0.0003412107,0.00006571579,0.002198623,0.000002622736,0.0001651198,0.00006784292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002207866,"about_ca_system_score_gemma":0.00003602511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004780562,"about_ca_topic_score_gemma":0.000006051209,"domain_scores_codex":[0.9990833,0.00007555229,0.0002662322,0.0001728651,0.0001663548,0.0002357106],"domain_scores_gemma":[0.9991089,0.0002418316,0.0001105184,0.000282904,0.0001325709,0.0001233038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001056469,0.0003837942,0.0001342684,0.0002275597,0.0001702668,0.00003964452,0.0212545,0.0934521,0.00005631757,0.165069,0.00168405,0.7164721],"study_design_scores_gemma":[0.003116395,0.0007121832,0.0000521113,0.00009827826,0.0000425914,0.0009337861,0.0002506266,0.9724854,0.003057715,0.0116312,0.007108006,0.0005116719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00297751,0.00001894966,0.9953304,0.0001349048,0.0002148284,0.0004350283,0.00004274738,0.0002058466,0.0006398049],"genre_scores_gemma":[0.974528,0.00001083852,0.02422634,0.0004908282,0.0000269938,0.00006732277,0.000004142249,0.000009709253,0.0006358662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9715505,"threshold_uncertainty_score":0.4895237,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006138621","doi":"10.1090/s0025-5718-03-01576-x","title":"A complete description of Golay pairs for lengths up to 100","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Mathematics; Combinatorics; Autocorrelation; Binary number; Complementary sequences; Algorithm; Discrete mathematics; Arithmetic; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05357796670888526,"gpt":0.2778968689995173,"spread":0.224318902290632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204232,0.00008840716,0.0002004402,0.0001786444,0.00005012663,0.00003124003,0.0002526185,0.00003015222,0.000003820483],"category_scores_gemma":[0.0001427223,0.00008816369,0.0001010953,0.0003593993,0.0000271364,0.0001514043,0.00003337569,0.0000297112,0.000004883342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001168491,"about_ca_system_score_gemma":0.00002217704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000146293,"about_ca_topic_score_gemma":0.000001082164,"domain_scores_codex":[0.9991488,0.00005599446,0.0003527751,0.0001450076,0.0001787272,0.0001186651],"domain_scores_gemma":[0.9989686,0.0003493619,0.0002076883,0.0002293934,0.000205841,0.00003910577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001128106,0.0001211528,0.00003038171,0.0002745334,0.00002282742,1.237682e-7,0.005407071,0.002919137,0.008733336,0.9760274,0.0003715287,0.00608119],"study_design_scores_gemma":[0.0004954455,0.0003904218,0.000174277,0.0001292108,0.00002010603,0.00000451816,0.0003538713,0.1821255,0.01072054,0.804759,0.0006668249,0.0001602834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1110366,0.00001494649,0.8877012,0.00005810941,0.0001682891,0.0003010952,0.000004778934,0.0000428225,0.0006722108],"genre_scores_gemma":[0.6340188,4.748631e-7,0.3659202,0.00002144938,0.000005340273,0.00001118773,0.000001940088,0.000004814844,0.0000157187],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5229822,"threshold_uncertainty_score":0.3595211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1498077172","doi":"10.1007/3-540-39799-x_34","title":"How to Construct Pseudo-random Permutations from Pseudo-random Functions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Random permutation; Pseudorandom number generator; Permutation (music); Mathematics; Combinatorics; Pseudorandom permutation; Generator (circuit theory); Random function; Pseudorandom function family; Discrete mathematics; Invertible matrix; Pseudorandom generator; Algorithm; Random variable; Symmetric group; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01815468264445348,"gpt":0.2413536901895009,"spread":0.2231990075450475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001201069,0.0007762549,0.0008099395,0.001906545,0.0008097497,0.001710161,0.003691653,0.0004156498,0.00008739058],"category_scores_gemma":[0.0002607589,0.0007296028,0.0004055421,0.001724641,0.001115131,0.0008735447,0.001132198,0.001071295,0.0001200368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002117223,"about_ca_system_score_gemma":0.0004866998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004689375,"about_ca_topic_score_gemma":0.0002438742,"domain_scores_codex":[0.994927,0.00009078581,0.00064241,0.002179607,0.001208647,0.0009515152],"domain_scores_gemma":[0.9947552,0.002041092,0.0003092961,0.001994571,0.0004236872,0.0004761313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000110499,0.00006349758,0.0001255848,0.00002149751,0.00008114832,0.0001561387,0.002007564,0.008791103,0.0008094089,0.1178081,0.0001951893,0.8698303],"study_design_scores_gemma":[0.002967668,0.0005919246,0.0003209919,0.0006679228,0.00009276097,0.0002571786,0.000005433823,0.1312909,0.001413691,0.8475443,0.01255858,0.002288707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008686795,0.0002850381,0.9869064,0.00201322,0.003974684,0.0007060735,0.00006104892,0.000393986,0.004790855],"genre_scores_gemma":[0.2794839,0.00003294172,0.7147017,0.003348728,0.001417243,0.00004319678,0.00003338061,0.0000733915,0.0008654531],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8675416,"threshold_uncertainty_score":0.9995155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150782829","doi":"10.1109/tc.2007.19","title":"A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational complexity theory; Polynomial basis; Multiplier (economics); Mathematics; Discrete mathematics; Matrix multiplication; Toeplitz matrix; Polynomial; Time complexity; Computer science; Algorithm; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04373998678267655,"gpt":0.2750253196515641,"spread":0.2312853328688875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612218,0.0002508438,0.0002463534,0.0003948949,0.0003781806,0.0001338026,0.0008747869,0.0001043011,0.00001064763],"category_scores_gemma":[0.000003807218,0.0002587196,0.0002815729,0.0007663849,0.0000621244,0.0002320857,0.000008217944,0.0002363804,0.00003350631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005811463,"about_ca_system_score_gemma":0.00005952968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003738487,"about_ca_topic_score_gemma":0.00003495178,"domain_scores_codex":[0.9983097,0.00006125647,0.0002788559,0.0006175807,0.0002391118,0.0004935325],"domain_scores_gemma":[0.9983891,0.0004439926,0.00005933218,0.0006852931,0.00005230432,0.0003700406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001102617,0.001559082,0.000009620414,0.00009952225,0.0002808274,0.00002191486,0.007334784,0.3392284,0.0009034115,0.1794799,0.01361182,0.4563682],"study_design_scores_gemma":[0.004579772,0.001998162,0.000897723,0.0001354938,0.0000858431,0.00007113809,0.0003861075,0.9436241,0.006543038,0.03409523,0.00597942,0.001603977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002146294,0.000009058229,0.9936925,0.0009750921,0.001372261,0.0006646953,0.000005223062,0.0003835887,0.0007512775],"genre_scores_gemma":[0.4715307,0.000001343925,0.5274986,0.0007259171,0.00005119765,0.0000269349,0.000001243624,0.00001134067,0.000152723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6043957,"threshold_uncertainty_score":0.9999865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087377210","doi":"10.1007/s00145-001-0018-3","title":"New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups","year":2002,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"ElGamal encryption; Discrete logarithm; Cryptosystem; Signature (topology); Key (lock); ElGamal signature scheme; Mathematics; Public-key cryptography; Permutation (music); Hybrid cryptosystem; Theoretical computer science; Computer science; Cryptography; Discrete mathematics; Blind signature; Algorithm; Encryption; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.1943988686853836,"gpt":0.2422027029784385,"spread":0.04780383429305485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001057911,0.0001597554,0.0003925127,0.001039327,0.0001456168,0.0001895511,0.0005291823,0.0001187269,0.00004602692],"category_scores_gemma":[0.0001177214,0.000150166,0.0001160957,0.001022041,0.00005714658,0.0007394789,0.0001078924,0.0003496525,0.000008599663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004371021,"about_ca_system_score_gemma":0.00005420975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000723654,"about_ca_topic_score_gemma":0.00002104334,"domain_scores_codex":[0.998178,0.0004132728,0.0005704411,0.0002525414,0.0002141446,0.0003715966],"domain_scores_gemma":[0.9987593,0.0003677339,0.0002900694,0.0002401856,0.00005540739,0.0002873459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007810743,0.0003303443,0.01753385,0.00004741387,0.0001773792,0.0001344343,0.008478371,0.003679262,0.004109793,0.8534512,0.0006254505,0.1113544],"study_design_scores_gemma":[0.01099159,0.006619954,0.03250249,0.001172758,0.0003354555,0.009932534,0.003970498,0.209112,0.002819358,0.6914378,0.02805862,0.003046979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2322035,0.0006432043,0.7637312,0.002271439,0.0003911718,0.00007975804,3.014214e-7,0.00002266668,0.0006568153],"genre_scores_gemma":[0.872207,0.00001986932,0.1274408,0.0001436968,0.0001629155,0.000002213099,1.057916e-7,0.000009285796,0.000014093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6400036,"threshold_uncertainty_score":0.612359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170368342","doi":"10.1006/jsco.1999.1002","title":"Factoring Polynomials Over Finite Fields: A Survey","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Factoring; Mathematics; Univariate; Finite field; Factorization; Factorization of polynomials; Algebra over a field; Pure mathematics; Discrete mathematics; Algorithm; Polynomial; Multivariate statistics; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03254854062645635,"gpt":0.284985279481469,"spread":0.2524367388550126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974298,0.00009285214,0.0001905087,0.0002775706,0.00007945159,0.0001505182,0.0003851005,0.00004684941,0.00002056294],"category_scores_gemma":[0.000127645,0.00008313749,0.0001229046,0.0004895453,0.00001576228,0.0005172591,0.0000625046,0.0001605129,0.000007454195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002546428,"about_ca_system_score_gemma":0.00005128413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002996033,"about_ca_topic_score_gemma":0.000007249462,"domain_scores_codex":[0.9989381,0.0001616574,0.0003847209,0.000114188,0.0002499986,0.0001512864],"domain_scores_gemma":[0.9987169,0.0005627297,0.0003309278,0.0001346816,0.0001716444,0.00008313393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0004204933,0.0005643861,0.2203335,0.00004677978,0.0003819453,0.0002740958,0.01591017,0.05252951,0.002320527,0.02473681,0.003963084,0.6785187],"study_design_scores_gemma":[0.001299261,0.0004884074,0.9129025,0.0001278855,0.00002256283,0.0002668805,0.0000664273,0.04372567,0.0004257425,0.03650248,0.00382093,0.0003512395],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4784621,0.00007592254,0.5205238,0.0001658818,0.0004929788,0.00002577078,5.04096e-7,0.00001924399,0.0002337765],"genre_scores_gemma":[0.9965791,0.00003469626,0.002946603,0.0001978078,0.0002137155,4.437835e-7,7.747017e-7,0.000004822174,0.00002208618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.692569,"threshold_uncertainty_score":0.3390248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087541534","doi":"10.1109/tit.2009.2013041","title":"Quaternary Constant-Amplitude Codes for Multicode CDMA","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code (set theory); Constant (computer programming); Binary number; Computer science; Algorithm; Discrete mathematics; Mathematics; Programming language; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01369890084982494,"gpt":0.2487448365982638,"spread":0.2350459357484389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006048746,0.0001588883,0.0001430517,0.0003056122,0.0003649613,0.0001996377,0.000474094,0.00007543617,0.00003948739],"category_scores_gemma":[0.00001104923,0.0001492331,0.0001748409,0.0002608846,0.00006702754,0.001758968,0.000001414419,0.0001402443,0.0001076876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000332985,"about_ca_system_score_gemma":0.00003690916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001700123,"about_ca_topic_score_gemma":8.550812e-7,"domain_scores_codex":[0.9989877,0.00008419213,0.0003496854,0.0001536929,0.0001815477,0.0002431567],"domain_scores_gemma":[0.9989093,0.0003714731,0.0001101412,0.0004215317,0.000102134,0.0000854521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002178368,0.0001061524,0.000001289993,0.00001535253,0.00002989086,5.039494e-7,0.001892182,0.003314307,0.0003401811,0.7058604,0.0001258913,0.288096],"study_design_scores_gemma":[0.002799605,0.001137888,0.0001386622,0.0001153542,0.00005844258,0.00004958999,0.0006880308,0.09954635,0.04869838,0.8349978,0.01094756,0.0008223322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002919569,0.00001273235,0.9922264,0.000399462,0.0005366539,0.0003321657,0.00004639212,0.0004138499,0.00311276],"genre_scores_gemma":[0.9807277,0.00001345448,0.017183,0.001906402,0.00001926797,0.00005902778,0.00000512701,0.000004584488,0.00008140289],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778082,"threshold_uncertainty_score":0.608555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1528709073","doi":"10.1007/3-540-46416-6_30","title":"An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"S-box; Cryptosystem; Set (abstract data type); Differential (mechanical device); Computer science; Computer security; Relation (database); Theoretical computer science; Information security; Cryptography; Data mining; Engineering; Block cipher; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02816721293888503,"gpt":0.2850306899984802,"spread":0.2568634770595952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002530058,0.000354814,0.000332023,0.001481447,0.0001850771,0.0003136109,0.001253078,0.0002489327,0.00002484791],"category_scores_gemma":[0.0001068705,0.0003219357,0.00007339835,0.0005643044,0.0002014219,0.001218272,0.0002905913,0.0003448099,0.000008051889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007178127,"about_ca_system_score_gemma":0.0001160352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001473892,"about_ca_topic_score_gemma":0.000001910981,"domain_scores_codex":[0.9977132,0.0001720771,0.0004576175,0.0006071259,0.0006673485,0.0003826101],"domain_scores_gemma":[0.9976126,0.0009260111,0.0002542805,0.0008181929,0.0001950214,0.0001938762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003573498,0.00006483882,0.00005632946,0.0000961569,0.00001434832,0.000007449816,0.006372808,0.0336274,0.001596767,0.2252594,0.00002066781,0.7325265],"study_design_scores_gemma":[0.000457119,0.001159883,0.001192973,0.0005604277,0.00001417089,0.00001302039,0.000001037652,0.8155562,0.008745062,0.1714265,0.0001879745,0.000685647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001928158,0.00003776837,0.9959902,0.00007372502,0.000880304,0.0004411967,0.000007263522,0.00009586754,0.0005455466],"genre_scores_gemma":[0.8425894,0.000004814096,0.1558227,0.001425631,0.0001183769,0.00000636662,0.00001029429,0.00001318179,0.000009170122],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8406613,"threshold_uncertainty_score":0.9999233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2477064046","doi":"","title":"Equations over finite fields","year":2013,"lang":"en","type":"book","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01860300748089143,"gpt":0.2252885695491036,"spread":0.2066855620682121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001101881,0.0001523098,0.0001381384,0.0001626897,0.0000865246,0.0001886725,0.0008810916,0.0002037676,0.002572222],"category_scores_gemma":[0.00002571042,0.0001330935,0.0001597883,0.0001119491,0.00003252981,0.0002249053,0.0002621138,0.0002364764,0.001221492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001694189,"about_ca_system_score_gemma":0.0001126051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006566644,"about_ca_topic_score_gemma":0.00000735763,"domain_scores_codex":[0.9992068,0.00002443798,0.000150711,0.0002842699,0.000174354,0.0001594459],"domain_scores_gemma":[0.9986218,0.0004777929,0.00006608378,0.0007246332,0.00004724116,0.0000625153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[2.345583e-7,0.000005939497,7.093687e-7,0.00000478152,0.00001323847,0.000001411247,0.00005408398,0.000007824129,4.311478e-7,0.8112584,0.1780248,0.01062807],"study_design_scores_gemma":[0.00004537919,0.0000282854,0.00000700721,0.00002155825,0.000006064541,5.851187e-7,5.699084e-7,0.004955206,0.000003681656,0.5801902,0.4145752,0.0001663195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[7.169778e-7,0.00004711565,0.4841225,0.0001678549,0.0002503209,0.00005889187,0.00000127133,0.0001384931,0.5152129],"genre_scores_gemma":[0.0008728335,0.00001511443,0.006006423,0.001403522,0.0001582897,0.00001740375,0.00001062415,0.000009326084,0.9915065],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.478116,"threshold_uncertainty_score":0.9995562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1499326532","doi":"10.1007/0-387-34805-0_56","title":"Good S-Boxes Are Easy To Find","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Bijection; Computer science; Cryptosystem; Independence (probability theory); Nonlinear system; Arithmetic; Algorithm; Theoretical computer science; Cryptography; Discrete mathematics; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02246416249936636,"gpt":0.2562765131883453,"spread":0.2338123506889789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001461781,0.000603027,0.000546438,0.0016836,0.0003488734,0.0006587199,0.004919879,0.0003499187,0.00004553552],"category_scores_gemma":[0.0001010897,0.0005657643,0.0002230016,0.001449794,0.0005181764,0.0004567006,0.001870591,0.0008501788,0.0001723122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000168835,"about_ca_system_score_gemma":0.0002521471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001030545,"about_ca_topic_score_gemma":0.00009652322,"domain_scores_codex":[0.9956564,0.0000369983,0.0004916352,0.001805804,0.001097374,0.00091182],"domain_scores_gemma":[0.9967052,0.0005815271,0.0002556914,0.001862171,0.0002304966,0.0003648831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001162329,0.00003425237,0.0001556212,0.00002531883,0.00001265032,0.0001499503,0.0006731481,0.003709818,0.0001141465,0.1884273,0.00004706091,0.8066391],"study_design_scores_gemma":[0.0004328184,0.0006316023,0.002158094,0.001218134,0.00001754886,0.0001631383,5.894901e-7,0.03223719,0.002709013,0.9233316,0.03493648,0.002163787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001810783,0.000336638,0.9808649,0.0007447131,0.002115278,0.0003508301,0.00000585105,0.0002663248,0.01513439],"genre_scores_gemma":[0.1584781,0.00003224714,0.826844,0.01113163,0.001466397,0.00001764874,0.000004095226,0.00008638238,0.001939517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8044753,"threshold_uncertainty_score":0.9996794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950091396","doi":"10.48550/arxiv.quant-ph/0309120","title":"Constructions of Mutually Unbiased Bases","year":2003,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutually unbiased bases; Orthonormal basis; Mathematics; Pairwise comparison; Combinatorics; Set (abstract data type); Exponential function; Prime (order theory); Product (mathematics); Space (punctuation); Discrete mathematics; Computer science; Pure mathematics; Statistics; Physics; Hilbert space; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06883026968149751,"gpt":0.1699099227456186,"spread":0.1010796530641211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002106917,0.0002143652,0.0002787253,0.0003483535,0.0001252311,0.00004678336,0.001261623,0.0001718756,0.00009315836],"category_scores_gemma":[0.00003980451,0.0002589008,0.0003012189,0.0008154296,0.0002784957,0.0001898662,0.0006906978,0.0003246154,0.00001807841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004147576,"about_ca_system_score_gemma":0.0002115137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003467332,"about_ca_topic_score_gemma":0.00001226975,"domain_scores_codex":[0.9986554,0.0002058471,0.0001848665,0.000667662,0.00006957672,0.0002166749],"domain_scores_gemma":[0.9981773,0.000167149,0.0002419072,0.001139398,0.0001623379,0.000111926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001473043,0.00008558504,0.00160785,0.00004289339,0.00008547351,0.0000595618,0.0001031427,0.01269982,0.00007759969,0.9842337,0.0002088655,0.0007807779],"study_design_scores_gemma":[0.001188959,0.0002032946,0.001785982,0.0002951609,0.0002563193,0.00003223744,0.000361418,0.06442626,0.00210546,0.9243749,0.003818077,0.00115188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3107621,0.000038819,0.6730104,0.0000325802,0.0006830385,0.000146387,0.0000265462,0.0001809308,0.01511919],"genre_scores_gemma":[0.9949114,0.00005344111,0.004608714,0.00006789636,0.00001981862,4.550739e-7,0.000005279045,0.000008135575,0.0003248147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6841494,"threshold_uncertainty_score":0.9999864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090331763","doi":"10.1109/tit.2006.876251","title":"Constructions of quadratic bent functions in polynomial forms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Combinatorics; Mathematics; Bent function; Boolean function; Polynomial; Quadratic equation; Degree (music); Discrete mathematics; Sigma; Geometry; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.004477564958067519,"gpt":0.1895377663441877,"spread":0.1850602013861202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840549,0.0001211829,0.0001363836,0.0007424483,0.0002008739,0.00006355447,0.0002612794,0.00007036724,0.0001025402],"category_scores_gemma":[0.000004573832,0.0001158974,0.0001372103,0.0007795656,0.000118827,0.00170795,0.000002239153,0.0001775094,0.00007639401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005111859,"about_ca_system_score_gemma":0.00006366192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003607865,"about_ca_topic_score_gemma":0.0000436909,"domain_scores_codex":[0.9989372,0.00008038507,0.0005143976,0.0001108689,0.0001818638,0.0001752459],"domain_scores_gemma":[0.9992371,0.0001724519,0.0001441076,0.0003409947,0.00006628755,0.00003911789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001128139,0.0002445493,0.00005832679,0.00002869862,0.00002793593,4.57759e-7,0.001185359,0.03881706,0.000337848,0.8699532,0.0002065631,0.08902722],"study_design_scores_gemma":[0.008129726,0.001494538,0.007005438,0.0003652743,0.0001658104,0.0002152639,0.007511236,0.06283263,0.1014723,0.794726,0.01409044,0.00199137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04609689,0.000006804148,0.9400319,0.00009143116,0.000638702,0.0001772159,0.00002798192,0.0001282229,0.01280078],"genre_scores_gemma":[0.9973793,0.000002827244,0.002367056,0.00008738285,0.00001428079,0.00004983324,0.00000517956,0.000003834918,0.00009027637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9512824,"threshold_uncertainty_score":0.472616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W183907894","doi":"10.1007/3-540-44987-6_25","title":"Hyper-bent Functions","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Monomial; Affine transformation; Bijection; Class (philosophy); Bent function; Computer science; Boolean function; Affine variety; Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Pure mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01732964343195794,"gpt":0.226247697678485,"spread":0.208918054246527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007250961,0.0004799978,0.0004007956,0.001080083,0.0004190063,0.000544283,0.003296334,0.0002622251,0.000116879],"category_scores_gemma":[0.00004045459,0.0004439167,0.0002278003,0.001059983,0.0006507702,0.0005217617,0.001189247,0.0007858786,0.0001864046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001669471,"about_ca_system_score_gemma":0.0002966059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009908721,"about_ca_topic_score_gemma":0.00004034585,"domain_scores_codex":[0.9966623,0.00003438706,0.0003989282,0.001450617,0.0007983556,0.0006554444],"domain_scores_gemma":[0.9974151,0.0003511389,0.0001759887,0.001684579,0.0001705917,0.0002026298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000414733,0.00003155505,0.00004476721,0.000009910434,0.000009651489,0.00005511179,0.0002420626,0.004355941,0.00005576907,0.1558237,0.00007699242,0.8392904],"study_design_scores_gemma":[0.0002662628,0.0002937162,0.0001172218,0.0002804121,0.00001504581,0.000217227,2.224018e-7,0.07907774,0.0003134042,0.858536,0.05990822,0.000974536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007500632,0.0004313949,0.9568595,0.0007482104,0.002730782,0.0002209894,0.000003324875,0.0002986715,0.03863207],"genre_scores_gemma":[0.3812594,0.0003293777,0.6008119,0.008171309,0.003136281,0.00005341831,0.00002026089,0.0001517715,0.00606633],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8383159,"threshold_uncertainty_score":0.9998013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969341770","doi":"10.1006/jsco.1999.0309","title":"Algorithms for Exponentiation in Finite Fields","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Exponentiation; Mathematics; Normal basis; Finite field; Modular exponentiation; Multiplication (music); Division (mathematics); Basis (linear algebra); Polynomial; Polynomial basis; Combinatorics; Element (criminal law); Prime (order theory); Discrete mathematics; Arithmetic; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01953647114672561,"gpt":0.2727223051112659,"spread":0.2531858339645403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004748263,0.00005803244,0.0001193369,0.0002429182,0.00004454766,0.00006489635,0.0002170077,0.00003770028,0.00001861755],"category_scores_gemma":[0.00002474991,0.00005536953,0.00009389047,0.0003193643,0.00000885288,0.0004118713,0.00001124353,0.00008877408,0.000003875929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001788497,"about_ca_system_score_gemma":0.00002843869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002742545,"about_ca_topic_score_gemma":0.000001638489,"domain_scores_codex":[0.9992911,0.0000528645,0.0003241223,0.00008785182,0.0001412138,0.0001028895],"domain_scores_gemma":[0.9994408,0.0002083023,0.0001505898,0.00007318987,0.00009242625,0.00003463936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000507271,0.00009838067,0.0003214021,0.0000112822,0.00001542382,0.000006741729,0.00230114,0.04473567,0.00009256605,0.008317469,0.0002710097,0.9437782],"study_design_scores_gemma":[0.001738778,0.0005172685,0.02225335,0.00009911087,0.00001351322,0.00006029259,0.00007092069,0.7321569,0.0003856062,0.2401823,0.002342522,0.0001794472],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.232654,0.00006584694,0.7663129,0.0004529505,0.0002218766,0.00006305123,3.701731e-7,0.00001250025,0.0002164428],"genre_scores_gemma":[0.9650514,0.00002336474,0.03462863,0.0001393515,0.000126151,0.000002791222,0.00000118784,0.000003135843,0.00002396794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9435987,"threshold_uncertainty_score":0.2257904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139563752","doi":"10.1016/s0012-365x(03)00158-4","title":"On the iteration of certain quadratic maps over GF(p)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic equation; GF(2); Combinatorics; Discrete mathematics; Finite field","retraction":null,"screen_n_in":null,"score":{"opus":0.01583649233206545,"gpt":0.2384164064629816,"spread":0.2225799141309162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504407,0.000106249,0.0001254285,0.00006046293,0.0001007659,0.00009360129,0.0004041448,0.00003108229,0.00007190258],"category_scores_gemma":[0.0001945218,0.00006617398,0.00009356769,0.0002953629,0.000048921,0.0001184974,0.000038581,0.00007845792,0.00002518918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007854801,"about_ca_system_score_gemma":0.00001495885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.30238e-7,"about_ca_topic_score_gemma":0.000001317815,"domain_scores_codex":[0.999151,0.0001286419,0.0002239215,0.0001361672,0.0002270738,0.0001332265],"domain_scores_gemma":[0.9987029,0.0005034463,0.00012074,0.0006142064,0.00002992051,0.00002875605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001481377,0.00004708273,0.00001855117,0.00002955392,0.00001125058,7.617573e-7,0.002168921,0.00003079094,0.0004032691,0.9966943,0.0003721783,0.0002218313],"study_design_scores_gemma":[0.0001134083,0.00007944042,0.00003200472,0.00006905021,0.000009175715,0.000003513339,0.0002036123,0.01700443,0.004165486,0.9777158,0.0004932305,0.0001108737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1678547,0.00002786875,0.8039867,0.0005278104,0.0001485854,0.0002482352,0.000004342915,0.00006656298,0.02713525],"genre_scores_gemma":[0.9863153,0.000002555305,0.01321754,0.0002658306,0.000008938625,0.00001281725,0.000001318944,0.000007531664,0.000168248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8184605,"threshold_uncertainty_score":0.2698497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053024959","doi":"10.1109/tit.2004.842778","title":"Polyphase Sequences With Low Autocorrelation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polyphase system; Maxima and minima; Autocorrelation; Mathematics; Sequence (biology); Autocorrelation matrix; Complementary sequences; Base (topology); Algorithm; Energy (signal processing); Combinatorics; Discrete mathematics; Mathematical analysis; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.005474216477185372,"gpt":0.2073840663128367,"spread":0.2019098498356513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003999298,0.0001289597,0.00008317884,0.0003423093,0.0003146834,0.0001676315,0.0003267912,0.00005740798,0.0001482928],"category_scores_gemma":[0.000003052055,0.000105892,0.00006988101,0.0005050809,0.00007465006,0.004082225,0.00000117273,0.0001756257,0.0004159738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004350098,"about_ca_system_score_gemma":0.00005577301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002466767,"about_ca_topic_score_gemma":0.000003495021,"domain_scores_codex":[0.9991514,0.00008346261,0.0002375647,0.0001215717,0.0002363875,0.0001696],"domain_scores_gemma":[0.9992853,0.0001288823,0.0001045048,0.0003396885,0.000069313,0.00007226505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001360252,0.00008108745,0.000002632841,0.0000100531,0.00002637358,6.285648e-7,0.002794329,0.07223192,0.00006699227,0.361177,0.0000539152,0.563419],"study_design_scores_gemma":[0.006596832,0.002527437,0.0005438832,0.0004574838,0.0001463133,0.0003535077,0.00198616,0.60851,0.166492,0.1699548,0.03993253,0.002498942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006562,0.000006463986,0.9858391,0.0003596611,0.0002576761,0.0001947303,0.000006501891,0.0004131862,0.006360671],"genre_scores_gemma":[0.988748,0.000004825304,0.01008142,0.0009153798,0.00002445273,0.00005596689,0.000002435793,0.000004396455,0.0001631851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.982186,"threshold_uncertainty_score":0.534664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112446992","doi":"10.1007/s10623-005-6345-x","title":"A New Characterization of Semi-bent and Bent Functions on Finite Fields*","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Bent function; Finite field; Mathematics; Characterization (materials science); Prime (order theory); Boolean function; Combinatorics; Computation; Polynomial; Quadratic equation; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Physics; Algorithm; Materials science; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.01302568874685186,"gpt":0.2043936848409103,"spread":0.1913679960940584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001513721,0.0001558138,0.000170667,0.0003216921,0.0001666671,0.0001239985,0.0001677383,0.00007087748,0.00001968019],"category_scores_gemma":[0.000005431686,0.0001419998,0.0001016135,0.0005829072,0.00006512239,0.0001799938,0.0000601198,0.00008983368,0.000001537804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003001073,"about_ca_system_score_gemma":0.00001565959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004476254,"about_ca_topic_score_gemma":0.00001224018,"domain_scores_codex":[0.9990731,0.00005983956,0.0002204701,0.0003120321,0.0001531681,0.0001813587],"domain_scores_gemma":[0.9993596,0.0001356507,0.000100215,0.0002731849,0.00004243489,0.00008891318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008161564,0.0001995822,0.00934518,0.00004710413,0.00006529153,0.000004770346,0.0005418229,0.0001171215,0.02964312,0.8958929,0.001106973,0.06295449],"study_design_scores_gemma":[0.003899994,0.00463647,0.3494589,0.0005964128,0.0002718268,0.00005644789,0.0002754852,0.01719257,0.03798193,0.5290495,0.05443501,0.002145483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2051439,0.0001759365,0.7932315,0.0002265946,0.0001067872,0.0001267316,0.00001161307,0.0000733314,0.0009035194],"genre_scores_gemma":[0.9932684,0.0001480518,0.006211579,0.0002065185,0.00006265595,0.00001270604,0.00001718143,0.000007374335,0.00006554824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7881244,"threshold_uncertainty_score":0.5790585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011798878","doi":"10.1006/ffta.2001.0332","title":"Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions","year":2002,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Divisibility rule; Mathematics; Boolean function; Correlation; Nonlinear system; Property (philosophy); Mathematical proof; Algebraic number; Domain (mathematical analysis); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009731903311448296,"gpt":0.1986584480474658,"spread":0.1889265447360175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001091399,0.0000666202,0.0001150913,0.0002021197,0.0001751883,0.00003492058,0.0001296196,0.00004428014,0.00005883761],"category_scores_gemma":[0.000004762575,0.00005737878,0.0000729831,0.0008324415,0.00005584776,0.00007969611,0.00005542754,0.00007729881,0.000003944412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003640054,"about_ca_system_score_gemma":0.000002936461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001027422,"about_ca_topic_score_gemma":0.00001427955,"domain_scores_codex":[0.9995179,0.00002375905,0.000150759,0.0001782215,0.0000456544,0.0000836691],"domain_scores_gemma":[0.9993848,0.0001593772,0.00006230362,0.0003296785,0.00002441922,0.00003945734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005740765,0.00009970424,0.002313529,0.00000886617,0.0002402339,2.28793e-7,0.002953699,0.0007254466,0.0003931086,0.9424388,0.0001439845,0.05067663],"study_design_scores_gemma":[0.0006746406,0.0003569606,0.08908357,0.00002924653,0.000433038,0.00001068795,0.0009376887,0.5286103,0.0004999823,0.3398089,0.03902097,0.0005340102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05296427,0.0005041505,0.941877,0.0004334262,0.00002284552,0.0001089419,0.00002105549,0.00003509803,0.00403322],"genre_scores_gemma":[0.99749,0.00009067811,0.002151614,0.00004978143,0.0000148922,0.00003374516,0.00001189521,0.000002171391,0.0001552298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9445257,"threshold_uncertainty_score":0.2339839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129568979","doi":"10.1109/tit.2010.2040888","title":"Optimal Frequency-Hopping Sequences With New Parameters","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Prime (order theory); Combinatorics; Algorithm; Discrete mathematics; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.009472739349772318,"gpt":0.2108607350587515,"spread":0.2013879957089792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004583681,0.0001585821,0.0001083697,0.0003367813,0.0003227075,0.0002774684,0.0005675811,0.00008085315,0.0001351844],"category_scores_gemma":[0.000007595083,0.0001305968,0.00009244367,0.0005248056,0.0001300678,0.003124405,0.00000193194,0.0004027166,0.0001702715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000175137,"about_ca_system_score_gemma":0.0001253486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002137009,"about_ca_topic_score_gemma":0.00001440445,"domain_scores_codex":[0.9990749,0.00005295971,0.0002456673,0.0001559874,0.00024494,0.0002255102],"domain_scores_gemma":[0.9990287,0.0001925291,0.0001099055,0.0004686645,0.00006627184,0.0001339165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001422962,0.00005822491,0.00001519112,0.00001832252,0.00008512048,0.000002411588,0.005709974,0.03642891,0.001711237,0.679022,0.00009155505,0.2767148],"study_design_scores_gemma":[0.004805801,0.002848762,0.0005871483,0.000360256,0.000195697,0.0006929002,0.003589177,0.05157195,0.2971699,0.6257549,0.009124702,0.003298798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06228888,0.000003247078,0.9322631,0.0002511444,0.0007578555,0.0001389103,0.000004729199,0.0003488956,0.003943235],"genre_scores_gemma":[0.9072733,0.000004072301,0.09199411,0.0006081727,0.00001920006,0.00002578693,0.000001359819,0.000005516574,0.00006848892],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8449844,"threshold_uncertainty_score":0.5325583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2915023553","doi":"10.1023/a:1008397921377","title":"Integer Factoring","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01856317441616658,"gpt":0.2261205295762287,"spread":0.2075573551600621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600872,0.0002001914,0.0001840057,0.0002469335,0.0002678932,0.0002992208,0.0005258409,0.00006947076,0.000281616],"category_scores_gemma":[0.000005063924,0.0001766225,0.0001650293,0.0008031546,0.0001223185,0.0004149747,0.00006701332,0.0001498573,0.00003326691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004495915,"about_ca_system_score_gemma":0.00001077431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001332111,"about_ca_topic_score_gemma":0.000001782398,"domain_scores_codex":[0.9987897,0.00007898933,0.000184145,0.0004232606,0.0001767568,0.0003472034],"domain_scores_gemma":[0.9992222,0.0001082097,0.00003536951,0.0004440435,0.00003214618,0.0001580298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002770695,0.00007416924,0.003482922,0.00001380664,0.00006036002,0.00001640893,0.001389281,0.00001592829,0.00138819,0.6202825,0.0004024746,0.3728463],"study_design_scores_gemma":[0.001694777,0.001063996,0.02634901,0.0001913234,0.00008304267,0.0001679737,0.0003266093,0.006484258,0.006831164,0.5462583,0.4083627,0.002186875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1886224,0.0009555735,0.7913679,0.0002761466,0.0001778774,0.0001577108,0.000004249341,0.0005248085,0.01791332],"genre_scores_gemma":[0.9765866,0.0003120143,0.02247962,0.0004666967,0.00005505383,0.00001945593,0.000001658413,0.00001166159,0.00006718997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7879643,"threshold_uncertainty_score":0.7202455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W191763761","doi":"10.1007/s11856-000-1270-1","title":"On the statistical properties of Diffie-Hellman distributions","year":2000,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Multiplicative function; Combinatorics; Order (exchange); Distribution (mathematics); Exponential function; Upper and lower bounds; Prime power; Prime (order theory); Discrete mathematics; Function (biology); Prime number theorem; Prime number; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0239563930147921,"gpt":0.2305802921217088,"spread":0.2066238991069167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000561579,0.00007748985,0.0001633524,0.00004941759,0.00009167333,0.00005225115,0.0006522698,0.00002349174,0.00008601113],"category_scores_gemma":[0.000161918,0.00004144927,0.0001033359,0.0001680388,0.0001243666,0.00007758167,0.00003460895,0.0001570068,0.00001860706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009574422,"about_ca_system_score_gemma":0.00003108753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.045373e-7,"about_ca_topic_score_gemma":4.711774e-7,"domain_scores_codex":[0.9990802,0.00008180596,0.0003696741,0.00005772753,0.00029678,0.0001138405],"domain_scores_gemma":[0.9989516,0.0004389214,0.0001859266,0.0002841892,0.00009128895,0.00004813378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000125085,0.0003015926,0.00001492693,0.00002591719,0.00003090608,0.000006336403,0.0007968713,0.0000474669,0.0004679654,0.9912966,0.0006080096,0.006390861],"study_design_scores_gemma":[0.0003905288,0.0006058408,0.0002852842,0.000520125,0.00005756986,0.0002148235,0.0005325812,0.01005272,0.009559947,0.9757604,0.001845551,0.0001746523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6278999,0.00009905161,0.3692995,0.001117659,0.00007426198,0.00006266536,0.000008055204,0.00001346276,0.001425363],"genre_scores_gemma":[0.9876792,0.00003260603,0.01210587,0.0001024405,0.00002735589,0.000001098864,1.34695e-7,0.000003958873,0.00004730163],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3597793,"threshold_uncertainty_score":0.1690252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3099148554","doi":"","title":"Fast Encoding and Decoding of Gabidulin Codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; List decoding; Encoding (memory); Computer science; Coding (social sciences); Sequential decoding; Metric (unit); Theoretical computer science; Algorithm; Berlekamp–Welch algorithm; Concatenated error correction code; Block code; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02473801841919021,"gpt":0.256358574827968,"spread":0.2316205564087778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006981944,0.0001942262,0.0003044814,0.0002047016,0.00007668805,0.0001273073,0.0008065418,0.0001460119,0.00004791538],"category_scores_gemma":[0.00003105449,0.0001763361,0.0001232841,0.0001623695,0.00008961062,0.0001960951,0.00202055,0.0002683909,0.000005726435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001107823,"about_ca_system_score_gemma":0.00003263263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002388885,"about_ca_topic_score_gemma":0.00000661442,"domain_scores_codex":[0.9988363,0.00008393052,0.000277653,0.0003870327,0.000168103,0.0002469392],"domain_scores_gemma":[0.9988698,0.0001992329,0.0001758089,0.0005975949,0.00005437865,0.000103176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007127678,0.00005775632,0.008028187,0.0002567742,0.00006567184,0.000002423614,0.002363085,0.00006731322,0.002199435,0.8953975,0.000117395,0.09143737],"study_design_scores_gemma":[0.001170121,0.0002339537,0.0200218,0.001990362,0.0002356545,0.0001039854,0.0008384795,0.07028016,0.07307452,0.8260398,0.002904503,0.003106691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1383046,0.001055723,0.8349727,0.0001432991,0.0006989621,0.0001535318,0.000005863613,0.0002095492,0.02445577],"genre_scores_gemma":[0.9109915,0.0001210323,0.08868714,0.00005116987,0.00007380368,0.000007592468,0.000001679072,0.000007386297,0.00005862139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.772687,"threshold_uncertainty_score":0.7190777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994268719","doi":"10.1016/s0012-365x(02)00520-4","title":"On self-dual codes over some prime fields","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Prime (order theory); Combinatorics; Discrete mathematics; Separable space; Minimum distance; Block code; Linear code; Finite field; Algorithm; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.0115335673435003,"gpt":0.2415222410919872,"spread":0.2299886737484869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536367,0.0001556091,0.0001702842,0.00008043839,0.000119404,0.0001280843,0.0004081492,0.00006957536,0.00005862758],"category_scores_gemma":[0.00008210646,0.0001270323,0.000115523,0.0002144143,0.00003354651,0.0002160102,0.00008241579,0.0001358609,0.00007823786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000143166,"about_ca_system_score_gemma":0.00002540201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.619932e-7,"about_ca_topic_score_gemma":7.608052e-7,"domain_scores_codex":[0.9990055,0.00006790335,0.0001927591,0.0002329776,0.0002549737,0.0002458711],"domain_scores_gemma":[0.9989017,0.0002790976,0.00007770056,0.0006446735,0.00002091541,0.00007591844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001559455,0.0001037923,0.00001563133,0.0000247107,0.00002375824,0.000006374236,0.001384391,0.00001099843,0.00008111771,0.9975518,0.0005716913,0.0002241538],"study_design_scores_gemma":[0.0002429568,0.0001431246,0.00004369327,0.00004711125,0.00001565855,0.0000138813,0.00005948094,0.007006388,0.004882426,0.9852001,0.002091508,0.0002536592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2415944,0.00008813298,0.7017224,0.0003140757,0.0004983705,0.0002875279,0.000006193608,0.0007003232,0.05478851],"genre_scores_gemma":[0.9285859,0.00001075971,0.07041902,0.0006398763,0.0000384416,0.00001281876,0.000001268059,0.00001508083,0.0002767937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6869915,"threshold_uncertainty_score":0.5180226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171816248","doi":"10.1112/s0025579300015734","title":"Character sums with exponential functions","year":2000,"lang":"en","type":"article","venue":"Mathematika","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Muscular Dystrophy Canada; University of Toronto","funders":"","keywords":"Mathematics; Modulo; Integer (computer science); Multiplicative function; Combinatorics; Primitive root modulo n; Character (mathematics); Prime (order theory); Exponential function; Sequence (biology); Discrete mathematics; Integer sequence; Multiplicative inverse; Multiplicative group; Inverse; Generating function","retraction":null,"screen_n_in":null,"score":{"opus":0.005717826797967586,"gpt":0.1764861520601498,"spread":0.1707683252621822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001205588,0.00009040272,0.00008995466,0.00005782728,0.0001305169,0.0001163897,0.0003381812,0.00002426216,0.001812557],"category_scores_gemma":[0.000002082851,0.00006713941,0.00005487963,0.0002576283,0.00003383189,0.0003068701,0.00003159292,0.00006758654,0.0009332761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004928913,"about_ca_system_score_gemma":0.000009781067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001898463,"about_ca_topic_score_gemma":0.000001484237,"domain_scores_codex":[0.9993771,0.00002517151,0.00009832042,0.0001949695,0.0001408447,0.0001635567],"domain_scores_gemma":[0.9994422,0.00003252476,0.0000272131,0.0004305062,0.00001727976,0.00005027911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008256294,0.0005184478,0.0003597802,0.00004399478,0.00009421718,0.0000638644,0.004320773,0.00003029793,0.001508394,0.7332458,0.005179214,0.2545527],"study_design_scores_gemma":[0.00354297,0.001148318,0.02074404,0.0004201137,0.0001307564,0.0008962599,0.0003207712,0.01184663,0.007593759,0.3572207,0.593641,0.002494599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5536848,0.00002931751,0.390892,0.0005243654,0.0001650174,0.0001370796,0.000002352284,0.0004643204,0.05410069],"genre_scores_gemma":[0.9801317,0.000004141923,0.01314901,0.0002577991,0.0001028295,0.0000374458,0.000002734128,0.00001125594,0.006303101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5884618,"threshold_uncertainty_score":0.9998446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055862451","doi":"10.1016/j.ins.2007.12.002","title":"WG: A family of stream ciphers with designed randomness properties","year":2007,"lang":"en","type":"article","venue":"Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Correlation attack; Keystream; Randomness; Stream cipher attack; Computer science; Ideal (ethics); Cryptography; Randomness tests; Block cipher mode of operation; Theoretical computer science; Differential cryptanalysis; Algorithm; Mathematics; Statistics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02459415622454515,"gpt":0.2323520195910973,"spread":0.2077578633665522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001668674,0.00006936218,0.00009258319,0.0002465736,0.0001900374,0.0001742778,0.0006268153,0.00002068399,0.000003901173],"category_scores_gemma":[0.0000349809,0.00004307673,0.00003086217,0.001143864,0.0003392861,0.003020319,0.0000480618,0.00003334758,0.00000828921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006934892,"about_ca_system_score_gemma":0.00009103624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002498125,"about_ca_topic_score_gemma":0.000006709533,"domain_scores_codex":[0.9990455,0.00002663886,0.0002513372,0.00008781797,0.0004179359,0.0001707868],"domain_scores_gemma":[0.999419,0.00008756562,0.0001578057,0.0001596074,0.0001345565,0.00004142208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006299493,0.00009857453,0.005606299,0.00009596856,0.00003914926,0.000002551004,0.03625686,0.003436088,0.008122935,0.4802784,0.0002034464,0.4652298],"study_design_scores_gemma":[0.01783172,0.008116483,0.1122848,0.001274535,0.00008477017,0.0001756992,0.09315822,0.1013042,0.5909791,0.05104326,0.02033476,0.003412454],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4181065,0.00002393672,0.5658869,0.00005246272,0.00007229779,0.0001012229,3.340693e-7,0.00005899667,0.01569732],"genre_scores_gemma":[0.9879378,0.000002277472,0.01187089,0.0001695929,0.000005941507,0.000004643791,2.340413e-7,7.855745e-7,0.000007799905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5828562,"threshold_uncertainty_score":0.2189658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168888523","doi":"10.1109/tit.2004.838341","title":"Binary Sequences With Merit Factor Greater Than&amp;lt;tex&amp;gt;$6.34$&amp;lt;/tex&amp;gt;","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Binary number; Figure of merit; Value (mathematics); Mathematics; Combinatorics; Construct (python library); Statistics; Physics; Computer science; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.02163218144826148,"gpt":0.2330094041940499,"spread":0.2113772227457884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008369107,0.0006056311,0.0004288292,0.0009950476,0.0009953263,0.0005824753,0.001235923,0.0002689488,0.0009011352],"category_scores_gemma":[0.00001864674,0.0005034014,0.0003730665,0.001474847,0.0004404029,0.004835582,0.00001700025,0.0005903822,0.002264004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002023912,"about_ca_system_score_gemma":0.0002018768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003267025,"about_ca_topic_score_gemma":0.0001362719,"domain_scores_codex":[0.9968065,0.0003074411,0.0007989524,0.0005327648,0.0008391189,0.0007152174],"domain_scores_gemma":[0.9973593,0.0002835765,0.0003674329,0.001407371,0.0002760175,0.0003063107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003851219,0.001733326,0.0001891523,0.0006327344,0.001710745,0.00002821624,0.1060757,0.1232639,0.02075524,0.489369,0.001575537,0.2508152],"study_design_scores_gemma":[0.01643253,0.004614157,0.00378531,0.003005461,0.001142617,0.001995612,0.002929908,0.001623338,0.09006265,0.3369225,0.52624,0.01124594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1474545,0.00006249122,0.8453739,0.0004756612,0.001036176,0.0004560022,0.0001178861,0.0008263569,0.004197049],"genre_scores_gemma":[0.9777309,0.00007389181,0.02014361,0.0008292502,0.00007876311,0.0001602265,0.00004740767,0.00003689001,0.0008990185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8302764,"threshold_uncertainty_score":0.9997417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022989647","doi":"10.1016/j.camwa.2007.04.028","title":"A new high dynamic range moduli set with efficient reverse converter","year":2007,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Adder; Chinese remainder theorem; Moduli; Residue number system; Modulo; Mathematics; Converters; Arithmetic; Binary number; Digital signal processing; Discrete mathematics; Computer science; Computer hardware; Voltage; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007711190744757583,"gpt":0.2230824809869821,"spread":0.2153712902422245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003383932,0.0002481555,0.0002498573,0.0002016731,0.0002169713,0.0001439763,0.00098434,0.00005557146,0.00001277786],"category_scores_gemma":[0.00000263063,0.0001907117,0.0000679462,0.0009880116,0.0001096627,0.0001293227,0.0001578051,0.0001570197,0.00008811218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004993266,"about_ca_system_score_gemma":0.00007640148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001117777,"about_ca_topic_score_gemma":0.00001593431,"domain_scores_codex":[0.9985111,0.00002053978,0.0002890164,0.0004754571,0.0003327733,0.000371086],"domain_scores_gemma":[0.9980357,0.0002390753,0.0001853795,0.001194323,0.0001079115,0.000237647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000460437,0.0004026723,0.00009169066,0.0001275341,0.0001327048,0.00002390164,0.0039721,0.001668488,0.000174951,0.9363157,0.001705018,0.05533926],"study_design_scores_gemma":[0.004666789,0.0009009572,0.002321517,0.000647267,0.0002880171,0.0006118382,0.0006830327,0.7981461,0.0008825777,0.170369,0.01830478,0.002178083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008982811,0.00003137828,0.9886138,0.0005168108,0.00006818594,0.0007654052,0.000004493734,0.000373331,0.0006437296],"genre_scores_gemma":[0.319746,0.000002654743,0.6797054,0.0003007225,0.00003643317,0.00007368452,0.000007319719,0.00002102879,0.0001067397],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7964776,"threshold_uncertainty_score":0.7776998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000840326","doi":"10.1090/s0025-5718-05-01769-2","title":"Minimality and other properties of the width-𝑤 nonadjacent form","year":2005,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03504730502769028,"gpt":0.245026918921621,"spread":0.2099796138939307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006316702,0.0001426852,0.0002544149,0.00006865941,0.00009734302,0.00005377376,0.0004004695,0.00005586334,0.000007391616],"category_scores_gemma":[0.00004707024,0.00009894112,0.000120654,0.0002613931,0.0002701187,0.0001734173,0.0002290197,0.00007880965,0.000003461963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001568277,"about_ca_system_score_gemma":0.00004419689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009518064,"about_ca_topic_score_gemma":0.000009771411,"domain_scores_codex":[0.9987409,0.00008643536,0.0005245334,0.0001696685,0.0003355156,0.0001430056],"domain_scores_gemma":[0.9988602,0.0001307657,0.0004900483,0.0003397485,0.0001444848,0.00003468444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008105337,0.001702619,0.001775162,0.003958866,0.0002246296,3.841091e-7,0.09957519,0.002860186,0.01384203,0.725988,0.0002508127,0.149741],"study_design_scores_gemma":[0.0007658994,0.0002501457,0.00335586,0.00149545,0.0001145093,0.00001691658,0.0008147842,0.6632863,0.06050566,0.2683966,0.0006723909,0.0003254586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8505498,0.0004794526,0.146888,0.0006665012,0.0001242483,0.0003219909,0.000006084907,0.00002051217,0.0009434479],"genre_scores_gemma":[0.9573113,0.000008074733,0.04251076,0.00008648454,0.00003099433,0.000003673245,1.860854e-7,0.000008777182,0.00003975626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6604261,"threshold_uncertainty_score":0.4034702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096776883","doi":"10.1016/j.ffa.2013.02.005","title":"Cyclotomy and permutation polynomials of large indices","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Mathematics; Discrete orthogonal polynomials; Finite field; Permutation graph; Difference polynomials; Partial permutation; Construct (python library); Cyclic permutation; Combinatorics; Classical orthogonal polynomials; Random permutation; Bit-reversal permutation; Discrete mathematics; Algebra over a field; Orthogonal polynomials; Pure mathematics; Symmetric group; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.006411509416715652,"gpt":0.2189252886992095,"spread":0.2125137792824938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009509184,0.00005500395,0.00007404885,0.0000643265,0.0001100641,0.00005379802,0.000145076,0.00004244181,0.00002766989],"category_scores_gemma":[0.000005922989,0.00004389328,0.00002158305,0.0001499903,0.00003666051,0.0001537517,0.00007656468,0.00004816625,0.000006211509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":9.191883e-7,"about_ca_system_score_gemma":0.000006223988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000016615,"about_ca_topic_score_gemma":0.000004351785,"domain_scores_codex":[0.9996376,0.00001868551,0.0001029808,0.000130802,0.00003096917,0.00007897033],"domain_scores_gemma":[0.9995092,0.0001881851,0.00005480753,0.0001818457,0.00002894672,0.00003706996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001746669,0.00005826169,0.00221785,0.00002704453,0.00001937147,7.220126e-8,0.003325196,0.00000222586,0.001455531,0.9110231,0.0001427543,0.08172681],"study_design_scores_gemma":[0.0006401116,0.0001935388,0.05912778,0.00003923703,0.00001771296,0.0000101272,0.0009315816,0.009811055,0.005199682,0.8865722,0.03708075,0.0003762295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3034481,0.0003322753,0.6913423,0.0008139819,0.00001983117,0.0002991708,0.00001654481,0.00004988243,0.00367794],"genre_scores_gemma":[0.9978611,0.00005172401,0.001707686,0.0001891186,0.00002005877,0.0001345549,0.000004045975,0.000002194399,0.00002951031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.694413,"threshold_uncertainty_score":0.1789916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111124108","doi":"10.1109/iscas.2008.4541418","title":"The application of lattice-reduction to the K-Best algorithm for near-optimal MIMO detection","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Lattice reduction; Scalability; Computer science; Reduction (mathematics); MIMO; A priori and a posteriori; Algorithm; Very-large-scale integration; Lattice (music); Computational complexity theory; Communication complexity; Sorting; Random access; Parallel computing; Theoretical computer science; Mathematics; Channel (broadcasting); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01557417750224503,"gpt":0.2445723545596544,"spread":0.2289981770574094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003522633,0.00005846773,0.00005130352,0.00002999765,0.0006737895,0.00005360497,0.0004163782,0.00002516577,0.000001038263],"category_scores_gemma":[0.00001404231,0.000034358,0.00006950266,0.0004040106,0.00007632079,0.0001262496,0.00005390142,0.00004717262,0.00001775942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009294054,"about_ca_system_score_gemma":0.00001692124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003377584,"about_ca_topic_score_gemma":0.00001491816,"domain_scores_codex":[0.9994394,0.00003616381,0.0001246468,0.0001632103,0.0001149939,0.0001215765],"domain_scores_gemma":[0.9993195,0.0001257344,0.00005401652,0.0003814688,0.00009113042,0.00002818218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001329538,0.00002953272,0.00000779457,0.000001623938,0.000009407564,4.558346e-8,0.000502898,0.0004300533,0.001664239,0.0386626,0.0001588291,0.9585197],"study_design_scores_gemma":[0.0002753588,0.0005123194,0.0005037943,0.000004937714,0.00001858061,0.00006427697,0.0004015256,0.8362313,0.05704206,0.01021094,0.09455814,0.0001767843],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02481494,0.00003495343,0.9732548,0.0009639335,0.00025239,0.0003526583,8.994263e-7,0.0000594974,0.0002659525],"genre_scores_gemma":[0.8608174,0.00001131614,0.1385792,0.00008935654,0.0001354986,0.000162639,5.742418e-7,0.00000487145,0.0001991464],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9583429,"threshold_uncertainty_score":0.5182312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234843542","doi":"10.1109/tcomm.2006.877972","title":"Applications of algebraic soft-decision decoding of Reed-Solomon codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Berlekamp–Welch algorithm; Computational complexity theory; Reed–Solomon error correction; Rayleigh fading; Fading; Sequential decoding; Concatenated error correction code; Electronic engineering; Theoretical computer science; Computer engineering; Block code; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01607861547041342,"gpt":0.2638310748973232,"spread":0.2477524594269098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359294,0.0001252873,0.0002109625,0.0004165228,0.0004197026,0.00003265083,0.002011353,0.00007832492,0.00002377879],"category_scores_gemma":[0.000006815861,0.0001378719,0.0002027841,0.001264024,0.0002749529,0.0002526295,0.00002091516,0.0002153879,0.00001558084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000258256,"about_ca_system_score_gemma":0.00004973038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001346551,"about_ca_topic_score_gemma":0.0002844926,"domain_scores_codex":[0.9987471,0.0001342148,0.000513603,0.0002291462,0.0002180344,0.0001579176],"domain_scores_gemma":[0.9958807,0.001040224,0.0002205753,0.00262623,0.0001854464,0.00004688348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003105634,0.001478542,0.0001188404,0.00003155421,0.00006479216,2.401879e-7,0.0004906557,0.00343665,0.01546098,0.5329793,0.0001457955,0.4457616],"study_design_scores_gemma":[0.001713592,0.0006235982,0.001900328,0.0004467804,0.0002340562,0.00003505654,0.0003345128,0.07266575,0.2072088,0.7018544,0.01199616,0.0009869926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004296637,0.0002589396,0.9920653,0.0002948724,0.00008135536,0.000250415,0.00004383114,0.0001407554,0.002567894],"genre_scores_gemma":[0.8933409,0.0001551946,0.1062902,0.00002642769,0.000008076791,0.0001136137,0.00000616139,0.000009838714,0.00004963948],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8890442,"threshold_uncertainty_score":0.5622252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013392609","doi":"10.1023/b:vlsi.0000047274.68702.8d","title":"Towards a VLSI Architecture for Interpolation-Based Soft-Decision Reed-Solomon Decoders","year":2004,"lang":"en","type":"article","venue":"The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Very-large-scale integration; Reed–Solomon error correction; Interpolation (computer graphics); Computer science; Parallel computing; Soft-decision decoder; Arithmetic; Algorithm; Decoding methods; Mathematics; Linear code; Embedded system; Artificial intelligence; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.01165687843441748,"gpt":0.2669418569395721,"spread":0.2552849785051546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002365869,0.0002794161,0.0004806752,0.0007722377,0.0005601922,0.0003207804,0.001230408,0.00022908,0.000001889893],"category_scores_gemma":[0.0002080882,0.000186276,0.0002338407,0.0006836344,0.0003345469,0.0005314896,0.0001106058,0.0004358609,7.936837e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005761717,"about_ca_system_score_gemma":0.0002996691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001116649,"about_ca_topic_score_gemma":0.000008580078,"domain_scores_codex":[0.9980795,0.000110041,0.0007725446,0.0003075877,0.0003158833,0.0004144631],"domain_scores_gemma":[0.9974059,0.000744087,0.0008152039,0.0002905559,0.0006424668,0.0001017847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002026931,0.0002426758,0.00006187366,0.0006960259,0.0002082879,0.00003212096,0.002196727,0.007795756,0.1420528,0.01350223,0.0006626004,0.830522],"study_design_scores_gemma":[0.006098989,0.005880684,0.00002035539,0.003154862,0.0003276431,0.002050295,0.001666205,0.2147498,0.05259652,0.7100157,0.002643529,0.0007954644],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01239203,0.003707756,0.9802096,0.002787676,0.0002347454,0.0005116317,0.000007499454,0.0001289251,0.00002015934],"genre_scores_gemma":[0.91614,0.00001589418,0.08343261,0.0002030158,0.0001467004,0.00002738628,0.000001091735,0.00002471332,0.000008546893],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.903748,"threshold_uncertainty_score":0.7596114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105512769","doi":"10.1109/tit.2010.2044062","title":"On the Construction of Skew Quasi-Cyclic Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Yildiz Teknik Üniversitesi; Ohio State University","keywords":"Ring (chemistry); Skew; Polynomial ring; Computer science; Combinatorics; Algorithm; Discrete mathematics; Polynomial; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.006696594448420201,"gpt":0.2075444106367516,"spread":0.2008478161883314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007885739,0.0001113243,0.0000998609,0.0002719426,0.0003151254,0.00008383155,0.0004650189,0.00007470857,0.0002136633],"category_scores_gemma":[0.00002509655,0.00008056265,0.0001254305,0.0004187491,0.0002191966,0.0008931942,0.000002014418,0.0003486398,0.0001399085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009761117,"about_ca_system_score_gemma":0.00003367078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003276843,"about_ca_topic_score_gemma":0.000003438498,"domain_scores_codex":[0.9991369,0.0001333775,0.0002864687,0.00009509533,0.0002211379,0.000126996],"domain_scores_gemma":[0.9984708,0.0007162764,0.0001536567,0.0005332656,0.00008384854,0.00004216023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004633714,0.000051557,0.000001255012,0.000007211665,0.00001717042,5.740271e-8,0.0009416155,0.0002147482,0.0004905286,0.890423,0.00004083318,0.1077657],"study_design_scores_gemma":[0.0004141989,0.0003155273,0.0001048659,0.00004152027,0.00002026844,0.00002717498,0.000418726,0.004233492,0.1141849,0.8775921,0.002425695,0.0002215452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06609789,0.000001636175,0.9254663,0.0003569008,0.001097479,0.0001457684,0.00001324657,0.0001315706,0.006689189],"genre_scores_gemma":[0.9960459,0.000007325629,0.003343174,0.0005263874,0.00001371005,0.00002972332,0.000001026491,0.000003575962,0.00002916808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.929948,"threshold_uncertainty_score":0.3285249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971255859","doi":"10.1090/s0002-9947-09-04578-4","title":"Permutation binomials over finite fields","year":2009,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Permutation (music); Partial permutation; Generalized permutation matrix; Cyclic permutation; Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Symmetric group","retraction":null,"screen_n_in":null,"score":{"opus":0.01494183587803234,"gpt":0.2628276539628394,"spread":0.247885818084807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004839671,0.0002328937,0.0004555601,0.00004410909,0.0003783975,0.00009482253,0.0009603141,0.00009224659,0.0003055394],"category_scores_gemma":[0.00005197919,0.0001749384,0.001220365,0.001226117,0.0007287558,0.0002278843,0.00002934973,0.0003801908,0.00003093738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004135385,"about_ca_system_score_gemma":0.00007261033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002559147,"about_ca_topic_score_gemma":0.000001302573,"domain_scores_codex":[0.9982365,0.0001993185,0.0004983272,0.0003208653,0.0004115023,0.0003334669],"domain_scores_gemma":[0.9978669,0.0007034443,0.0003854218,0.0008634531,0.00007679516,0.0001040234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002600962,0.004850971,0.0002405382,0.0006800622,0.001312067,0.0000040496,0.06084774,0.01444533,0.01179396,0.4696092,0.004055384,0.4319006],"study_design_scores_gemma":[0.0009997409,0.001512436,0.01040184,0.0004408328,0.0007013644,0.00002617822,0.001949295,0.2159146,0.006965562,0.7594895,0.0006908838,0.000907774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1293642,0.00005555555,0.8648428,0.004220399,0.0001614165,0.0002294557,0.00001782,0.00007624921,0.00103215],"genre_scores_gemma":[0.9796475,0.00007281551,0.01851646,0.001378754,0.00004938282,0.000007478859,4.945936e-7,0.00001032071,0.0003168406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8502833,"threshold_uncertainty_score":0.7133782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154006376","doi":"10.1109/tit.2006.871062","title":"A new binary sequence family with low correlation and large size","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary number; Integer (computer science); Physics; Correlation; Sequence (biology); Mathematics; Arithmetic; Geometry; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.005060276466135727,"gpt":0.1931805244656636,"spread":0.1881202479995279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003285462,0.0001311705,0.00009072268,0.0002056744,0.0002949119,0.0001563644,0.0001964161,0.00006224746,0.00004130746],"category_scores_gemma":[0.000003305052,0.000114382,0.00004621395,0.0004810025,0.00005045353,0.002427555,0.000002234548,0.0001596336,0.00007152765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000257692,"about_ca_system_score_gemma":0.00006326614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001726843,"about_ca_topic_score_gemma":0.000004992698,"domain_scores_codex":[0.9992139,0.00007098507,0.000213845,0.0001334343,0.0001937616,0.0001741225],"domain_scores_gemma":[0.9992929,0.0002237431,0.00009312211,0.0002694174,0.0000555016,0.00006529375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003401946,0.0001034884,0.00003617913,0.00003605722,0.00003050654,0.000003439725,0.002270663,0.02304113,0.0005776836,0.7848322,0.0004076083,0.1883209],"study_design_scores_gemma":[0.01083602,0.00261616,0.01223967,0.0006460053,0.0001799373,0.0003425209,0.002181905,0.2988905,0.01762485,0.6288226,0.02300701,0.002612812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02174554,0.00001722936,0.9741641,0.00009925452,0.0002271722,0.0001554358,0.00001204259,0.0002645852,0.003314653],"genre_scores_gemma":[0.9885373,0.000009923818,0.01061925,0.0005268401,0.00001645068,0.00001735068,0.000003463757,0.000005135817,0.0002643345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9667917,"threshold_uncertainty_score":0.4664361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032009701","doi":"10.1016/j.ffa.2008.12.001","title":"On permutation polynomials of prescribed shape","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Permutation (music); Monomial; Combinatorics; Cyclic permutation; Discrete mathematics; Symmetric group","retraction":null,"screen_n_in":null,"score":{"opus":0.01871378267860119,"gpt":0.2215874913020591,"spread":0.2028737086234579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007157842,0.00006126522,0.00007987568,0.00006872501,0.0001449075,0.00001417445,0.000209376,0.00004232545,0.0000246906],"category_scores_gemma":[0.00001211863,0.00005023438,0.00004216301,0.0001933793,0.00004807827,0.0000708748,0.00004449695,0.00005916703,0.000007765191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001773565,"about_ca_system_score_gemma":0.00001247164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000461023,"about_ca_topic_score_gemma":8.979167e-7,"domain_scores_codex":[0.9995964,0.00002161545,0.0001134956,0.0001489978,0.00004637317,0.00007308133],"domain_scores_gemma":[0.999324,0.0002869714,0.00004968118,0.0002763824,0.00003039893,0.00003251401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000923374,0.0000769522,0.0001289171,0.000008103458,0.00001222929,3.014444e-7,0.001767566,0.00003852202,0.0007813898,0.9547824,0.0002681263,0.04212621],"study_design_scores_gemma":[0.0008128701,0.0006347005,0.01244969,0.00005035047,0.00001531589,0.0000293732,0.0001665791,0.03607255,0.0156809,0.9086536,0.02495302,0.0004810062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.141443,0.0001119233,0.8512573,0.0004946484,0.00003127813,0.0001957411,0.00001610886,0.00006765275,0.00638233],"genre_scores_gemma":[0.9980254,0.00004018856,0.001550836,0.0002281438,0.0000239044,0.00006651537,0.000004817144,0.000002715419,0.00005745422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8565824,"threshold_uncertainty_score":0.2048499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022705034","doi":"10.1155/2007/23408","title":"On Polynomials of the Form<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"E1\"><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mi>r</mml:mi></mml:msup><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>q</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>/</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>","year":2007,"lang":"lv","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02183615666117088,"gpt":0.2576651709614648,"spread":0.2358290143002939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.01293341,0.003989774,0.001641317,0.003895367,0.007207983,0.009326895,0.01448337,0.008910487,0.8134551],"category_scores_gemma":[0.0114491,0.007725573,0.009361506,0.006549969,0.01092801,0.007496397,0.01053243,0.007724826,0.005531538],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083207,"about_ca_system_score_gemma":0.00727682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004545972,"about_ca_topic_score_gemma":0.003975383,"domain_scores_codex":[0.9573148,0.00252203,0.009373786,0.00699723,0.01381757,0.009974507],"domain_scores_gemma":[0.9635679,0.01063696,0.0113478,0.007166938,0.001441287,0.00583917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004275159,0.001576933,0.00003481948,0.003309763,0.005893833,0.004095671,0.005293716,0.002958441,0.004591886,0.494313,0.4683397,0.005317137],"study_design_scores_gemma":[0.006811781,0.007327941,0.000169438,0.006471542,0.006173073,0.01318164,0.008304548,0.02108493,0.910465,0.005538529,0.007447729,0.007023868],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2646925,0.003731053,0.006193665,0.002974385,0.009405326,0.0001903544,0.001274596,0.0008142894,0.7107238],"genre_scores_gemma":[0.9606906,0.004656337,0.01131397,0.005229423,0.007993363,0.003849437,0.002075486,0.003224862,0.0009665181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9058731,"threshold_uncertainty_score":0.998351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971882628","doi":"10.1142/s0129054111008738","title":"PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Shift register; Computer science; Control theory (sociology); Mathematics; Arithmetic; Artificial intelligence; Telecommunications; Control (management); Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02546006147461441,"gpt":0.2705732151522423,"spread":0.2451131536776279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001099079,0.0001431404,0.0002225742,0.0009972475,0.0001727682,0.0001913826,0.002875426,0.00002593419,0.00006581066],"category_scores_gemma":[0.00005642512,0.0001180669,0.0001636224,0.001038682,0.000877137,0.001641818,0.0002712914,0.0001798908,0.00001832959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006246733,"about_ca_system_score_gemma":0.0004096565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001497839,"about_ca_topic_score_gemma":0.00000276613,"domain_scores_codex":[0.997817,0.00007037669,0.0005946143,0.0002699847,0.001061948,0.0001860213],"domain_scores_gemma":[0.9970114,0.0001872852,0.000815946,0.0004615054,0.001407794,0.0001160535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001487591,0.003214415,0.01182798,0.00004104698,0.001021403,0.0001236522,0.01965379,0.02085465,0.01231087,0.6508986,0.0006130895,0.2779529],"study_design_scores_gemma":[0.01769639,0.02014429,0.2350546,0.004997719,0.0004136412,0.003798533,0.0006461024,0.4811477,0.08293122,0.1373446,0.01247998,0.003345164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1724815,0.00000964542,0.8217026,0.0005425467,0.00117322,0.00006151884,0.000004883959,0.00002072832,0.004003288],"genre_scores_gemma":[0.7764739,0.000003037784,0.22325,0.000121841,0.0001215574,9.836451e-7,0.000001075145,0.000005151732,0.00002239071],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6039924,"threshold_uncertainty_score":0.5343305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966244415","doi":"10.1007/s10623-013-9850-3","title":"ETRU: NTRU over the Eisenstein integers","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"NTRU; Public key cryptosystem; Cryptosystem; Eisenstein integer; Polynomial ring; Mathematics; Public-key cryptography; Discrete mathematics; Polynomial; Computer science; Cryptography; Algorithm; Computer security; Encryption; Algebraic number; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01374569531009495,"gpt":0.2152243456784864,"spread":0.2014786503683914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004372962,0.0002550574,0.0002099578,0.0002817868,0.0004592251,0.0006854261,0.0008981423,0.00008750314,0.0001410859],"category_scores_gemma":[0.00001960744,0.0001684527,0.0002391103,0.001135534,0.0003561104,0.0005067404,0.0002056578,0.0002351155,0.00004511526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006175336,"about_ca_system_score_gemma":0.00001758794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008690308,"about_ca_topic_score_gemma":0.000008604629,"domain_scores_codex":[0.9984038,0.0002016731,0.0002395681,0.0004551745,0.0002607995,0.0004389402],"domain_scores_gemma":[0.9985997,0.0003376523,0.0000897203,0.0007259489,0.00007930183,0.000167648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001008749,0.00005330015,0.004489075,0.0000128664,0.0000873571,0.000005775255,0.0008526506,0.000006086662,0.002507234,0.9101003,0.006251228,0.07562397],"study_design_scores_gemma":[0.00118065,0.0006492014,0.07652598,0.0001062875,0.00008042141,0.00008654466,0.001151365,0.01185288,0.002736765,0.8546193,0.04969428,0.001316344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3294492,0.001240458,0.6590968,0.001576453,0.0003975846,0.0005447243,0.00000447341,0.0004003311,0.007290022],"genre_scores_gemma":[0.9864939,0.0001425884,0.01156048,0.001617511,0.00006542625,0.00007544414,0.000001571487,0.00001451302,0.00002857929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6570447,"threshold_uncertainty_score":0.6869302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136017419","doi":"10.1109/tit.2008.928999","title":"New Binary Sequences With Optimal Autocorrelation Magnitude","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Lakehead University","funders":"","keywords":"Autocorrelation; Binary number; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Statistics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01057295538588483,"gpt":0.2055857470907388,"spread":0.195012791704854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737442,0.0001496274,0.0001021004,0.0003743651,0.0004859533,0.00009607986,0.0003812985,0.00006730023,0.0001770482],"category_scores_gemma":[0.000003115186,0.0001258311,0.00008129076,0.0006272313,0.0000920128,0.003582327,0.000002148243,0.0002115501,0.0003133822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003430778,"about_ca_system_score_gemma":0.0001476985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008583032,"about_ca_topic_score_gemma":0.000001235203,"domain_scores_codex":[0.9990575,0.00008842738,0.0002453411,0.0001414494,0.000284515,0.0001827524],"domain_scores_gemma":[0.9992446,0.0001307746,0.0001063847,0.0003400259,0.00007595957,0.0001022373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005617702,0.0001307446,0.00003415482,0.00002444478,0.00009348946,0.00001401594,0.01318054,0.3098798,0.000146554,0.3621122,0.0006975987,0.3131247],"study_design_scores_gemma":[0.01630786,0.01309298,0.01174991,0.0008786187,0.0004119025,0.004108866,0.005550696,0.5402682,0.1043701,0.2473757,0.04905921,0.006825924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01382987,0.000009085492,0.9803299,0.0001565642,0.0003518215,0.0002095674,0.000004033618,0.0004467668,0.004662373],"genre_scores_gemma":[0.9518054,0.0000172691,0.04725713,0.0003927887,0.00002213173,0.0000417655,0.000003417305,0.000006020753,0.000454135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9379755,"threshold_uncertainty_score":0.5131242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164604678","doi":"10.1109/18.887870","title":"Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"BCH code; Coset; Mathematics; Minimum distance; Reed–Solomon error correction; Discrete mathematics; Dimension (graph theory); Block code; Linear code; Combinatorics; Decoding methods; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.008859276577574706,"gpt":0.2411749162144046,"spread":0.2323156396368299,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165248,0.0001533172,0.0001378956,0.0002624324,0.0004242942,0.0002165225,0.0002715783,0.00005323209,0.00008483485],"category_scores_gemma":[0.00000401931,0.0001345551,0.00005197462,0.0003889473,0.0001548324,0.001161812,0.000004564729,0.000126352,0.00008921057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001488494,"about_ca_system_score_gemma":0.00001863031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005110688,"about_ca_topic_score_gemma":0.00000408468,"domain_scores_codex":[0.9991377,0.00013379,0.0002567276,0.0001995132,0.0001063024,0.0001659505],"domain_scores_gemma":[0.9989977,0.0004039806,0.00005497541,0.0003750217,0.00004629033,0.0001220706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001760031,0.00007940279,0.00001067361,0.00002891109,0.00005552084,2.750235e-7,0.01404293,0.001471786,0.0005335577,0.146751,0.0001393385,0.8367106],"study_design_scores_gemma":[0.004053199,0.001354811,0.003335763,0.0002773785,0.0001278081,0.0003236865,0.01309337,0.0482895,0.1049327,0.7191933,0.1025684,0.002450081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06423735,0.00003454937,0.9306105,0.0003118567,0.00006331057,0.0004188101,0.0000762051,0.0001906172,0.004056765],"genre_scores_gemma":[0.9955326,0.0001300144,0.003046599,0.0008287162,0.00001226106,0.0002391382,0.000005500081,0.000005767583,0.0001993843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9312953,"threshold_uncertainty_score":0.5486998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047782372","doi":"10.1007/s10623-013-9862-z","title":"Compression of periodic complementary sequences and applications","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Lambda; Autocorrelation; Sequence (biology); Mathematics; Compression (physics); Zero (linguistics); Combinatorics; Complementary sequences; Function (biology); Data compression; Discrete mathematics; Algorithm; Physics; Statistics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02061128218749861,"gpt":0.2422285624615389,"spread":0.2216172802740403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001714934,0.0001367612,0.0001827074,0.0002219972,0.0002745464,0.000153165,0.0003447997,0.00003808047,0.00005779343],"category_scores_gemma":[0.000001917235,0.0001151946,0.00006960146,0.0004706958,0.0003565883,0.0003177392,0.0001531605,0.00007234304,0.000002463295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001990291,"about_ca_system_score_gemma":0.00001012488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008520675,"about_ca_topic_score_gemma":0.000003536189,"domain_scores_codex":[0.9990792,0.00008440187,0.0002107109,0.0003007006,0.0001412006,0.0001838038],"domain_scores_gemma":[0.9993241,0.000112435,0.0000918009,0.0002966436,0.00006404681,0.0001109296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009087727,0.0001033035,0.03183376,0.0000832663,0.00006298897,0.000001099527,0.0008515932,0.000005767351,0.01763921,0.828146,0.0005211956,0.1207427],"study_design_scores_gemma":[0.001209388,0.0008491831,0.07963619,0.0001775066,0.00007746648,0.00005714026,0.001637756,0.008122165,0.006014009,0.8833967,0.01792773,0.0008946985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2038655,0.001993569,0.7921452,0.0002485813,0.00003741042,0.0004804617,0.00001127669,0.0001083453,0.001109689],"genre_scores_gemma":[0.9543639,0.0002986823,0.04503243,0.0001637568,0.00001770281,0.0001107781,0.00000532847,0.000004905283,0.000002539895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7504984,"threshold_uncertainty_score":0.46975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120749565","doi":"10.1006/jagm.2001.1158","title":"The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Factorization of polynomials; Factorization; Finite field; Mathematics; Polynomial; Factoring; Degree (music); Square-free polynomial; Algorithm; Singularity; Algebra over a field; Discrete mathematics; Pure mathematics; Matrix polynomial; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01655281649807776,"gpt":0.2534935249891276,"spread":0.2369407084910499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918323,0.0001036288,0.0002806669,0.0004238931,0.0001602783,0.0001219694,0.0007944182,0.00005757519,0.00003262776],"category_scores_gemma":[0.00006287089,0.00006976686,0.0004138576,0.001692645,0.00006356995,0.0003330021,0.00008751934,0.0001941563,0.000001332384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086401,"about_ca_system_score_gemma":0.0000473248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001639207,"about_ca_topic_score_gemma":0.000007258716,"domain_scores_codex":[0.9986774,0.0001176188,0.0005016018,0.0001178031,0.0004064681,0.0001790749],"domain_scores_gemma":[0.9983333,0.0005100447,0.0005285605,0.0003127037,0.0002370908,0.0000783486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001228965,0.0002395262,0.006183843,0.000005952606,0.002750834,0.00008201048,0.002592527,0.00502943,0.0005692161,0.008521521,0.00138925,0.972513],"study_design_scores_gemma":[0.001316895,0.000936724,0.05671414,0.00004287834,0.0007449673,0.00009657707,0.0001959471,0.8808863,0.000575382,0.01191567,0.04620917,0.0003653511],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01533741,0.0002147984,0.9831149,0.0003974642,0.0007045641,0.00003659398,0.000006839436,0.00001271066,0.0001747392],"genre_scores_gemma":[0.9477864,0.0004061055,0.05099386,0.0002142044,0.0004736155,0.000001315123,0.000002750573,0.000008842441,0.0001129399],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9721476,"threshold_uncertainty_score":0.284501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092375161","doi":"10.1006/jcta.2001.3218","title":"New Maximal Arcs in Desarguesian Planes","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Conic section; Combinatorics; Arc (geometry); Mathematics; Projective plane; Order (exchange); Enumeration; Construct (python library); Discrete mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01182471589915402,"gpt":0.2068238645874503,"spread":0.1949991486882962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070246,0.0001536267,0.0003012656,0.0002999133,0.00008330233,0.0001615882,0.001035763,0.00007943259,0.0002152646],"category_scores_gemma":[0.0001212695,0.0001331632,0.0001600881,0.0005279921,0.00006636297,0.001012214,0.0001110354,0.0003185526,0.00001405029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000327831,"about_ca_system_score_gemma":0.00005290651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000275542,"about_ca_topic_score_gemma":0.00000148313,"domain_scores_codex":[0.9985253,0.0002965842,0.0004518703,0.0001447287,0.0003154534,0.0002660804],"domain_scores_gemma":[0.998966,0.0002368164,0.0002669508,0.0002908272,0.00007576458,0.0001636211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003335417,0.00009813013,0.0003171687,0.000005692247,0.0000248541,0.000162575,0.001281003,0.00001077546,0.0001602597,0.9791731,0.001187492,0.01724538],"study_design_scores_gemma":[0.001217336,0.0007449141,0.0003849751,0.00005509354,0.000008635869,0.0003590325,0.0001162965,0.00004402752,0.0008639219,0.9714207,0.02462185,0.0001632414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6081155,0.00705732,0.2765197,0.00817665,0.04711641,0.0006391648,0.000005585362,0.000414599,0.05195513],"genre_scores_gemma":[0.9914199,0.00009385213,0.007412302,0.0001107533,0.0006848607,9.914216e-7,1.513121e-7,0.00001073251,0.0002664388],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3833044,"threshold_uncertainty_score":0.5430239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028982966","doi":"10.1090/s0025-5718-2012-02625-1","title":"Squaring in cyclotomic subgroups","year":2012,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Mathematics; Multiplicative group; Exponent; Computation; Pairing; Multiplicative function; Arithmetic; Discrete mathematics; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01687242764727304,"gpt":0.2551459051146664,"spread":0.2382734774673934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166944,0.00006173936,0.000114267,0.0001717147,0.00002234284,0.00002281793,0.0002284094,0.00002514354,0.000002757057],"category_scores_gemma":[0.00002204746,0.00006170766,0.00003967426,0.0003143589,0.00001702817,0.0003262278,0.00007013509,0.00004889237,0.00001328119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001319975,"about_ca_system_score_gemma":0.00000678979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002963958,"about_ca_topic_score_gemma":9.198795e-7,"domain_scores_codex":[0.9993988,0.00003247915,0.0002245061,0.00007593597,0.0001270486,0.0001411917],"domain_scores_gemma":[0.9995157,0.0001700147,0.0001035748,0.0001577472,0.00002314806,0.00002979989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002455771,0.0002653865,0.005156086,0.0001052216,0.000006904859,5.475359e-7,0.007472903,0.001642075,0.001259737,0.9708428,0.0000189611,0.01322689],"study_design_scores_gemma":[0.000350624,0.0000475813,0.02205351,0.0001062855,0.000006172094,0.00001090578,0.0001855027,0.3318522,0.004283464,0.6408924,0.00003042737,0.0001809136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4691582,0.00002869739,0.5293822,0.00001808915,0.00006994913,0.00005022392,9.432345e-8,0.00003428599,0.001258303],"genre_scores_gemma":[0.8727107,0.000001030086,0.1272506,0.0000118674,0.00001458772,0.000003654042,5.695891e-7,0.000003839998,0.000003123297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4035525,"threshold_uncertainty_score":0.2516365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W45261477","doi":"10.1007/s10623-014-0006-x","title":"More constructions of differentially 4-uniform permutations on $${\\mathbb {F}}_{2^{2k}}$$ F 2 2 k","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Boolean function; Stream cipher; Substitution (logic); Mathematics; Block cipher; Class (philosophy); Combinatorics; Discrete mathematics; Type (biology); Block (permutation group theory); Computer science; Algorithm; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01515496332052796,"gpt":0.2352172507737953,"spread":0.2200622874532674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002281067,0.0002259312,0.0002810618,0.0005489844,0.000370141,0.0001446205,0.000484097,0.00008569346,0.00002867328],"category_scores_gemma":[0.00002749229,0.0002000974,0.0002382373,0.0008454056,0.0004007371,0.0002232002,0.00009032301,0.0001478827,0.000004629886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004817429,"about_ca_system_score_gemma":0.00002280538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001012294,"about_ca_topic_score_gemma":0.000006305783,"domain_scores_codex":[0.9986306,0.0001278381,0.0003067148,0.0003948069,0.0002582774,0.0002817083],"domain_scores_gemma":[0.9987497,0.0002948807,0.0001455951,0.0005493526,0.0001130378,0.0001474038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001858282,0.0001110088,0.001544452,0.00002492077,0.00005870753,0.000001178369,0.0006689348,0.00004471576,0.002948781,0.9706953,0.0001162456,0.02376722],"study_design_scores_gemma":[0.002073145,0.00199791,0.05238198,0.0002366445,0.0001890259,0.00009782224,0.001037599,0.01959573,0.0097317,0.9046546,0.006768982,0.001234821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2251569,0.00006463238,0.7699369,0.000214729,0.0001672195,0.0001459834,0.00001761052,0.0001665626,0.004129473],"genre_scores_gemma":[0.9656124,0.00005501386,0.03403173,0.0002067268,0.00003953243,0.00002568488,0.000007941887,0.00001200482,0.000009022745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7404554,"threshold_uncertainty_score":0.8159735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154926368","doi":"10.1016/j.disc.2008.12.027","title":"Error-correcting codes from permutation groups","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Engineering and Physical Sciences Research Council; Government of the United Kingdom; GCHQ","keywords":"Mathematics; Conjecture; Permutation (music); Permutation group; Permutation graph; Combinatorics; Symmetric group; Discrete mathematics; Decoding methods; Construct (python library); Partial permutation; Cyclic permutation; Graph; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01787885720311226,"gpt":0.2609267653700013,"spread":0.243047908166889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002690904,0.0001326985,0.0001602665,0.00007210136,0.0001589749,0.0001984519,0.0005100868,0.00005030017,0.00002618611],"category_scores_gemma":[0.00007698234,0.000116734,0.00008705215,0.000272305,0.00002538037,0.0003223862,0.00006065529,0.0001177607,0.0000521023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001345452,"about_ca_system_score_gemma":0.00001026003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000552788,"about_ca_topic_score_gemma":0.000003152682,"domain_scores_codex":[0.9991038,0.00004754114,0.0002198093,0.0002315,0.0002045932,0.0001927568],"domain_scores_gemma":[0.9991408,0.0002208045,0.0001142988,0.0004343844,0.00003151676,0.00005820095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005277494,0.00009995649,0.0001629275,0.00001783443,0.00002349652,0.00001049767,0.01751512,0.00008386761,0.001737454,0.9375001,0.0002256982,0.04261777],"study_design_scores_gemma":[0.0001656973,0.0000855701,0.001098408,0.00007546008,0.00001917834,0.00001364607,0.001116462,0.09442765,0.002178541,0.9004359,0.0001337575,0.000249744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.262204,0.00003899294,0.7317008,0.000338763,0.0001577262,0.0000787255,0.000004140067,0.0002643158,0.005212522],"genre_scores_gemma":[0.9041493,0.000003347273,0.09548569,0.0002438194,0.00006013401,0.000003796566,0.00001026234,0.000006588976,0.00003704717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6419453,"threshold_uncertainty_score":0.4760275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}