{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Claude Carlet","is_ca":false},{"name":"Deepak Kumar Dalai","is_ca":false},{"name":"K.C. Gupta","is_ca":true},{"name":"Subhamoy Maitra","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000783768,0.0004325665,0.0003820413,0.001131459,0.0006406954,0.001309413,0.0005540667,0.0005843689,0.001900744],"category_scores_gemma":[0.003748247,0.0002535467,0.0008633638,0.0006509883,0.002455505,0.001979657,0.001616602,0.001565004,0.000427491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008465948,"about_ca_system_score_gemma":0.0003544413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001310995,"about_ca_topic_score_gemma":0.0001097488,"domain_scores_codex":[0.9992643,0.0001613727,0.00004679786,0.00009923959,0.0003065459,0.00012174],"domain_scores_gemma":[0.9980041,0.00115216,0.0002287022,0.0003482599,0.0001793003,0.00008754262],"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.0001107249,0.00006068531,0.00207303,0.000120862,0.00002233923,0.0001402481,0.0002967662,0.02093525,0.02186522,0.9212444,0.0006949094,0.03243548],"study_design_scores_gemma":[0.00003283626,0.0002603071,0.002259564,0.00005153149,0.0000762995,0.001208681,0.0001259029,0.2829967,0.06348609,0.6390426,0.01040035,0.00005900209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3320357,0.0004580657,0.6471997,0.0007459612,0.00004870921,0.0001017663,0.0001186211,0.0003781898,0.01891323],"genre_scores_gemma":[0.9254522,0.0004321377,0.07010528,0.0001059545,0.00009406562,0.00009754403,0.0001419068,0.00006183292,0.003509073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001900744,"threshold_uncertainty_score":0.006358564,"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","authors":[{"name":"Amir Akbary","is_ca":true},{"name":"Dragos Ghioca","is_ca":true},{"name":"Qiang Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511565,0.0009991575,0.001081665,0.00221204,0.002480334,0.00329123,0.001248848,0.00155152,0.004599545],"category_scores_gemma":[0.006610682,0.0008464919,0.001557834,0.003013405,0.005858553,0.008475043,0.003682749,0.003364596,0.0009659856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001530374,"about_ca_system_score_gemma":0.001137207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009119874,"about_ca_topic_score_gemma":0.001179791,"domain_scores_codex":[0.9984701,0.0007456072,0.00008673756,0.000157052,0.0002898914,0.0002505234],"domain_scores_gemma":[0.9963635,0.002439549,0.0001706184,0.0006507236,0.0001982856,0.0001774933],"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.00002862393,0.00001948372,0.0001578824,0.00003497061,0.000004067646,0.00004904425,0.0002946081,0.00153412,0.000464012,0.9832008,0.0008188097,0.01339379],"study_design_scores_gemma":[0.000007706899,0.00001071484,0.00003852392,0.00001780373,0.000003937501,0.00004638751,0.00006083397,0.00276751,0.0005425841,0.9927737,0.003720718,0.000009581354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1929219,0.002779435,0.7060495,0.003316068,0.0008536288,0.0001682688,0.0002259468,0.0008479168,0.09283743],"genre_scores_gemma":[0.7151598,0.003397596,0.2451717,0.0008450731,0.0006137721,0.0001915037,0.0004999025,0.0005489072,0.03357178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004599545,"threshold_uncertainty_score":0.015387,"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","authors":[{"name":"Gary L. Mullen","is_ca":true},{"name":"Daniel Panario","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218141,0.001157559,0.001034865,0.004408259,0.001461487,0.003879338,0.00112798,0.0009830372,0.1331255],"category_scores_gemma":[0.002783674,0.0005937458,0.0004439476,0.005062174,0.00116184,0.005195629,0.001526076,0.002994242,0.08916902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001726616,"about_ca_system_score_gemma":0.002240109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001320757,"about_ca_topic_score_gemma":0.002590027,"domain_scores_codex":[0.9991782,0.0001043809,0.00005206825,0.000132417,0.0004747743,0.00005811758],"domain_scores_gemma":[0.9988471,0.0004926875,0.00005996446,0.0001658384,0.0003336355,0.0001007264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001766587,0.00003558805,0.00009132385,0.000554281,0.000006057258,0.00006871649,0.0004329185,0.0003821332,0.0008139207,0.1296725,0.5852285,0.2826964],"study_design_scores_gemma":[9.629704e-7,0.000004792076,0.00006970332,0.0001513378,9.374169e-7,0.0001195679,0.00002094802,0.00004516172,0.00006206972,0.01018703,0.989334,0.000003414925],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0009380276,0.1124024,0.02311261,0.004172522,0.005382236,0.0001151542,0.002502285,0.00183223,0.8495425],"genre_scores_gemma":[0.00863509,0.07690389,0.02234279,0.0024116,0.003115451,0.000184683,0.003842949,0.001228361,0.8813351],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1331255,"threshold_uncertainty_score":0.445349,"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","authors":[{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401726,0.0006999669,0.0004532702,0.0007167035,0.0006640314,0.0005384705,0.0007888171,0.0004727927,0.002847729],"category_scores_gemma":[0.002126804,0.0002931489,0.0003517317,0.0008088971,0.0004952533,0.001270037,0.0007112192,0.0006534592,0.0008709224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006748462,"about_ca_system_score_gemma":0.0004236868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002887914,"about_ca_topic_score_gemma":0.0005532609,"domain_scores_codex":[0.9993194,0.0001783148,0.00007660278,0.0001180785,0.0002179477,0.00008957805],"domain_scores_gemma":[0.9987192,0.0004032693,0.0002654948,0.0002235492,0.0003216552,0.00006684167],"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.001921353,0.0002257342,0.002061558,0.000685561,0.0001259975,0.0009414532,0.0005813222,0.03758866,0.2124125,0.1442374,0.006812376,0.5924061],"study_design_scores_gemma":[0.0006858656,0.004279216,0.00315843,0.000453331,0.0003173507,0.005955861,0.0003133649,0.3491038,0.3913013,0.1341872,0.110011,0.0002333873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1046345,0.001440117,0.8846711,0.0003026107,0.0001585322,0.0001791296,0.0001997898,0.0009777433,0.007436494],"genre_scores_gemma":[0.5475333,0.0008703836,0.4440228,0.0003197782,0.0002769379,0.0005665596,0.0005701118,0.000114948,0.005725141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002847729,"threshold_uncertainty_score":0.00952661,"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","authors":[{"name":"P. B. Borwein","is_ca":true},{"name":"Ron Ferguson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140147,0.002891835,0.001455981,0.003734585,0.002329588,0.004044786,0.002520656,0.001606989,0.08632122],"category_scores_gemma":[0.005483904,0.001253025,0.002309796,0.005611766,0.001678762,0.00615616,0.002720505,0.004333007,0.1027602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001747652,"about_ca_system_score_gemma":0.001370489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002407804,"about_ca_topic_score_gemma":0.002228324,"domain_scores_codex":[0.9977868,0.0003986665,0.0002494813,0.0004251362,0.0009170497,0.000222929],"domain_scores_gemma":[0.9990532,0.0002822736,0.00006061944,0.0002221927,0.0003345172,0.00004721398],"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.0001192956,0.00006942317,0.0001652664,0.0007030015,0.00003850588,0.0003263008,0.0002972995,0.001882219,0.003640087,0.6369852,0.1673477,0.1884258],"study_design_scores_gemma":[0.00002098164,0.00005038165,0.0001441906,0.000121308,0.000009721163,0.0006567814,0.0000579609,0.002181482,0.002380157,0.2859841,0.7083148,0.000078084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002688526,0.02152022,0.6661278,0.003022598,0.004243174,0.0004008321,0.006803317,0.01167222,0.2835213],"genre_scores_gemma":[0.08028163,0.02333088,0.6312187,0.008224489,0.003877051,0.002163721,0.01580966,0.01898364,0.2161103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.08632122,"threshold_uncertainty_score":0.2887732,"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","authors":[{"name":"Michael Luby","is_ca":true},{"name":"Charles Rackoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051532,0.001084987,0.0008485456,0.001175573,0.0009409178,0.002112309,0.0009187646,0.001389381,0.008572905],"category_scores_gemma":[0.005243573,0.0007914621,0.001442845,0.001093769,0.001515709,0.004387054,0.002667808,0.002756767,0.005380264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005293256,"about_ca_system_score_gemma":0.0006628771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002373808,"about_ca_topic_score_gemma":0.0003302185,"domain_scores_codex":[0.9986863,0.0003569719,0.00007446901,0.0001756661,0.0006103858,0.00009622422],"domain_scores_gemma":[0.998604,0.0006069557,0.00006007159,0.0004901342,0.0001823227,0.0000564315],"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.00005974,0.00004058519,0.0002320015,0.0002421878,0.00004424407,0.0001758772,0.0001806865,0.007648441,0.006506555,0.8305842,0.007970756,0.1463147],"study_design_scores_gemma":[0.00002750214,0.00002952497,0.0001209265,0.00007057765,0.00002936273,0.0005235229,0.00004196209,0.02883227,0.01294426,0.9168162,0.04052074,0.00004317845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005550616,0.000266239,0.977768,0.0005935268,0.0003009692,0.0001295355,0.0001510953,0.00106458,0.0141755],"genre_scores_gemma":[0.1255109,0.001135107,0.8439023,0.0006259852,0.000216257,0.0004162703,0.0006369735,0.001356045,0.02620007],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008572905,"threshold_uncertainty_score":0.02867925,"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","authors":[{"name":"Haining Fan","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004564932,0.0009351341,0.0004761724,0.0009960172,0.0007157152,0.001221195,0.001233893,0.0003867324,0.008535557],"category_scores_gemma":[0.001095328,0.0003624586,0.0005601734,0.001286363,0.0005598139,0.002036393,0.001018876,0.001161825,0.002452543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008109821,"about_ca_system_score_gemma":0.001085307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005356963,"about_ca_topic_score_gemma":0.00132427,"domain_scores_codex":[0.9995473,0.00009910783,0.00004510212,0.00008517677,0.0001748908,0.00004830646],"domain_scores_gemma":[0.9995627,0.0001042756,0.00005366717,0.0001263413,0.0001297909,0.00002326468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004063247,0.0001828625,0.0003105525,0.0003348473,0.00006068091,0.0001548216,0.0002127113,0.02704395,0.08186843,0.4021382,0.008117145,0.4791693],"study_design_scores_gemma":[0.0002881013,0.00134325,0.0003939867,0.0001031723,0.0001398705,0.001104158,0.000103992,0.4922515,0.1655496,0.2228166,0.115778,0.0001277278],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01009848,0.0002901093,0.9795101,0.0001378689,0.0001120351,0.000110862,0.00005524692,0.000651601,0.009033665],"genre_scores_gemma":[0.1235944,0.0005314335,0.8643678,0.0001864523,0.0001565819,0.0002861182,0.0001845495,0.0001151635,0.0105775],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008535557,"threshold_uncertainty_score":0.02855432,"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","authors":[{"name":"Magliveras","is_ca":false},{"name":"Stinson","is_ca":true},{"name":"Tran van Trung","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437744,0.00129364,0.001199504,0.001934309,0.001862719,0.003533844,0.002655425,0.002034623,0.00370141],"category_scores_gemma":[0.006253029,0.001418343,0.001896284,0.001346898,0.006040527,0.0156843,0.003629432,0.005031402,0.001251032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428661,"about_ca_system_score_gemma":0.0009385778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002117783,"about_ca_topic_score_gemma":0.0005227661,"domain_scores_codex":[0.9974929,0.0007436127,0.0001986699,0.0003544282,0.000977342,0.0002329912],"domain_scores_gemma":[0.9949705,0.002495685,0.0002720989,0.001685492,0.0004327336,0.0001435334],"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.0001639909,0.0001285217,0.0002615968,0.0003186417,0.00005452825,0.00008976455,0.0005782322,0.01535718,0.009886484,0.9112817,0.001332883,0.06054651],"study_design_scores_gemma":[0.0001113826,0.0001430025,0.00005377275,0.00007805124,0.00009284863,0.0002456086,0.0001262865,0.1079869,0.01757189,0.8602276,0.01329622,0.00006646765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234272,0.0004335371,0.982115,0.0005190846,0.00009197449,0.00007771672,0.00001774821,0.000437717,0.003964404],"genre_scores_gemma":[0.2247552,0.001017442,0.7665882,0.0004024907,0.0002245037,0.0003136556,0.00006803781,0.0002956816,0.006334623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00370141,"threshold_uncertainty_score":0.01818073,"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","authors":[{"name":"Joachim von zur Gathen","is_ca":false},{"name":"Daniel Panario","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002463404,0.001091823,0.001766276,0.003426414,0.0008313424,0.002810115,0.001550883,0.00118974,0.004365355],"category_scores_gemma":[0.005589718,0.0009484528,0.001073494,0.00676102,0.002132029,0.01137678,0.002089713,0.002158538,0.001793831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001090704,"about_ca_system_score_gemma":0.00130814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007888096,"about_ca_topic_score_gemma":0.0007378345,"domain_scores_codex":[0.9985341,0.0002719901,0.0001297279,0.000346711,0.0005225082,0.0001948765],"domain_scores_gemma":[0.9965917,0.0020784,0.000201099,0.000697277,0.0003277153,0.0001038111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001528277,0.0001408386,0.001874347,0.002052854,0.00004684358,0.00008436051,0.0003050102,0.00573962,0.001888597,0.2032107,0.008174085,0.7763301],"study_design_scores_gemma":[0.0001145309,0.0004394403,0.001869493,0.001665639,0.00008726791,0.002875074,0.0004020697,0.03027548,0.00825587,0.6770169,0.2768967,0.000101449],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.04060199,0.602387,0.3161567,0.003132272,0.0006356542,0.0001455729,0.0003634045,0.0008870501,0.03569032],"genre_scores_gemma":[0.2085782,0.6179414,0.1609351,0.0009254709,0.002958576,0.0001003159,0.001068146,0.0002837406,0.007209074],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004365355,"threshold_uncertainty_score":0.01460356,"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","authors":[{"name":"Kai-Uwe Schmidt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678508,0.0004287037,0.0002699008,0.0007627454,0.0007483175,0.001257209,0.0005015545,0.0009309896,0.004283044],"category_scores_gemma":[0.002847797,0.0001826294,0.0002963408,0.00143156,0.0008086074,0.0009325373,0.0007667965,0.001092562,0.001819081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009287547,"about_ca_system_score_gemma":0.001070417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001593127,"about_ca_topic_score_gemma":0.001961693,"domain_scores_codex":[0.9992573,0.0001891483,0.00004466474,0.0001119367,0.0003234707,0.0000735557],"domain_scores_gemma":[0.9988979,0.0002923457,0.0001295854,0.0002056511,0.0004176631,0.00005689463],"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.0003078562,0.00008597023,0.0006077079,0.0003343539,0.00001959218,0.0003387903,0.0003818657,0.03843927,0.03959654,0.6526041,0.01653866,0.2507453],"study_design_scores_gemma":[0.00009121106,0.0005285286,0.001023457,0.000346272,0.00005439822,0.00153956,0.0001347098,0.4254012,0.05774272,0.2340076,0.2789601,0.0001700907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02901862,0.005396477,0.9226947,0.001071073,0.001638626,0.0001667177,0.0003278676,0.0007630317,0.03892281],"genre_scores_gemma":[0.5073515,0.006247634,0.4439849,0.001285764,0.00155047,0.000392119,0.0009678144,0.0002774009,0.03794242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004283044,"threshold_uncertainty_score":0.01432818,"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","authors":[{"name":"M. H. Dawson","is_ca":true},{"name":"S.E. Tavares","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003922635,0.001118759,0.001799093,0.003591036,0.001123988,0.004110843,0.001169782,0.002130851,0.004575797],"category_scores_gemma":[0.01155491,0.0004760022,0.001113129,0.002219933,0.002920446,0.004236923,0.001891672,0.001809657,0.000919258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001412135,"about_ca_system_score_gemma":0.00105872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002614036,"about_ca_topic_score_gemma":0.0002873977,"domain_scores_codex":[0.9959283,0.001354087,0.0003398989,0.0004975141,0.001638427,0.0002416993],"domain_scores_gemma":[0.9903479,0.005444778,0.0008767808,0.001208869,0.001830524,0.0002911685],"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.0001279626,0.00004705822,0.0004452547,0.0002009469,0.00002842929,0.0001130812,0.0001162613,0.02057297,0.006946879,0.9172541,0.002203289,0.05194376],"study_design_scores_gemma":[0.00004467757,0.000264314,0.0002929481,0.0001181845,0.00003958802,0.0003419009,0.00005359172,0.1509701,0.006349791,0.8329679,0.008504556,0.00005240072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03903657,0.0009155512,0.9082797,0.0007270277,0.0001509236,0.000201452,0.0001574315,0.0003743366,0.05015705],"genre_scores_gemma":[0.6323836,0.0008988115,0.3537608,0.0004510823,0.0003100305,0.0003354336,0.0001927551,0.0001739444,0.01149344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004575797,"threshold_uncertainty_score":0.02074516,"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","authors":[{"name":"Gary L. Mullen","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498676,0.00098467,0.0005303528,0.001156303,0.000706517,0.00167705,0.0005321081,0.0004196305,0.03117198],"category_scores_gemma":[0.0007908341,0.000349328,0.0003968492,0.00180605,0.001433555,0.00282081,0.001035591,0.002247612,0.01142346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001677242,"about_ca_system_score_gemma":0.001142703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00125385,"about_ca_topic_score_gemma":0.001624617,"domain_scores_codex":[0.9997322,0.00003931735,0.00001199339,0.00003078967,0.0001605473,0.00002509289],"domain_scores_gemma":[0.9998316,0.00006158608,0.00001242691,0.00003393311,0.00004275551,0.00001771799],"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.00001064131,0.00002663532,0.00008376169,0.0001542005,0.000006891195,0.00003528142,0.0002114509,0.001047808,0.0006174478,0.7672002,0.1171025,0.1135033],"study_design_scores_gemma":[0.000009647176,0.00001036352,0.0001311968,0.000107757,0.000006898346,0.0001070977,0.00003965006,0.001406806,0.0005046659,0.4766056,0.5210611,0.000009304534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.004171926,0.01604531,0.026693,0.003266782,0.002297529,0.00005096908,0.0004327528,0.0002396433,0.946802],"genre_scores_gemma":[0.05357323,0.02389481,0.01152048,0.001002439,0.002548547,0.00009979647,0.0009548278,0.0002838029,0.906122],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03117198,"threshold_uncertainty_score":0.1042807,"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","authors":[{"name":"Carlisle Adams","is_ca":true},{"name":"S.E. Tavares","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007602162,0.001616595,0.001437387,0.002006599,0.001417237,0.003082309,0.000694598,0.001599803,0.04909573],"category_scores_gemma":[0.003091051,0.0009196913,0.0007329712,0.001964164,0.00290413,0.00758217,0.002646093,0.002053849,0.02961535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005919859,"about_ca_system_score_gemma":0.0004954797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001426671,"about_ca_topic_score_gemma":0.0002294535,"domain_scores_codex":[0.9994294,0.0001317014,0.00003287663,0.0001253107,0.0002020956,0.0000786302],"domain_scores_gemma":[0.9989742,0.0004328902,0.00009215609,0.0002670544,0.0001602671,0.00007342295],"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.00008191472,0.00002179177,0.00008758197,0.0003283198,0.00001808729,0.00007018656,0.0001660753,0.0008734505,0.002026935,0.8892236,0.03230693,0.0747952],"study_design_scores_gemma":[0.00002772578,0.00003757951,0.00008221351,0.0001606059,0.00001740325,0.00032114,0.00008606359,0.0008967737,0.002732883,0.811836,0.1837723,0.00002939461],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.03301976,0.008491172,0.3069089,0.004029685,0.002070888,0.0002533021,0.001433006,0.003683309,0.64011],"genre_scores_gemma":[0.2292803,0.01021609,0.2866579,0.001651367,0.0009616842,0.0004436001,0.001291191,0.003742835,0.465755],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.04909573,"threshold_uncertainty_score":0.1642416,"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","authors":[{"name":"Andreas Klappenecker","is_ca":false},{"name":"Martin Roetteler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167604,0.0005892504,0.0008607121,0.001830011,0.001588779,0.001955748,0.0009322487,0.0009723828,0.00305696],"category_scores_gemma":[0.01025745,0.0008872278,0.000507303,0.001343022,0.001429553,0.002089034,0.005216492,0.001826402,0.0009344287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004801331,"about_ca_system_score_gemma":0.0005369096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001207248,"about_ca_topic_score_gemma":0.0001574843,"domain_scores_codex":[0.9965867,0.001218197,0.0002096772,0.0004471965,0.001006698,0.0005315341],"domain_scores_gemma":[0.9942822,0.00224727,0.0006827037,0.001398589,0.001001339,0.0003878675],"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.0001539256,0.00003888361,0.001414042,0.00007185563,0.00003095386,0.0001835797,0.0003384999,0.006183236,0.0122351,0.9413934,0.001690793,0.03626583],"study_design_scores_gemma":[0.00005276455,0.0001558276,0.001106537,0.0001158567,0.00005960646,0.0009969831,0.0003092601,0.07721002,0.03739035,0.8636976,0.01881549,0.00008967835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1596521,0.0006732813,0.8127049,0.0004531369,0.0001421363,0.0001017981,0.0003532869,0.0003964312,0.02552281],"genre_scores_gemma":[0.711443,0.0005208952,0.2800971,0.0003395786,0.0001428777,0.0003722403,0.0005860516,0.0001618206,0.006336379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00305696,"threshold_uncertainty_score":0.01146346,"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","authors":[{"name":"Nam Yul Yu","is_ca":true},{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003912214,0.0006050218,0.0004681991,0.0008608113,0.0009379471,0.001453281,0.0006100298,0.0004957294,0.004137028],"category_scores_gemma":[0.001379678,0.0003776118,0.0006770965,0.00115003,0.0009357941,0.001539296,0.00101663,0.001408091,0.00141478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005828722,"about_ca_system_score_gemma":0.0004378143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003281973,"about_ca_topic_score_gemma":0.000586497,"domain_scores_codex":[0.9994313,0.0001639466,0.00003651382,0.00008331611,0.0001697327,0.0001151168],"domain_scores_gemma":[0.9993904,0.0001933323,0.00006346322,0.0001353865,0.0001637488,0.00005368996],"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.000297458,0.0001039402,0.0009521378,0.0002845635,0.00002739408,0.00047614,0.001171355,0.01054144,0.04390226,0.8128166,0.002995239,0.1264315],"study_design_scores_gemma":[0.00007254416,0.0006276608,0.001702574,0.0001499762,0.00006714762,0.003105948,0.000745247,0.08503699,0.08304962,0.7341127,0.09116835,0.0001612017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2798351,0.0005995157,0.6498947,0.0004552058,0.0002191467,0.0001807235,0.0002968156,0.0005706033,0.06794822],"genre_scores_gemma":[0.6786042,0.0007568069,0.2907777,0.0002569259,0.0001020553,0.0001447414,0.0004979672,0.0002748768,0.02858463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004137028,"threshold_uncertainty_score":0.01383978,"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","authors":[{"name":"Amr Youssef","is_ca":true},{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002486275,0.0007573745,0.0004493636,0.001618436,0.0007229377,0.001739066,0.0004832257,0.0005173913,0.01939107],"category_scores_gemma":[0.0007009175,0.0003382981,0.0003786859,0.001584855,0.001039026,0.001924737,0.001143422,0.002401819,0.008142496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000602311,"about_ca_system_score_gemma":0.0002940808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001691456,"about_ca_topic_score_gemma":0.0002314848,"domain_scores_codex":[0.9997708,0.00003982673,0.00001097231,0.00003673443,0.0001067416,0.00003488682],"domain_scores_gemma":[0.9997589,0.00005316306,0.00002073648,0.00005819607,0.00006449254,0.00004448451],"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.00002920062,0.00001534471,0.00006325382,0.00005451978,0.000006305359,0.00003650666,0.0000804665,0.0005214001,0.00332665,0.9179649,0.007985546,0.06991579],"study_design_scores_gemma":[0.00001011887,0.00003791367,0.0002672175,0.00004320143,0.00001307453,0.0004044681,0.00006040887,0.00357655,0.004139124,0.9054085,0.08601955,0.00002002106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05504052,0.003794787,0.1909903,0.001611928,0.001312502,0.00005600418,0.0004314614,0.0006391723,0.7461235],"genre_scores_gemma":[0.4062447,0.005696896,0.06680337,0.001083512,0.0009683144,0.0001297713,0.0006488286,0.0008590895,0.5175655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01939107,"threshold_uncertainty_score":0.06486964,"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","authors":[{"name":"Shuhong Gao","is_ca":false},{"name":"Joachim von zur Gathen","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"Victor Shoup","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713753,0.001391443,0.001464451,0.001957739,0.001725692,0.005716676,0.002421941,0.001900983,0.01274302],"category_scores_gemma":[0.01462632,0.001003711,0.001430533,0.003182033,0.002703309,0.01409723,0.004248234,0.004528051,0.003847548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002237665,"about_ca_system_score_gemma":0.002327973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0011114,"about_ca_topic_score_gemma":0.001587768,"domain_scores_codex":[0.9969487,0.00075591,0.0003893797,0.0005779119,0.0008590021,0.000469152],"domain_scores_gemma":[0.9875231,0.007711784,0.0004229738,0.003042658,0.00103439,0.0002649972],"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.001001727,0.0002543817,0.001585775,0.0004721462,0.0000977207,0.0001319824,0.0005888465,0.03045342,0.003535858,0.5754663,0.01608353,0.3703284],"study_design_scores_gemma":[0.0002019587,0.00006761234,0.0001758666,0.00009739222,0.0000497839,0.0001542406,0.0001272978,0.08162166,0.005555657,0.9024653,0.009448396,0.0000348819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04139198,0.001704735,0.9355712,0.00186659,0.0003654719,0.0001851261,0.0005267707,0.003491284,0.01489691],"genre_scores_gemma":[0.460257,0.001334755,0.5210101,0.0005770779,0.0004071412,0.0002882289,0.001316837,0.0008080069,0.01400072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01274302,"threshold_uncertainty_score":0.04262966,"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","authors":[{"name":"Troy Vasiga","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360723,0.0005960405,0.0006896835,0.001004064,0.001504456,0.002345107,0.0007340609,0.0009814668,0.006581309],"category_scores_gemma":[0.005820748,0.0003252485,0.0008013998,0.0009774049,0.002629788,0.003119377,0.001875646,0.001835916,0.001102199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030384,"about_ca_system_score_gemma":0.0009559314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009523142,"about_ca_topic_score_gemma":0.0008404881,"domain_scores_codex":[0.9982483,0.0005183379,0.00007079125,0.0001965355,0.0004919223,0.0004740923],"domain_scores_gemma":[0.9967528,0.001958261,0.0003290016,0.0003215084,0.0003892955,0.0002491201],"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.0004552948,0.00008264661,0.0009423079,0.00005545203,0.00001700221,0.0002372559,0.0007144945,0.01526197,0.003699431,0.9627178,0.001488919,0.01432748],"study_design_scores_gemma":[0.0000674877,0.0001676412,0.0005160148,0.00003760891,0.00001677486,0.000301713,0.0001836647,0.1201689,0.009579275,0.8647522,0.004163542,0.00004510591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5911467,0.0004230949,0.3013074,0.001068891,0.0002367328,0.0001657918,0.0002008972,0.0004539999,0.1049964],"genre_scores_gemma":[0.931466,0.000344297,0.0397635,0.0001720632,0.000227779,0.0001339511,0.0002600787,0.0001928903,0.02743941],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006581309,"threshold_uncertainty_score":0.02201664,"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","authors":[{"name":"Peter Borwein","is_ca":true},{"name":"Roger Ferguson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667087,0.0006205823,0.0005886562,0.001674017,0.001006387,0.001719332,0.0005291437,0.0007850163,0.005551686],"category_scores_gemma":[0.005797412,0.000266109,0.000474597,0.002144411,0.001511441,0.002259316,0.0007419169,0.001090622,0.002946975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004447297,"about_ca_system_score_gemma":0.0005256211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002916519,"about_ca_topic_score_gemma":0.0003199565,"domain_scores_codex":[0.9991475,0.0001259053,0.00007678034,0.0002184735,0.000335872,0.00009539142],"domain_scores_gemma":[0.9975231,0.001074438,0.0003775362,0.0004687225,0.0004609867,0.00009508722],"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.000358444,0.00006429759,0.002253814,0.0004522604,0.00003223603,0.0007247725,0.0005337877,0.01782326,0.08100303,0.5115722,0.005694531,0.3794873],"study_design_scores_gemma":[0.00007118573,0.0004063511,0.004294169,0.0002254516,0.00007783451,0.00416129,0.0003420322,0.1541097,0.1523257,0.5683553,0.1154496,0.0001813421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06007471,0.002006309,0.9183702,0.0004062955,0.0002092647,0.0001045491,0.0004631909,0.001146431,0.01721899],"genre_scores_gemma":[0.344537,0.001396885,0.638388,0.000316896,0.0002404191,0.0001659634,0.0007969756,0.0003486693,0.01380921],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005551686,"threshold_uncertainty_score":0.01857227,"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","authors":[{"name":"Khoongming Khoo","is_ca":false},{"name":"Guang Gong","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009697395,0.001059599,0.0006328165,0.002639388,0.001022818,0.002780925,0.0009616636,0.001151341,0.003955167],"category_scores_gemma":[0.002904145,0.0004625683,0.0006564053,0.001742704,0.003344321,0.004410178,0.002165012,0.003337867,0.0008557865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001015036,"about_ca_system_score_gemma":0.0004648717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003575034,"about_ca_topic_score_gemma":0.0002983138,"domain_scores_codex":[0.9992577,0.0001434113,0.00005175879,0.0001614376,0.0002445189,0.0001409983],"domain_scores_gemma":[0.9977049,0.0007771492,0.000398827,0.0002669141,0.0004402193,0.0004121206],"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.00003981358,0.00002075736,0.0002605587,0.00002627322,0.000003851715,0.00006293613,0.0001826356,0.0007218131,0.002841164,0.9876707,0.0007195704,0.007449884],"study_design_scores_gemma":[0.0000116236,0.00007787961,0.0005297238,0.00002936354,0.000009780535,0.0004759083,0.0001124115,0.0139675,0.001965852,0.9763525,0.006436777,0.00003057941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4531837,0.001374065,0.4431499,0.0021307,0.0005891087,0.00009896467,0.0005668254,0.0004882546,0.09841844],"genre_scores_gemma":[0.9234037,0.0009894168,0.04728791,0.0008653813,0.0007901502,0.0001061198,0.0003849151,0.0001929622,0.02597946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003955167,"threshold_uncertainty_score":0.01323134,"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","authors":[{"name":"Claude Carlet","is_ca":false},{"name":"Palash Sarkar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313085,0.0004936476,0.0005417335,0.002057656,0.0005327071,0.001481207,0.0007828048,0.0007264602,0.004080112],"category_scores_gemma":[0.007054941,0.0002318672,0.0004106743,0.0008082268,0.00217221,0.00216916,0.0009863249,0.001182295,0.0002964479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035713,"about_ca_system_score_gemma":0.0005328255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000488803,"about_ca_topic_score_gemma":0.0002764274,"domain_scores_codex":[0.9995577,0.0001635273,0.00001241563,0.00005450866,0.0001290332,0.00008278107],"domain_scores_gemma":[0.9961759,0.002463327,0.000438669,0.000274785,0.0004117523,0.0002356142],"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.00007774969,0.0000359604,0.0003682061,0.00003365652,0.00001115292,0.00005498104,0.00007909392,0.02307058,0.002202021,0.9662184,0.0009032339,0.006945034],"study_design_scores_gemma":[0.00001936967,0.00003249832,0.0004657377,0.00002046526,0.000009508294,0.0001383672,0.00008620068,0.281619,0.00155043,0.7148975,0.001140136,0.00002081793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4941118,0.001089111,0.4644615,0.001536999,0.0001360764,0.00005435644,0.0001971631,0.0002295611,0.03818339],"genre_scores_gemma":[0.9854116,0.0003966427,0.008918418,0.0001663371,0.0001410444,0.00003472952,0.00007888352,0.00003354887,0.004818793],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004080112,"threshold_uncertainty_score":0.01364934,"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","authors":[{"name":"Jin-Ho Chung","is_ca":false},{"name":"Kyeongcheol Yang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784646,0.001323876,0.0009969919,0.00142914,0.0006062285,0.001287111,0.00110263,0.00164368,0.005116338],"category_scores_gemma":[0.01539103,0.0006538735,0.0004915689,0.001330041,0.001027468,0.002651274,0.001514181,0.001702227,0.001475911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085734,"about_ca_system_score_gemma":0.002002381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001326455,"about_ca_topic_score_gemma":0.00199654,"domain_scores_codex":[0.9980808,0.000655364,0.0001461947,0.0003472558,0.0005057884,0.000264509],"domain_scores_gemma":[0.9944879,0.003588921,0.0003495456,0.0006668501,0.000680602,0.000226223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001239811,0.0002374725,0.001189997,0.0004727548,0.0001064399,0.0003415807,0.0003768732,0.582265,0.01587321,0.1513462,0.006667569,0.239883],"study_design_scores_gemma":[0.0001350736,0.0001782472,0.0003703641,0.0001083905,0.00004329853,0.0002853286,0.00007705882,0.9217916,0.004505952,0.06685308,0.005587014,0.00006457888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05322323,0.001452058,0.9303473,0.0007385543,0.0003906975,0.0001848839,0.0003880441,0.0006096404,0.01266562],"genre_scores_gemma":[0.5936849,0.001180109,0.3934727,0.0003243958,0.0003776374,0.0004358056,0.0006683388,0.0001993027,0.009656786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005116338,"threshold_uncertainty_score":0.01711589,"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","authors":[{"name":"Arjen K. Lenstra","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005358972,0.000952136,0.0005381133,0.001101545,0.0009225691,0.001898517,0.0005289405,0.0006078986,0.02678907],"category_scores_gemma":[0.00227934,0.0003244331,0.0005951033,0.001279582,0.001537655,0.003390115,0.001653512,0.001733393,0.008049577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008466133,"about_ca_system_score_gemma":0.0005627201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004183219,"about_ca_topic_score_gemma":0.0004566712,"domain_scores_codex":[0.9991435,0.0001307313,0.00004499774,0.0002499341,0.0002784582,0.00015237],"domain_scores_gemma":[0.9991547,0.0001757666,0.00007339015,0.0003888537,0.0001580633,0.0000493129],"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.0001648525,0.00003776893,0.0001947824,0.00009794273,0.00001266492,0.00006421171,0.0001188908,0.002898064,0.005696794,0.8195982,0.01002543,0.1610904],"study_design_scores_gemma":[0.00004817054,0.0001442072,0.0002108066,0.00008035121,0.00003309683,0.0004061571,0.00009008672,0.01189195,0.01712686,0.800198,0.1697282,0.00004196827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04589275,0.002124292,0.6031575,0.001505452,0.001228554,0.0001642674,0.0005683259,0.001699208,0.3436598],"genre_scores_gemma":[0.5827075,0.002602117,0.2280553,0.001352341,0.0009722266,0.0002115005,0.001132988,0.001015056,0.181951],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02678907,"threshold_uncertainty_score":0.08961838,"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","authors":[{"name":"Ran Canetti","is_ca":false},{"name":"John Friedlander","is_ca":true},{"name":"Sergeĭ Konyagin","is_ca":false},{"name":"Michael Larsen","is_ca":false},{"name":"Daniel Lieman","is_ca":false},{"name":"Igor E. Shparlinski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01337859,0.0008818707,0.001686327,0.004648429,0.002025649,0.005001364,0.002720755,0.00199598,0.003306562],"category_scores_gemma":[0.06799958,0.001236597,0.0009769263,0.003821696,0.008345552,0.01452664,0.003497002,0.005720041,0.0004712016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002979345,"about_ca_system_score_gemma":0.002114795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009550096,"about_ca_topic_score_gemma":0.0005086622,"domain_scores_codex":[0.9954204,0.002173855,0.0002495636,0.0005215194,0.001193884,0.0004408189],"domain_scores_gemma":[0.8811418,0.09668958,0.007266483,0.007448926,0.005053687,0.002399567],"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.00005901508,0.00002874095,0.001023829,0.00004073903,0.00001785388,0.0000684476,0.0001667825,0.00479341,0.0004098821,0.9882461,0.001035858,0.004109251],"study_design_scores_gemma":[0.00001874936,0.00002516342,0.0006484877,0.0000334039,0.00001154737,0.0001195042,0.00006661493,0.04150245,0.0003267062,0.9562738,0.0009423943,0.00003108118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4386793,0.006762958,0.4910133,0.01273083,0.0007014835,0.0001465746,0.001020061,0.0002476696,0.04869787],"genre_scores_gemma":[0.9723825,0.003797219,0.01763982,0.0007288668,0.001308672,0.0001566889,0.0004635629,0.000111944,0.003410735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01337859,"threshold_uncertainty_score":0.07075357,"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","authors":[{"name":"Danilo Silva","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007414995,0.0006830088,0.0005375481,0.001067961,0.0005975128,0.001420236,0.0006703266,0.0008517531,0.001923519],"category_scores_gemma":[0.002736773,0.0002161595,0.0004134079,0.001000525,0.0006051902,0.001118622,0.00141474,0.0009817507,0.001252383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007424997,"about_ca_system_score_gemma":0.001109898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001093228,"about_ca_topic_score_gemma":0.001129698,"domain_scores_codex":[0.9991536,0.0002414756,0.00005921527,0.0000965263,0.0003175233,0.0001316399],"domain_scores_gemma":[0.9988952,0.0004148599,0.0001136706,0.0002012577,0.0003208207,0.00005414318],"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.0008396747,0.00008970199,0.001669101,0.0002278498,0.00005971504,0.0004409017,0.0005821129,0.1047043,0.09430101,0.3466285,0.006157668,0.4442994],"study_design_scores_gemma":[0.00007444487,0.0001668505,0.000410332,0.00007018517,0.00002275387,0.0006671675,0.0001010239,0.7504007,0.1146602,0.1193999,0.01396994,0.00005655878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06839412,0.000560839,0.9214183,0.0003532433,0.0001283371,0.00007165153,0.0001756162,0.0008475631,0.008050287],"genre_scores_gemma":[0.4132342,0.0005795064,0.5778195,0.0001721645,0.0001046785,0.0001039538,0.000415166,0.000156242,0.007414528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001923519,"threshold_uncertainty_score":0.006434858,"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","authors":[{"name":"Koichi Betsumiya","is_ca":false},{"name":"S. Georgiou","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Masaaki Harada","is_ca":false},{"name":"Christos Koukouvinos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377214,0.001173118,0.001051206,0.003700879,0.00298231,0.003108136,0.000983744,0.00175806,0.005573838],"category_scores_gemma":[0.004876408,0.0007557023,0.0009670993,0.002838625,0.004463438,0.006289139,0.003989411,0.003517271,0.0007940971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001948081,"about_ca_system_score_gemma":0.001058692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007674189,"about_ca_topic_score_gemma":0.0005977021,"domain_scores_codex":[0.9989409,0.0002712643,0.00004531401,0.0001528383,0.0003221977,0.0002674079],"domain_scores_gemma":[0.9961733,0.002048237,0.0005247209,0.0003907953,0.0004199146,0.0004429431],"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.00003971918,0.0000137939,0.0001134484,0.00001783593,0.000002960837,0.00006128766,0.0001461549,0.0005766414,0.000239842,0.9967602,0.000531635,0.001496398],"study_design_scores_gemma":[0.00001301356,0.00001329648,0.00007434701,0.00001497441,0.00000535134,0.0001084729,0.00004723458,0.002152585,0.0003018152,0.9959287,0.001331222,0.000008900797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6609262,0.002340487,0.1568193,0.007612118,0.001012779,0.0001226147,0.0006084815,0.0003048858,0.1702532],"genre_scores_gemma":[0.9486635,0.001657924,0.01152518,0.0007987978,0.0009209341,0.00009620673,0.0003706191,0.0001281204,0.03583885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005573838,"threshold_uncertainty_score":0.01864636,"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","authors":[{"name":"John Friedlander","is_ca":true},{"name":"Jan Hansen","is_ca":false},{"name":"Igor E. Shparlinski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001817474,0.001649344,0.001134589,0.004008758,0.001878198,0.00537211,0.001198172,0.001267105,0.01055735],"category_scores_gemma":[0.0136655,0.0006572357,0.001048559,0.00281582,0.002668374,0.01113018,0.004370425,0.002889697,0.003317954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001102146,"about_ca_system_score_gemma":0.0005841054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002629679,"about_ca_topic_score_gemma":0.0001941424,"domain_scores_codex":[0.9978411,0.0004753188,0.0001945018,0.0003866213,0.0006350598,0.0004673721],"domain_scores_gemma":[0.9955996,0.002362492,0.0004738054,0.0005675734,0.0006356893,0.0003608098],"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.00006951814,0.00002824418,0.0004621651,0.00008387529,0.00001256113,0.0001275388,0.0001762343,0.003419042,0.0008875037,0.974817,0.001762602,0.0181537],"study_design_scores_gemma":[0.000007298661,0.00002895916,0.0002664176,0.00005872611,0.00001996482,0.0004007033,0.00006853714,0.01925831,0.001850073,0.9683908,0.00962426,0.00002599076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2558498,0.006526674,0.4768032,0.002735989,0.001256685,0.0001141375,0.0004668952,0.0009559062,0.2552906],"genre_scores_gemma":[0.9017082,0.003760141,0.04571129,0.0006140381,0.002128503,0.0002268217,0.0005822612,0.0004022504,0.04486644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01055735,"threshold_uncertainty_score":0.03531784,"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","authors":[{"name":"Yassir Nawaz","is_ca":true},{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275696,0.001178364,0.000697023,0.0008060318,0.0005115055,0.00127995,0.0007444545,0.0008764347,0.001601891],"category_scores_gemma":[0.002316911,0.000329439,0.0008022185,0.0008895099,0.0009852537,0.001847909,0.001282727,0.001514589,0.001353292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004053135,"about_ca_system_score_gemma":0.0007497782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001020375,"about_ca_topic_score_gemma":0.00009929002,"domain_scores_codex":[0.9992755,0.0002064909,0.00005111807,0.0001155919,0.0002335528,0.0001177376],"domain_scores_gemma":[0.9987828,0.0002587499,0.0001925228,0.0005052389,0.0001395726,0.0001211095],"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.0015671,0.0002736835,0.002481427,0.0007039834,0.0002419024,0.00072718,0.0003299916,0.04503926,0.09088428,0.5476194,0.02910189,0.2810299],"study_design_scores_gemma":[0.0003869435,0.001228851,0.002365513,0.0002227648,0.0002780174,0.003893923,0.00009362863,0.2623229,0.1567606,0.4399106,0.1323493,0.0001869677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1065943,0.002213022,0.8619236,0.0008486025,0.0005091836,0.0005352963,0.001030206,0.005357427,0.02098841],"genre_scores_gemma":[0.7443077,0.002478118,0.2235527,0.0008909457,0.0002856945,0.0007021136,0.001482744,0.0008844854,0.0254155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001601891,"threshold_uncertainty_score":0.00674665,"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","authors":[{"name":"Peter Borwein","is_ca":true},{"name":"Kenneth Choi","is_ca":true},{"name":"Jonathan Jedwab","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562905,0.0003867972,0.0005412669,0.001039723,0.001071173,0.001033527,0.0004556778,0.001224551,0.006655586],"category_scores_gemma":[0.01129417,0.0002247517,0.0003816316,0.0008883892,0.001146624,0.002256366,0.0008034793,0.001541709,0.002069267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009214125,"about_ca_system_score_gemma":0.0008884054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002665168,"about_ca_topic_score_gemma":0.0004133112,"domain_scores_codex":[0.999243,0.0002087586,0.00005816981,0.0001069935,0.0002524867,0.000130644],"domain_scores_gemma":[0.9944938,0.003422314,0.0005301844,0.0006154148,0.0006583845,0.0002798932],"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.001119208,0.0001223099,0.003527976,0.0003827426,0.0000335677,0.000556338,0.0004426627,0.01975616,0.07666548,0.728747,0.004948664,0.1636979],"study_design_scores_gemma":[0.0001510647,0.0008588235,0.003690531,0.0003418264,0.00005425939,0.004046751,0.0002740939,0.1275622,0.08730537,0.7167318,0.05886605,0.000117173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5951915,0.003719941,0.3221981,0.004056732,0.0004788273,0.0001178087,0.0005409662,0.0008170216,0.07287907],"genre_scores_gemma":[0.8839629,0.0008952636,0.1038825,0.0004025345,0.0001786144,0.0001243638,0.0004062728,0.0001480396,0.009999477],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006655586,"threshold_uncertainty_score":0.02226514,"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","authors":[{"name":"Arash Hariri","is_ca":true},{"name":"Keivan Navi","is_ca":false},{"name":"Reza Rastegar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003799394,0.0007736665,0.001035983,0.001457816,0.00128045,0.002115282,0.001068919,0.0009262396,0.008258906],"category_scores_gemma":[0.0005780699,0.0004352696,0.0006117451,0.001336361,0.0009114206,0.004281584,0.002609176,0.001107719,0.002838493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004928269,"about_ca_system_score_gemma":0.0004912599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008978544,"about_ca_topic_score_gemma":0.0001385135,"domain_scores_codex":[0.9993204,0.0000831681,0.00006298247,0.00017227,0.0002821868,0.00007891595],"domain_scores_gemma":[0.9996868,0.00005936445,0.00003766032,0.0001298982,0.00005002665,0.00003620217],"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.000830169,0.0002258582,0.000715243,0.0005228025,0.00008507427,0.0006982629,0.0003464223,0.01005044,0.1366695,0.6015165,0.01289789,0.2354419],"study_design_scores_gemma":[0.0003438964,0.0006311039,0.0008770474,0.0001741779,0.0002355315,0.004010254,0.0001866039,0.09444019,0.2143375,0.5470474,0.1373986,0.0003176433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2156052,0.002344145,0.6654157,0.00133603,0.000874561,0.0002173933,0.0008876168,0.003374781,0.1099446],"genre_scores_gemma":[0.662925,0.001143916,0.2955829,0.0006213753,0.0003915248,0.0002353893,0.001169972,0.0004683101,0.03746162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008258906,"threshold_uncertainty_score":0.02762878,"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","authors":[{"name":"James A. Muir","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982694,0.0006374473,0.0006641943,0.001114778,0.00225992,0.003561353,0.001455868,0.0008602812,0.01660369],"category_scores_gemma":[0.0052502,0.000888739,0.001505923,0.001203288,0.002142496,0.006163104,0.002553096,0.002089277,0.003820353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001182908,"about_ca_system_score_gemma":0.0007902951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002199607,"about_ca_topic_score_gemma":0.002748064,"domain_scores_codex":[0.9984772,0.000237137,0.0001552021,0.0005373675,0.0004027897,0.000190298],"domain_scores_gemma":[0.9980799,0.0007415256,0.0001580823,0.0003280815,0.0005511849,0.0001411082],"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.0001206308,0.00003788275,0.0006571212,0.0001603333,0.00003211617,0.0002523096,0.0007655647,0.0006812974,0.002443405,0.967348,0.005783293,0.02171795],"study_design_scores_gemma":[0.00003361056,0.00004673611,0.0006252252,0.00005618964,0.00005112974,0.0004254768,0.0003517209,0.003029493,0.004095163,0.9480346,0.04321514,0.00003539047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1691359,0.001655476,0.4643888,0.003709708,0.0007956378,0.0002256398,0.002939005,0.002171735,0.3549781],"genre_scores_gemma":[0.7551953,0.0007710156,0.1333067,0.001062679,0.0005895429,0.0003729209,0.00353516,0.001366157,0.1038005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01660369,"threshold_uncertainty_score":0.05554485,"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","authors":[{"name":"Qiang Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007111215,0.0007526352,0.0007815377,0.002236827,0.001315053,0.002028586,0.000785161,0.001248621,0.00703156],"category_scores_gemma":[0.004305541,0.0003718323,0.0004692446,0.002654348,0.004620944,0.003844797,0.001332939,0.002996798,0.0006583491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001362817,"about_ca_system_score_gemma":0.0007724874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005544786,"about_ca_topic_score_gemma":0.0006083403,"domain_scores_codex":[0.9995357,0.0001457495,0.00001389523,0.00007136072,0.0001368135,0.00009648468],"domain_scores_gemma":[0.9979741,0.001178513,0.000336525,0.0002324008,0.0001225064,0.0001558722],"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.00001928367,0.00001190042,0.00007162827,0.00001563845,0.000001617797,0.00003482324,0.00005795878,0.000640407,0.0003298679,0.994371,0.0008024763,0.00364347],"study_design_scores_gemma":[0.000009067427,0.000009787457,0.00009579107,0.000007236777,0.000002075928,0.00007033547,0.00002297248,0.002667045,0.000213764,0.9953946,0.001500253,0.000007001187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5943659,0.009029286,0.1586033,0.01019097,0.001765459,0.00009514583,0.0005286699,0.000393776,0.2250275],"genre_scores_gemma":[0.9613106,0.002409212,0.01278988,0.0005388872,0.001613911,0.00007495059,0.0001238718,0.00007011727,0.02106852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00703156,"threshold_uncertainty_score":0.02352291,"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","authors":[{"name":"Mahdi Shabany","is_ca":true},{"name":"P.G. Gulak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003911004,0.0003959987,0.0006787899,0.0004355224,0.0004988111,0.0007299686,0.0007833891,0.000462006,0.00249124],"category_scores_gemma":[0.001163027,0.0002210938,0.0004170654,0.0005813811,0.0006313951,0.000778931,0.0008405229,0.0007643277,0.001165215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004314454,"about_ca_system_score_gemma":0.0009872717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007240208,"about_ca_topic_score_gemma":0.001495607,"domain_scores_codex":[0.9995909,0.0001453488,0.0000188113,0.00004985897,0.0001502895,0.00004474908],"domain_scores_gemma":[0.9996561,0.0001411642,0.00003050058,0.00008880396,0.00006201035,0.00002146438],"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.0004317688,0.0002048925,0.0006925779,0.0002615498,0.00008799356,0.0003129837,0.0001795108,0.1999496,0.09568813,0.1539561,0.007033812,0.541201],"study_design_scores_gemma":[0.00004972731,0.0001559872,0.0001457703,0.00001409583,0.00001351344,0.0004149074,0.00003155099,0.9225341,0.03641574,0.03400762,0.006175037,0.00004188426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0102212,0.0001488229,0.9854776,0.0001177201,0.00004841352,0.00002968014,0.00003008708,0.0005545211,0.003371921],"genre_scores_gemma":[0.1961115,0.000133598,0.8011283,0.00008160195,0.00003645277,0.00006029185,0.00007847913,0.00005059557,0.002319208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00249124,"threshold_uncertainty_score":0.008334041,"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","authors":[{"name":"Warren J. Gross","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true},{"name":"R. Koetter","is_ca":false},{"name":"P.G. Gulak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006109291,0.0004751092,0.0003703748,0.0007495672,0.0004027965,0.0008023538,0.0006038475,0.0004052215,0.001566949],"category_scores_gemma":[0.004483208,0.0001983528,0.0002677311,0.0006616678,0.0009415102,0.0008175245,0.001105174,0.0007301515,0.0006197521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006082223,"about_ca_system_score_gemma":0.0006819272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004554902,"about_ca_topic_score_gemma":0.0006619567,"domain_scores_codex":[0.9989322,0.0003267712,0.00008376243,0.00009250337,0.0004949226,0.00006992576],"domain_scores_gemma":[0.9976209,0.001316131,0.0002424513,0.0003099503,0.0004691394,0.00004143377],"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.0002835764,0.00006823175,0.001236463,0.0003910666,0.0000424516,0.0003244524,0.0003264285,0.2008974,0.05611531,0.4192015,0.00126993,0.3198432],"study_design_scores_gemma":[0.00003786452,0.0002486784,0.0003504984,0.0000620319,0.00002571745,0.0006413429,0.00006661369,0.7620361,0.09201065,0.1323418,0.01212791,0.00005076205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03186767,0.0007544016,0.9530516,0.0002586717,0.00007139619,0.00006263499,0.00003640597,0.0004773503,0.01341988],"genre_scores_gemma":[0.6660341,0.001330077,0.3268006,0.0001461828,0.0001232796,0.0000642974,0.00008692488,0.00007331113,0.005341339],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001566949,"threshold_uncertainty_score":0.00524193,"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","authors":[{"name":"Warren J. Gross","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true},{"name":"R. Koetter","is_ca":false},{"name":"P.G. Gulak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654939,0.0004596719,0.0004068699,0.0006944166,0.0004424894,0.0009153821,0.001868169,0.0006809527,0.004103363],"category_scores_gemma":[0.0009149903,0.0003497389,0.0003324394,0.0005427868,0.0002738937,0.0008069275,0.000586995,0.0008243761,0.001868156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006608832,"about_ca_system_score_gemma":0.0009021754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233396,"about_ca_topic_score_gemma":0.003042476,"domain_scores_codex":[0.9997148,0.00004908382,0.00002459467,0.00004343032,0.0001246375,0.00004341864],"domain_scores_gemma":[0.9995351,0.0001156186,0.00004458948,0.00007188231,0.0002026091,0.00003032296],"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.001115822,0.000252743,0.00174942,0.0005705029,0.0001474688,0.0003997086,0.0003194858,0.05094152,0.4192899,0.0600302,0.008652227,0.456531],"study_design_scores_gemma":[0.0002165892,0.001728479,0.001278146,0.0001631633,0.0001993427,0.0006889551,0.0000880363,0.593959,0.3324555,0.02124787,0.04787013,0.0001047707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05057278,0.0009271129,0.9376427,0.0004279031,0.0001993401,0.0001434658,0.0001365845,0.003752486,0.006197619],"genre_scores_gemma":[0.331223,0.0006564239,0.6575284,0.0004033723,0.0001704146,0.00012552,0.0004767622,0.0001425704,0.009273568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004103363,"threshold_uncertainty_score":0.01372713,"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","authors":[{"name":"Taher Abualrub","is_ca":false},{"name":"Ali Ghrayeb","is_ca":true},{"name":"Nuh Aydın","is_ca":false},{"name":"İrfan Şiap","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000598903,0.0002961617,0.0002740614,0.0009640198,0.0009262423,0.0007272065,0.0004196285,0.0004685357,0.003673556],"category_scores_gemma":[0.001563039,0.0002012809,0.0004614888,0.0006934478,0.001744395,0.001295062,0.001202044,0.0008342862,0.0005927066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006797817,"about_ca_system_score_gemma":0.000638484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009342195,"about_ca_topic_score_gemma":0.0005638161,"domain_scores_codex":[0.999275,0.0001832253,0.00002676922,0.000109606,0.0002617392,0.0001436159],"domain_scores_gemma":[0.9988809,0.000327671,0.0001743307,0.0002146399,0.0002852148,0.0001172855],"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.00003234324,0.00001291814,0.0004395452,0.00005233091,0.000004860463,0.0001156263,0.0002027072,0.004199882,0.002673274,0.9820286,0.0007460736,0.009491953],"study_design_scores_gemma":[0.00002701239,0.000149226,0.00080148,0.00005803289,0.00001547671,0.0008241151,0.0001735203,0.05724158,0.009939755,0.9067097,0.02400062,0.00005946919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4584228,0.002131369,0.4485928,0.0009132265,0.000522202,0.00009681319,0.0003004493,0.0003038443,0.08871649],"genre_scores_gemma":[0.9219827,0.001059356,0.05742434,0.0003328883,0.0003535274,0.00007423692,0.0002591365,0.0001142774,0.01839952],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003673556,"threshold_uncertainty_score":0.01228929,"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","authors":[{"name":"Ariane M. Masuda","is_ca":true},{"name":"Michael E. Zieve","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00202051,0.0008165038,0.0008115461,0.001452796,0.001703322,0.00280628,0.0008076591,0.0007236666,0.02271044],"category_scores_gemma":[0.007786104,0.0005487473,0.001229717,0.001208349,0.002676391,0.005322281,0.002268807,0.00281617,0.00569881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001500131,"about_ca_system_score_gemma":0.001079692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001313796,"about_ca_topic_score_gemma":0.001214169,"domain_scores_codex":[0.9986186,0.0003073548,0.00007390731,0.0002759065,0.0004010962,0.0003231882],"domain_scores_gemma":[0.9971077,0.001543595,0.0002964139,0.0003371618,0.0004817783,0.0002333799],"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.00007108441,0.00002453949,0.0005847668,0.0000710535,0.00001378486,0.0002815569,0.0001850706,0.0008700557,0.0007355135,0.980603,0.006172461,0.01038707],"study_design_scores_gemma":[0.00003825341,0.00004203969,0.0005083052,0.00004250207,0.00002800335,0.0004694037,0.00009156988,0.008779531,0.001933666,0.9740279,0.01401502,0.00002375369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2323136,0.001662081,0.3250872,0.004775901,0.00204292,0.0001255509,0.001126034,0.001491114,0.4313756],"genre_scores_gemma":[0.881398,0.001617645,0.0327049,0.001183399,0.001534036,0.0001833155,0.0009089876,0.0005595294,0.07991013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02271044,"threshold_uncertainty_score":0.07597399,"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","authors":[{"name":"Nam Yul Yu","is_ca":true},{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000245242,0.0002575981,0.0003370815,0.0006171627,0.0006619425,0.0004273743,0.0003018314,0.0003107731,0.001982127],"category_scores_gemma":[0.001080689,0.0001925208,0.0003846043,0.0006183496,0.0004225137,0.0007212372,0.000524129,0.0004267331,0.0004149908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000474555,"about_ca_system_score_gemma":0.0005324777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004349948,"about_ca_topic_score_gemma":0.0003664758,"domain_scores_codex":[0.9996803,0.00006296473,0.00002332149,0.00009013511,0.00009088538,0.00005230618],"domain_scores_gemma":[0.9993193,0.0001811206,0.0001086909,0.0001295363,0.0001712559,0.00009008573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000779268,0.0001563426,0.007243744,0.0004658999,0.00006466566,0.001927417,0.0008673104,0.0275782,0.3686444,0.3081181,0.009147711,0.2750069],"study_design_scores_gemma":[0.0001402185,0.001030899,0.01114986,0.0001800767,0.0001249273,0.009618524,0.0003769041,0.3924577,0.3079542,0.1267607,0.1499879,0.0002181654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5852212,0.001451866,0.3760937,0.0004343195,0.0001542586,0.00009773653,0.0006324545,0.0009279184,0.03498644],"genre_scores_gemma":[0.8318835,0.0007557846,0.1513167,0.0002101547,0.0000794624,0.0001600996,0.001040449,0.0001410047,0.01441287],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001982127,"threshold_uncertainty_score":0.006630838,"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","authors":[{"name":"Amir Akbary","is_ca":true},{"name":"Dragos Ghioca","is_ca":true},{"name":"Qiang Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168174,0.001313618,0.001180222,0.002230129,0.001626355,0.002361036,0.001250682,0.001791283,0.006864659],"category_scores_gemma":[0.006197837,0.0006434118,0.0008316395,0.002976649,0.005382152,0.005055677,0.002783972,0.003003329,0.001251146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001796144,"about_ca_system_score_gemma":0.001033582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001058135,"about_ca_topic_score_gemma":0.0009357646,"domain_scores_codex":[0.9990882,0.0003115103,0.00002681055,0.0001101864,0.000271296,0.0001920569],"domain_scores_gemma":[0.9971944,0.001720923,0.0003422444,0.0003111892,0.0002345639,0.0001966554],"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.00002127869,0.000007109438,0.00003885987,0.00001281793,0.000001239047,0.00002672443,0.00007459768,0.001085897,0.0002047378,0.9947948,0.0005099652,0.003222106],"study_design_scores_gemma":[0.000008466151,0.000008949333,0.00003765543,0.00001014923,0.000001961973,0.00004679435,0.00002808072,0.004344081,0.0001517126,0.9939544,0.001400013,0.000007654136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3844059,0.003131205,0.3939081,0.004762758,0.001382809,0.0001267262,0.0005198751,0.0004180283,0.2113445],"genre_scores_gemma":[0.9102749,0.003190243,0.03298407,0.0006969993,0.001268216,0.0001270435,0.0003127627,0.0002304301,0.05091536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006864659,"threshold_uncertainty_score":0.0229646,"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","authors":[{"name":"Amir Akbary","is_ca":true},{"name":"Qiang Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002182596,0.001837901,0.0009789584,0.002266365,0.001846416,0.003756718,0.001236794,0.0008812378,0.09451891],"category_scores_gemma":[0.009353681,0.0007291006,0.002017422,0.002992651,0.002235978,0.006661515,0.003530303,0.003587863,0.03915093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002947942,"about_ca_system_score_gemma":0.001698026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0118241,"about_ca_topic_score_gemma":0.0148199,"domain_scores_codex":[0.997689,0.0005222692,0.0001064054,0.0003796659,0.0007238933,0.0005786238],"domain_scores_gemma":[0.9969674,0.001497405,0.0002407068,0.0003854459,0.000759349,0.0001497853],"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.0005124512,0.0001286475,0.001024209,0.0005812252,0.00005738839,0.0004439284,0.001103722,0.008854748,0.002928566,0.7557288,0.1319004,0.09673584],"study_design_scores_gemma":[0.0001831319,0.000142222,0.001402815,0.0002913293,0.00007173778,0.0004564297,0.0005269392,0.02521796,0.004117214,0.7962809,0.1712143,0.00009503766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04006891,0.00421642,0.4821737,0.006302287,0.00321753,0.0002830326,0.005395832,0.00322435,0.4551179],"genre_scores_gemma":[0.4831841,0.008115916,0.1333889,0.003649585,0.003218429,0.0004707329,0.01414959,0.005914257,0.3479085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.09451891,"threshold_uncertainty_score":0.3161973,"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","authors":[{"name":"Honggang Hu","is_ca":true},{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001360354,0.0002143524,0.0002287589,0.0004781871,0.0002850634,0.0006488263,0.0003539899,0.0004273564,0.001759297],"category_scores_gemma":[0.0006793765,0.0001522868,0.0002790023,0.0004118579,0.000693657,0.0008055001,0.0004203458,0.0004019578,0.0001497801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005167397,"about_ca_system_score_gemma":0.0002464999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001924771,"about_ca_topic_score_gemma":0.0002495266,"domain_scores_codex":[0.9998457,0.00002294039,0.00001133851,0.00003342873,0.00004278438,0.00004374914],"domain_scores_gemma":[0.9996952,0.0001154372,0.00008413011,0.00004999292,0.00002662259,0.00002866415],"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.0006221379,0.00004140304,0.001226422,0.0001378876,0.00003408031,0.0003368553,0.00039212,0.01669385,0.06670915,0.8809725,0.000982351,0.03185115],"study_design_scores_gemma":[0.0002259445,0.0005535793,0.005423706,0.00008831133,0.0000999371,0.001728892,0.0003738345,0.2682244,0.07876683,0.6262804,0.01810071,0.0001334457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8939945,0.0009949934,0.07693391,0.0003140293,0.0001017863,0.00003376254,0.0001683224,0.0001753601,0.02728342],"genre_scores_gemma":[0.9910591,0.0002136146,0.006504239,0.00003896715,0.00002535706,0.00002373099,0.00004475462,0.00001625242,0.002073862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001759297,"threshold_uncertainty_score":0.005885422,"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","authors":[{"name":"Katherine Jarvis","is_ca":true},{"name":"Monica Nevins","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274238,0.0009360959,0.00101134,0.001960772,0.001129603,0.002975994,0.0008738309,0.0009422994,0.02347396],"category_scores_gemma":[0.004327788,0.000301651,0.0004585272,0.002053934,0.001651439,0.005148025,0.002184801,0.00272997,0.007987991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245467,"about_ca_system_score_gemma":0.0007080758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005302676,"about_ca_topic_score_gemma":0.0005027326,"domain_scores_codex":[0.9989961,0.0003099706,0.0000596174,0.0001477892,0.0002998985,0.0001866019],"domain_scores_gemma":[0.9988462,0.000459071,0.0001286779,0.0002562045,0.0001759711,0.0001338194],"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.000223211,0.00002325267,0.0001448548,0.00012728,0.000007570072,0.00009179784,0.00009817581,0.001268412,0.001297673,0.9287852,0.01214647,0.05578606],"study_design_scores_gemma":[0.00007742966,0.00006780104,0.0002049246,0.0001861007,0.00001826919,0.0002795395,0.00004153715,0.006964296,0.004929428,0.8875901,0.09960707,0.00003355457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07261589,0.01058187,0.5034696,0.004623626,0.004137109,0.0001937967,0.002384212,0.006436775,0.3955571],"genre_scores_gemma":[0.7529535,0.005449333,0.1150516,0.002227981,0.00257101,0.0003456267,0.001633894,0.00261186,0.1171552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02347396,"threshold_uncertainty_score":0.07852817,"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","authors":[{"name":"Nam Yul Yu","is_ca":true},{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003518825,0.0004284639,0.0003961373,0.0008976759,0.0003793314,0.0008758078,0.000355073,0.0005910503,0.004688524],"category_scores_gemma":[0.002258379,0.0002427836,0.0002337259,0.0007398077,0.0004205301,0.001114524,0.000596743,0.0004947138,0.001150267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007762186,"about_ca_system_score_gemma":0.0006089418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002927523,"about_ca_topic_score_gemma":0.0006165495,"domain_scores_codex":[0.9995828,0.00006890923,0.00003980489,0.00006414685,0.0001656812,0.00007863799],"domain_scores_gemma":[0.9991356,0.0002244342,0.0001666334,0.0001409249,0.0002508582,0.00008159527],"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.001476061,0.0001937437,0.002592082,0.0004488125,0.00005542293,0.0008269743,0.0003250401,0.03836764,0.2766019,0.3202824,0.006448589,0.3523814],"study_design_scores_gemma":[0.0003674813,0.0009046875,0.003841345,0.000188448,0.000139061,0.002775063,0.000257002,0.3600864,0.4087806,0.1417663,0.08067638,0.0002172132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5444265,0.001524703,0.4070625,0.0009292411,0.0006283834,0.0001670777,0.0008703905,0.0009023739,0.04348886],"genre_scores_gemma":[0.7526487,0.000509813,0.2253774,0.0002402987,0.0001260977,0.000144851,0.0009482027,0.0001289249,0.01987564],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004688524,"threshold_uncertainty_score":0.01568472,"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","authors":[{"name":"G.L. Feng","is_ca":false},{"name":"Dian‐Wu Yue","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006584301,0.0004681238,0.0007964434,0.001636241,0.001402481,0.001467005,0.0004400894,0.0008714973,0.003275493],"category_scores_gemma":[0.005587858,0.0002774907,0.0004715659,0.001885671,0.001658469,0.00173835,0.001483518,0.001609108,0.0005798042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008239355,"about_ca_system_score_gemma":0.0004706617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003211499,"about_ca_topic_score_gemma":0.0003140614,"domain_scores_codex":[0.9993892,0.0002028167,0.00003360994,0.000107256,0.0001735533,0.00009358284],"domain_scores_gemma":[0.9981944,0.0009305808,0.0003046177,0.0001820051,0.0002123691,0.0001759567],"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.00005279989,0.0000183163,0.0004693599,0.00004852043,0.00000650703,0.00008236022,0.0001543318,0.007969973,0.001782655,0.9765459,0.001378774,0.01149061],"study_design_scores_gemma":[0.00002429691,0.00005368163,0.000350151,0.0000325675,0.000006818101,0.0002840451,0.0001283081,0.03564593,0.002826574,0.954212,0.006405316,0.00003036074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5611381,0.003210253,0.343878,0.00244119,0.0004487638,0.0001409201,0.0005875967,0.0003139052,0.08784129],"genre_scores_gemma":[0.9367504,0.001119574,0.05513979,0.0002254922,0.0003244347,0.0001814769,0.0003104086,0.00007965798,0.005868832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.003275493,"threshold_uncertainty_score":0.0109576,"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","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002950879,0.0004229772,0.0003814222,0.001331829,0.0003338054,0.0006834138,0.0004074109,0.0007082128,0.003138198],"category_scores_gemma":[0.002344717,0.0001977176,0.0002455637,0.001731261,0.000575526,0.0007473034,0.000601252,0.0005289224,0.0005283154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004197169,"about_ca_system_score_gemma":0.0003916516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003591574,"about_ca_topic_score_gemma":0.0004186328,"domain_scores_codex":[0.9997398,0.00005115348,0.00001435474,0.00003266837,0.0001391377,0.00002294037],"domain_scores_gemma":[0.9992118,0.0004265507,0.00005659675,0.0001205284,0.0001557999,0.00002876774],"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.0004043899,0.000104726,0.0006975785,0.0003273208,0.00002889474,0.0004717174,0.0002468941,0.05619313,0.05056242,0.4332443,0.005104821,0.4526138],"study_design_scores_gemma":[0.00006454861,0.0002869904,0.00131975,0.0001715312,0.00003797802,0.001938822,0.0001378527,0.6508653,0.05234485,0.2660126,0.02676015,0.00005967083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2274082,0.01314722,0.6837091,0.001320399,0.0009366926,0.0001433175,0.0003328341,0.0007178146,0.0722843],"genre_scores_gemma":[0.7656017,0.007464442,0.199302,0.0003744142,0.0009196844,0.0001502211,0.0006116427,0.0000988349,0.02547714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003138198,"threshold_uncertainty_score":0.01049829,"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","authors":[{"name":"Philippe Flajolet","is_ca":false},{"name":"Xavier Gourdon","is_ca":false},{"name":"Daniel Panario","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004292123,0.00164445,0.002631367,0.002312928,0.003298927,0.007290965,0.003317953,0.003272804,0.009335808],"category_scores_gemma":[0.02157367,0.00127181,0.002823535,0.003236883,0.005315383,0.01986255,0.003341193,0.005873858,0.002149862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003731107,"about_ca_system_score_gemma":0.005638136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001709729,"about_ca_topic_score_gemma":0.001416464,"domain_scores_codex":[0.9950901,0.001079713,0.0002273287,0.0009974953,0.00166448,0.0009408124],"domain_scores_gemma":[0.9815166,0.01252352,0.001047319,0.002208649,0.001992743,0.0007112286],"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.000624633,0.00023701,0.001349866,0.000264257,0.00008821216,0.0001134722,0.0003794313,0.03799253,0.001829856,0.910264,0.009173687,0.03768297],"study_design_scores_gemma":[0.00005106419,0.00006279181,0.0002090605,0.00004171014,0.00003262263,0.00009863393,0.00005262779,0.06675082,0.001170508,0.9292145,0.002286003,0.00002963457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2356657,0.002534546,0.703198,0.007465903,0.0003402991,0.0002558407,0.00122086,0.001143455,0.04817543],"genre_scores_gemma":[0.8732647,0.001845742,0.09531848,0.001166293,0.001358122,0.0002053011,0.001854262,0.0005822322,0.02440485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009335808,"threshold_uncertainty_score":0.0312314,"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","authors":[{"name":"Rudolf Mathon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660973,0.0006391908,0.0006561086,0.001678965,0.002256551,0.003472609,0.001096013,0.001221239,0.01116204],"category_scores_gemma":[0.002673621,0.0006877931,0.0006809547,0.001683668,0.002234176,0.004216213,0.001966472,0.003109767,0.001244568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588354,"about_ca_system_score_gemma":0.0005293236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009386748,"about_ca_topic_score_gemma":0.001455222,"domain_scores_codex":[0.999567,0.00009624224,0.00003042146,0.0001031367,0.0001001104,0.0001031605],"domain_scores_gemma":[0.9988782,0.0005229555,0.0001465644,0.0001252379,0.0001104685,0.0002165606],"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.000130136,0.00002594331,0.0004097819,0.00005362102,0.000008165121,0.0001439379,0.0002771623,0.001231831,0.001249478,0.9835789,0.001926778,0.01096425],"study_design_scores_gemma":[0.00003943516,0.0000236856,0.0003902481,0.00002877642,0.00002023585,0.0002747781,0.0002763871,0.004312674,0.002420983,0.9718798,0.02031557,0.00001749527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5760765,0.001770035,0.1166616,0.002853653,0.0006319502,0.000141317,0.001066372,0.0007102318,0.3000884],"genre_scores_gemma":[0.8881231,0.001108112,0.0516452,0.0003570347,0.0003032204,0.00007726204,0.0006883349,0.0003189791,0.05737878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01116204,"threshold_uncertainty_score":0.03734076,"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","authors":[{"name":"Koray Karabina","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337055,0.000409016,0.0004156089,0.0007533004,0.0004942441,0.0008736295,0.0006090518,0.000507796,0.00377914],"category_scores_gemma":[0.002692081,0.0001554643,0.0004914035,0.0007668776,0.0009636906,0.002355661,0.001259066,0.0009719515,0.000692515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004466424,"about_ca_system_score_gemma":0.0002985297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002069895,"about_ca_topic_score_gemma":0.0003422791,"domain_scores_codex":[0.9996093,0.00005812126,0.00003854711,0.00007185325,0.0001701606,0.00005207591],"domain_scores_gemma":[0.9992378,0.0002586802,0.0001075699,0.0002337909,0.0001199488,0.00004220222],"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.0004707808,0.0001351902,0.001557751,0.0002547072,0.00004059195,0.0004796412,0.0005739932,0.02152571,0.08074823,0.4949564,0.004231773,0.3950253],"study_design_scores_gemma":[0.000149283,0.0008962184,0.000986343,0.0001086661,0.00008748245,0.00151862,0.0002832013,0.2316506,0.131589,0.5970373,0.03558522,0.0001080837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2386686,0.0006784266,0.7448301,0.0005648565,0.0002477728,0.000185694,0.0001290589,0.001466268,0.0132291],"genre_scores_gemma":[0.7253829,0.0004100336,0.2680147,0.0002550641,0.0002178225,0.00009218931,0.0002202227,0.0002115743,0.005195624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00377914,"threshold_uncertainty_score":0.0126425,"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","authors":[{"name":"Longjiang Qu","is_ca":false},{"name":"Yin Tan","is_ca":true},{"name":"Chao Li","is_ca":false},{"name":"Guang Gong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119393,0.001372243,0.0009644672,0.001182553,0.001564464,0.002265588,0.001484069,0.001959047,0.02392222],"category_scores_gemma":[0.002706649,0.0007630832,0.001594547,0.001693917,0.001790652,0.004288157,0.003457486,0.003205371,0.004278091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002983566,"about_ca_system_score_gemma":0.001176034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009087932,"about_ca_topic_score_gemma":0.001653725,"domain_scores_codex":[0.9983413,0.0004606401,0.0001072307,0.000281758,0.0004244668,0.0003845112],"domain_scores_gemma":[0.9987684,0.0003430486,0.000133642,0.0004931417,0.0001551529,0.0001066081],"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.0002037854,0.00006926191,0.0003929377,0.00008000643,0.000024117,0.0001084511,0.000229745,0.004835384,0.006241194,0.9591019,0.004234827,0.02447839],"study_design_scores_gemma":[0.0001561252,0.0001620647,0.0006897284,0.00009645464,0.00005766803,0.0003932523,0.0001489347,0.02359558,0.01890717,0.9014242,0.0542371,0.0001317794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1889482,0.001252112,0.6352092,0.006025184,0.001471759,0.0003081833,0.00117814,0.001606134,0.1640011],"genre_scores_gemma":[0.6189615,0.001160543,0.2492789,0.003253184,0.0005419789,0.0004997579,0.001778442,0.0009884557,0.1235372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02392222,"threshold_uncertainty_score":0.08002782,"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","authors":[{"name":"R. A. Bailey","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095715,0.0009490602,0.0007365068,0.001876438,0.000959724,0.00199029,0.0009564717,0.001666248,0.003950968],"category_scores_gemma":[0.006473483,0.0004501154,0.0005080819,0.002160243,0.00186618,0.003089859,0.002118947,0.002452151,0.001122791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009236214,"about_ca_system_score_gemma":0.001244747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005254651,"about_ca_topic_score_gemma":0.0003786359,"domain_scores_codex":[0.9988882,0.000232215,0.00005597582,0.0001357242,0.0005548015,0.0001331063],"domain_scores_gemma":[0.9963157,0.001853443,0.0004146396,0.0008430502,0.0004691856,0.0001040723],"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.0001009547,0.00003149428,0.0002848509,0.0001397469,0.00001710489,0.0002084107,0.0002568931,0.0128709,0.004125888,0.9333095,0.003393468,0.04526089],"study_design_scores_gemma":[0.00002414052,0.00003294379,0.0001440119,0.00003961917,0.00001346697,0.0002742834,0.00002659129,0.02094709,0.005819771,0.9639574,0.008695292,0.00002533379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1731643,0.005647889,0.727955,0.006854874,0.001574582,0.0002921101,0.0009033951,0.001559452,0.08204839],"genre_scores_gemma":[0.8836176,0.004849905,0.07426739,0.0009387191,0.0011504,0.0002250456,0.0007504948,0.0003358579,0.03386464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003950968,"threshold_uncertainty_score":0.01321733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}